Abstract
A multiprogrammed (or partitionable) parallel computer system can be partitioned into subsystems which are allocated to independent jobs. The performance of such a parallel processing system is deter-mined by the system partitioning strategy and the job scheduling policy adopted. In this paper, we consider the impact of a job scheduling algorithm on the system performance, mainly the average job response time. A refined First-Come-First-Serve (FCFS) queueing discipline called FCFS/SJE is studied, which, when there are not enough processors available for large jobs in the front of a waiting queue, schedules small jobs behind these large jobs earlier. We develop a multi-server queueing system for modelling multiprogrammed parallel processing systems. A system is specified by the number of processors and jobs are characterized by a probability distribution of the number of processors requested, a Poisson arrival process, and an exponential distribution of execution time. Our analysis as well as simulation indicate that FCFS/SJE results in a noticeable improvement on system performance compared with FCFS.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
