Abstract
Scheduling in computer science means determining which tasks run when there are multiple runnable tasks. Several CPU scheduling algorithms have different features, and no single one is ideal absolutely for every application. This paper presents an attempt to apply fuzzy logic in the design and implementation of a rule-based scheduling algorithm to solve the shortcoming of well-known scheduling algorithms. Results given in this paper demonstrate that the average waiting time and the average turnaround time in the proposed algorithm are better than that obtained using priority scheduling, and closed to that obtained from shortest-job-first (SJF) scheduling. The new proposed algorithm is a dynamic scheduling algorithm which deals with both task priority and its execution time, while the SJF algorithm doesn’t.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Weglarz, J.: Scheduling Computer and Manufacturing Processes. Springer, Berlin (2001)
Stallings, W.: Operating Systems Internals and Design Principles, 5th edn. Prentice-Hall, Englewood Cliffs (2004)
Swin, B.R., Tayli, M., Benmaiza, M.: Prospects for Predictable Dynamic Scheduling in RTDOS. Journal King Saud University, Computer & Information Science 9, 57–93 (1997)
Shahzad, B., Afzal, M.T.: Optimized Solution to Shortest Job First by Eliminating the Starvation. In: The 6th Jordanian Inr. Electrical and Electronics Eng. Conference (JIEEEC 2006), Jordan (2006)
Ozelkan, E.C., Duckestine, L.: Optimal Fuzzy Counterparts of Scheduling Rules. European Journal of Operational Research (113), 593–609 (1999)
McCahon, C.S., Lee, E.S.: Job Sequencing with Fuzzy Processing Times. Computers & Mathematics with Applications (19), 31–41 (1990)
Asano, M., Ohta, H.: Signal Machine Scheduling Using Dominance Relation to Minimize Earliness Subject to Ready and Due Times. International Journal of Production Economics (44), 35–43 (1996)
Hapke, M., Slowinski, R.: Fuzzy Priority Heuristics for Project Scheduling. Fuzzy Sets and Systems (83), 291–299 (1996)
Sakawa, M., Kubota, R.: Fuzzy Programming for Multi-objective Job Shop Scheduling with Fuzzy Processing and Fuzzy Due Date Through Genetic Algorithms. European Journal of Operational Research (120), 393–407 (2000)
Yen, J., Langari, R.: Fuzzy Logic; Intelligence, Control, and Information. Prentice Hall, Englewood Cliffs (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kadhim, S.J., Al-Aubidy, K.M. (2010). Design and Evaluation of a Fuzzy-Based CPU Scheduling Algorithm. In: Das, V.V., et al. Information Processing and Management. BAIP 2010. Communications in Computer and Information Science, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12214-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-12214-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12213-2
Online ISBN: 978-3-642-12214-9
eBook Packages: Computer ScienceComputer Science (R0)