Chronically Evaluated Highest Instantaneous Priority Next: A Novel Algorithm for Processor Scheduling

Journals Menu

Follow SCIRP

ISSN Print: 2327-5219
ISSN Online: 2327-5227
www.scirp.org/journal/jcc
E-mail: jcc@scirp.org

"Chronically Evaluated Highest Instantaneous Priority Next: A Novel Algorithm for Processor Scheduling"
written by Amit Pandey, Pawan Singh, Nirayo H. Gebreegziabher, Abdella Kemal,
published by Journal of Computer and Communications, Vol.4 No.4, 2016

has been cited by the following article(s):

[1]	Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique
	2020

[2]	An adjustable variant of round robin algorithm based on clustering technique
	2020

[3]	An Efficient Parallel Implementation of CPU Scheduling Algorithms Using Data Parallel Algorithms
	2019

[4]	An Improved Priority Scheduling Algorithm Using Time Slice to Minimize Response Time
	2018

[1]	An Adjustable Variant of Round Robin Algorithm Based on Clustering Technique Computers, Materials & Continua, 2021 DOI:10.32604/cmc.2021.014675

[2]	Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique Applied Sciences, 2020 DOI:10.3390/app10155134

[3]	International Conference on Advanced Computing Networking and Informatics Advances in Intelligent Systems and Computing, 2019 DOI:10.1007/978-981-13-2673-8_45

Follow SCIRP

Free SCIRP Newsletters

Add your e-mail address to receive free newsletters from SCIRP.

Top