A-MMLQ Algorithm for Multi-level Queue Scheduling
Keywords:
Multiprocessor scheduling, Multi-Level Queue Scheduling, A-MMLQ, FCFS, GridsimAbstract
This being the era of advancement in computing domain, the emphasis is on better resource scheduling. Scheduling is not confined to dealing multiple tasks by a single processor. It’s a dawn with multiprocessing and multitasking. Although multiprocessor systems impose several overheads but still make the concept amazingly interesting. The scheduling field has taken a whirlwind after the notion of multiprocessing. Many of the uniprocessor algorithms do fit well under the multiprocessor systems but, still necessitating a further development aiming solely on multiprocessor scheduling. This paper thus sketches a new idea to modify and extend the well-known multi-level queue scheduling, taking into account the arrival time/ arrival sequence to conceptualize an innovative scheduling algorithm.
References
A. Burns & A. Wellings. “Real-Time Systems and Programming Languages”. Addison Wesley Longmain, April 2009.
Silberschatz ,Galvin and Gagne, “Operating systems concepts”, 8th edition, Wiley, 2009.
C. L. Liu & J. W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment”, Journal of the ACM, Vol. 20. No. 1, pp. 46-61.
W. Li, “Group-EDF- A New Approach and an Efficient Non-Preemptive Algorithm for Soft Real-Time Systems”, 2006.
L. Yang, J. M. Schopf & I. Foster, “Conservative Scheduling: Using predictive variance to improve scheduling decisions in Dynamic Environments”, SuperComputing2003, Phoenix, AZ, USA, November 15-21, 2003.
D. Lifka, “The ANL/IBM SP scheduling system”, JSSPP, 1995.
A. W. Mu'alem and D. G. Feitelson, “Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling”, IEEE TPDS, 12(6):529.543, 2001.
D. Feitelson, L. Rudolph, & U. Schwiegelshohn, Parallel job scheduling - a status report, June 2004.
D. Lifka, “The ANL/IBMSP scheduling system”, Job Scheduling Strategies for Parallel Processing, pp. 295-303, Springer-Verlag, Lect. Notes Comput. Sci. Vol. 949, 1995.
R. Buyya & M. Murshed, “GridSim: A toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing”, The Journal of Concurrency and Computation: Practice and Experience (CCPE), 14:1175-1220, 2002.
S. Baruah, “Dynamic- and static-priority scheduling of recurring real-time tasks”, Real-Time Systems: The International Journal of Time-Critical Computing, 24(1):99–128, 2003.
A.S. Tanebaun, “Modern Operating Systems”, 3rd Edition, Prentice Hall, ISBN: 13:9780136006633, pp: 1104. 2008.
Dalibor Klusacek, Event-based Optimization of Schedules for Grid Jobs, Doctor of Philosophy at the Faculty of Informatics, Masaryk University, Brno, Czech Republic, 2011.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2013 COMPUSOFT: An International Journal of Advanced Computer Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
©2023. COMPUSOFT: AN INTERNATIONAL OF ADVANCED COMPUTER TECHNOLOGY by COMPUSOFT PUBLICATION is licensed under a Creative Commons Attribution 4.0 International License. Based on a work at COMPUSOFT: AN INTERNATIONAL OF ADVANCED COMPUTER TECHNOLOGY. Permissions beyond the scope of this license may be available at Creative Commons Attribution 4.0 International Public License.
