CPU scheduling with a round Robin algorithm based on an effective time slice

The round robin algorithm is regarded as one of the most efficient and effective CPU scheduling techniques in computing. It centres on the processing time required for a CPU to execute available jobs. Although there are other CPU scheduling algorithms based on processing time which use different c...

Full description

Bibliographic Details
Main Authors:	Tajwar, Mohammad M., Pathan, Md. Nuruddin, Hussaini, Latifa, Abubakar, Adamu
Format:	Article
Language:	English English
Published:	Korea Information Processing Society (KIPS) 2017
Subjects:	Q350 Information theory
Online Access:	http://irep.iium.edu.my/58310/ http://irep.iium.edu.my/58310/ http://irep.iium.edu.my/58310/ http://irep.iium.edu.my/58310/1/JIPS_486.pdf http://irep.iium.edu.my/58310/7/58310_CPU%20scheduling%20with%20a%20round%20Robin%20algorithm%20based%20on%20an%20effective%20time%20slice_SCOPUS.pdf

id	iium-58310
recordtype	eprints
spelling	iium-583102018-04-17T05:46:00Z http://irep.iium.edu.my/58310/ CPU scheduling with a round Robin algorithm based on an effective time slice Tajwar, Mohammad M. Pathan, Md. Nuruddin Hussaini, Latifa Abubakar, Adamu Q350 Information theory The round robin algorithm is regarded as one of the most efficient and effective CPU scheduling techniques in computing. It centres on the processing time required for a CPU to execute available jobs. Although there are other CPU scheduling algorithms based on processing time which use different criteria, the round robin algorithm has gained much popularity due to its optimal time-shared environment. The effectiveness of this algorithm depends strongly on the choice of time quantum. This paper presents a new effective round robin CPU scheduling algorithm. The effectiveness here lies in the fact that the proposed algorithm depends on a dynamically allocated time quantum in each round. Its performance is compared with both traditional and enhanced round robin algorithms, and the findings demonstrate an improved performance in terms of average waiting time, average turnaround time and context switching. Korea Information Processing Society (KIPS) 2017-08 Article PeerReviewed application/pdf en http://irep.iium.edu.my/58310/1/JIPS_486.pdf application/pdf en http://irep.iium.edu.my/58310/7/58310_CPU%20scheduling%20with%20a%20round%20Robin%20algorithm%20based%20on%20an%20effective%20time%20slice_SCOPUS.pdf Tajwar, Mohammad M. and Pathan, Md. Nuruddin and Hussaini, Latifa and Abubakar, Adamu (2017) CPU scheduling with a round Robin algorithm based on an effective time slice. Journal of Information Processing Systems, 13 (4). pp. 941-950. ISSN 1976-913X E-ISSN 2092-805X http://jips-k.org/q.jips?cp=pp&pn=486 10.3745/JIPS.01.0018
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	English English
topic	Q350 Information theory
spellingShingle	Q350 Information theory Tajwar, Mohammad M. Pathan, Md. Nuruddin Hussaini, Latifa Abubakar, Adamu CPU scheduling with a round Robin algorithm based on an effective time slice
description	The round robin algorithm is regarded as one of the most efficient and effective CPU scheduling techniques in computing. It centres on the processing time required for a CPU to execute available jobs. Although there are other CPU scheduling algorithms based on processing time which use different criteria, the round robin algorithm has gained much popularity due to its optimal time-shared environment. The effectiveness of this algorithm depends strongly on the choice of time quantum. This paper presents a new effective round robin CPU scheduling algorithm. The effectiveness here lies in the fact that the proposed algorithm depends on a dynamically allocated time quantum in each round. Its performance is compared with both traditional and enhanced round robin algorithms, and the findings demonstrate an improved performance in terms of average waiting time, average turnaround time and context switching.
format	Article
author	Tajwar, Mohammad M. Pathan, Md. Nuruddin Hussaini, Latifa Abubakar, Adamu
author_facet	Tajwar, Mohammad M. Pathan, Md. Nuruddin Hussaini, Latifa Abubakar, Adamu
author_sort	Tajwar, Mohammad M.
title	CPU scheduling with a round Robin algorithm based on an effective time slice
title_short	CPU scheduling with a round Robin algorithm based on an effective time slice
title_full	CPU scheduling with a round Robin algorithm based on an effective time slice
title_fullStr	CPU scheduling with a round Robin algorithm based on an effective time slice
title_full_unstemmed	CPU scheduling with a round Robin algorithm based on an effective time slice
title_sort	cpu scheduling with a round robin algorithm based on an effective time slice
publisher	Korea Information Processing Society (KIPS)
publishDate	2017
url	http://irep.iium.edu.my/58310/ http://irep.iium.edu.my/58310/ http://irep.iium.edu.my/58310/ http://irep.iium.edu.my/58310/1/JIPS_486.pdf http://irep.iium.edu.my/58310/7/58310_CPU%20scheduling%20with%20a%20round%20Robin%20algorithm%20based%20on%20an%20effective%20time%20slice_SCOPUS.pdf
first_indexed	2023-09-18T21:22:26Z
last_indexed	2023-09-18T21:22:26Z
_version_	1777411971150249984

CPU scheduling with a round Robin algorithm based on an effective time slice

Similar Items