ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

A-MMLQ Algorithm for Multi-level Queue Scheduling

Journal: COMPUSOFT 'An International Journal of Advanced Computer Technology' (Vol.2, No. 7)

Publication Date:

Authors : ;

Page : 221-227

Keywords : Multiprocessor scheduling; Multi-Level Queue Scheduling; FCFS; A-MMLQ; GridSim;

Source : Downloadexternal Find it from : Google Scholarexternal


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 wellknown multi-level queue scheduling, taking into account the arrival time/ arrival sequence to conceptualize an innovative scheduling algorithm.

Last modified: 2013-08-11 20:53:33