Manuscript Number : CSEIT172531
A Comparative Study of Single-Queue Multiprocessor Scheduling (SQMS) and Multiple-Queue Multiprocessor Scheduling (MQMS) Based on Stochastic Modeling
Authors(2) :-Shweta Jain, Saurabh Jain Multiprocessor systems have multiple processors which are basically challenging for managing resources and processor time. There is no system which can be completely deterministic whether the system has enough capacity to handle all requests and loads within the requisite time. Multiprocessor system scheduling are having two types of queue based scheduling: Single-Queue Multiprocessor Scheduling (SQMS) and Multiple Queue Multiprocessor Scheduling (MQMS). This paper analyzes both these multiprocessor scheduling schemes and their transition behaviour of processes over queues for balancing the load of a system. We have also applied stochastic modeling for simulation study and compared their performance.
Shweta Jain Multiprocessor systems, MQMS, Markov Chain model, Process migration, SQMS, Scheduling, Stochastic process, Transition Probability Matrix, Affinity. Publication Details Published in : Volume 2 | Issue 5 | September-October 2017 Article Preview
Research Scholar, Faculty of Computer Science, Pacific Academy of Higher Education and Research University, Udaipur,Rajasthan, India
Saurabh Jain
Professor, Shri Vaishnav Institute of Computer Applications, Shri Vaishnav Vidyapeeth Vishwavidyalaya, Indore, Madhya Pradesh, India
Date of Publication : 2017-10-31
License: This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 361-369
Manuscript Number : CSEIT172531
Publisher : Technoscience Academy