Simulated Performance Analysis of Multiprocessor Dynamic Space-Sharing Scheduling policy
Amit Chhabra, Gurvinder Singh, Gaurav Kumar · 2009
Multiprocessor systems are the wave of the future rightly said because they offer tremendous potential to solve inherently parallel and complex computation intensive applications. In order to exploit the full potential of such computing systems, job scheduling or processor allocation (both are considered synonyms here) decisions plays a great role. Such scheduling decisions involves determining number of jobs to execute simultaneously as well as the number of processors to be allocated to each running application in a manner so as to minimize job’s execution time and/or maximizing throughput. The growth of such multiprocessor systems has in turn paves the way for creation of efficient processor allocation policies in order to reduce job response time and make efficient utilization of system’s processors. When we submit jobs or applications to multiprocessor system which in turn relies on job scheduling policies to allocate processors to such incoming jobs, we are really interested to know how well such policies are performing. Performance evaluation methodologies like actual experimental setup i.e. multiprocessor or parallel system, Theoretical/Analytical modelling and Simulation can be used to evaluate the performance of scheduling policies. Actual experimentation on multiprocessor or parallel system is still a costly and complex approach and moreover these systems are still out of reach to young researchers even doing research in higher education institutes like universities or technical colleges