Issue No. 11 - November (1999 vol. 48)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.811109
<p><b>Abstract</b>—Processor scheduling policies for multiprocessor systems can be broadly divided into <it>space-sharing</it> and <it>time-sharing</it> policies. Space-sharing policies divide the system processors into a number of partitions and each partition is exclusively allocated to a single job. In time-sharing policies, processors are temporally shared by jobs. Several space-sharing and time-sharing policies have been proposed for small-scale shared-memory systems and require a central run queue and/or central scheduler. The central queue/scheduler poses serious scalability problems for large-scale multiprocessor systems. Furthermore, space-sharing and time-sharing policies have their advantages and disadvantages. In this paper, we propose a new multiprocessor scheduling policy that eliminates contention for the central queue/scheduler. Our hierarchical scheduling policy (HSP) is a self-scheduling policy and uses a hierarchical run queue organization to facilitate processor allocation to jobs. We show that the HSP policy is considerably better than purely space-sharing and purely time-sharing policies over a wide range of system and workload parameters of interest.</p>
Hierarchical scheduling, multiprocessor systems, performance evaluation, processor scheduling, space-sharing, time-sharing.
S. P. Dandamudi and S. Ayachi, "Performance of Hierarchical Processor Scheduling in Shared-Memory Multiprocessor Systems," in IEEE Transactions on Computers, vol. 48, no. , pp. 1202-1213, 1999.