Open AccessRound Robin Algorithm With Average Quantum Dynamic Time Based on Multicore Processor
Author(s) -
Emma R. Simarmata,
Gortap Lumbantoruan,
Reinggolan,
Junika Napitupulu
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1361/1/012005
Subject(s) - computer multitasking , computer science , multi core processor , queue , parallel computing , scheduling (production processes) , process (computing) , cpu shielding , turnaround time , central processing unit , queueing theory , operating system , mathematics , computer network , mathematical optimization
Modern operating systems that are widely used today, have used a multiprogramming system and use a multicore system to solve multiprogramming. Multicore systems provide greater efficiency than a single processor running on a single chip. The efficiency of the multicore system in completing its tasks is very dependent on the CPU scheduling algorithm used by the operating system. Round Robin algorithm is one of the CPU scheduling that is widely used in multiprogramming. With this algorithm, the CPU will divide the time for each process given the same time until the entire process in the queue is complete. In this study, the researcher improvised the Round Robin algorithm on a multicore processor system to execute the processes contained in a single queue queue that is to give a quantum time based on the average bursttime of the entire process in the queue. In order to minimize waiting time and turnaround time throughout the process.