A proposed round robin scheduling algorithm for enhancing performance of CPU utilization

• Autorzy: Phorncharoen S. , Sa-Ngiamvibool W.

Identyfikatory

DOI

10.15199/48.2018.04.07

Warianty tytułu

PL

Algorytm karuzelowy harmonogramu procesora poprawiający jego szybkość

• Języki publikacji: EN

Abstrakty

EN

An important problem of an operating system is CPU scheduling. This paper proposes round robin (RR) scheduling algorithm, named DevRR, with new dynamic time quantum (TQ) computed by the standard deviation and average burst time of each process in a queue. Performance of DevRR is compared to the standard RR, PRR, and BRR in term of decreasing of an average waiting time (AWT), an average turnaround time (ATT), and number of context switches (NCS). Results can reduce 22.97% of AWT, 22.13% of ATT, and 30.26% of NCS for 50-process data set.

PL

W artykule zaproponowano algorytm procesora z dynamicznym czasem kwantowym określanym jako odchyłka standardowa i średni czas impulsu każdego procesu w kolejkowaniu. Właściwości algorytmu porównano z innymi standardowymi metodami pod kątem oceny czasu oczekiwania.

Słowa kluczowe

EN

round robin algorithm; dynamic time quantum; average waiting time

PL

algorytm karuzelowy; procesor; harmonogram kolejkowania

• Wydawca: Wydawnictwo SIGMA-NOT
• Czasopismo: Przegląd Elektrotechniczny
• Rocznik: 2018
• Tom: R. 94, nr 4
• Strony: 26--29
• Opis fizyczny: Bibliogr. 14 poz., tab., wykr.

Twórcy

autor

Phorncharoen S.

• Department of Electrical Engineering, Faculty of Engineering, Mahasarakham University, Thailand

autor

Sa-Ngiamvibool W.

• Department of Electrical Engineering, Faculty of Engineering, Mahasarakham University, Thailand

Bibliografia

• [1] Chauhan N., Principles of Operating System, Oxford University Press. Oxford, chapter 6, 2014.
• [2] Anju M., Antony N., Nandakumarm, R., Dynamic Time Slice Round Robin Scheduling Algorithm with Unknown Burst Time, Indian Journal of Science and Technology, 9(8) (2016), 1-6.
• [3] Jeffay K., Smith F.D., Moorthy A., Anderson J., Proportional Share Scheduling of Operating System Services for Real-Time Applications, in Proceeding of the 19th IEEE Real-Time Systems Symposium, (1998), 25-32.
• [4] Ahad M.A., Modifying Round Robin Algorithm for Process Scheduling using Dynamic Quantum Precision, J. of Computer Applications on Issues and Challenges in Networking, Intelligence and Computing Technologies, 3(3) (2012), 5-10.
• [5] Mostafa S.M., Rida S.Z., Hamad S.H., Finding time quantum of round robin CPU scheduling algorithm in general computing systems using integer programming, Int. J. of Research and Reviews in Applied Sciences, 5(1) (2010), 64-71.
• [6] Behera H., Mohanty R., Nayak D., A New Proposed Dynamic Quantum with Re-adjusted Round Robin Scheduling Algorithm and Its Performance Analysis, Int. J. of Computer Applications, 5(5) (2010), 10-15.
• [7] Mohanty R., Design and Performance Evaluation of a New Proposed Shortest Remaining Burst in (SRBRR) Scheduling Algorithm, Int. J. of Computer Applications, 5(4) (2010), 10-15.
• [8] Matarneh R.J., Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Process, American J. of Applied Sciences, 6(10) (2009), 31-37.
• [9] Singh A., Goyal P., Batra S., An Optimized Round Robin Scheduling Algorithm for CPU Scheduling, Int. J. on Computer Science and Engineering, 2(7) (2010), 82-85.
• [10] Pradhan P., Behera, P.K., Ray B.N.B., Modified Round Robin Algorithm for Resource Allocation, Procedia Computer Science, 85(3) (2016), 878-890.
• [11] Abdulrahim A., Aliyu S., Mustapha A.M., Abdullahi, S.E., An Additional Improvement in Round Robin (AAIRR) CPU Scheduling Algorithm, Int. J. of Advanced Research in Computer Science and Software Engineering, 4(2) (2014), 1-8.
• [12] Jakub S., Maria S., Edyta Ł., Algorithm for selecting optimal clustering parameters used for over-segmentation reduction, Przegląd Elektrotechniczny, 92 (2016), nr 9, 250-256.
• [13] Wanchai K., Chiraphon T., Hybrid of Lamda and Bee Colony Optimization for Solving Economic Dispatch, Przegląd Elektrotechniczny, 92 (2016), nr 9, 220-223.
• [14] Gupta C., Maggo S., An efficient prediction model for software reusability for Java-based object-oriented systems, Int. J. of Computer Aided Engineering and Technology, 6(2) (2014), 182-199.

Uwagi

Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2018).