Processor time-sharing is the most common way to increase the overall system utilization for shared-memory multiprocessor systems. However, the performance of individual applications might be sacrificed due to the high overhead of context switching, due to the processing power wasted by busy-waiting synchronization and locking operations, and due to poor cache memory utilization. In this paper, we propose a simple and effective processor allocation scheme, called Loop-Level Process Control (LLPC), for multiprogrammed multiprocessors. At the beginning of each parallel section of each application program, LLPC uses the current system load to determine an upper limit on the number of processes the application can create for that parallel section. Preliminary simulation results using the Perfect Club Fortran benchmarks show that this loop-level process control scheme can produce a high system utilization while maintaining high performance for the individual applications. Another advantage of this strategy is that it is transparent to the programmer and does not require any modifications to the operating system. Consequently, the application can remain portable and compatible.
|Original language||English (US)|
|Title of host publication||Job Scheduling Strategies for Parallel Processing - IPPS 1995 Workshop, Proceedings|
|Editors||Dror G. Feitelson, Larry Rudolph|
|Number of pages||18|
|ISBN (Print)||3540601538, 9783540601531|
|State||Published - 1995|
|Event||Workshop on Job Scheduling Strategies for Parallel Processing held as a prelude to the IPPS 1995 Conference - Santa Barbara, United States|
Duration: Apr 25 1995 → Apr 25 1995
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||Workshop on Job Scheduling Strategies for Parallel Processing held as a prelude to the IPPS 1995 Conference|
|Period||4/25/95 → 4/25/95|
Bibliographical notePublisher Copyright:
© 1995, Springer Verlag. All rights reserved.