A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Comparing gang scheduling with dynamic space sharing on symmetric multiprocessors using automatic self-allocating threads (ASAT)
Proceedings 11th International Parallel Processing Symposium
This work considers the best way to handle a diverse mix of multi-threaded and single-threaded jobs running on a single Symmetric Parallel Processing system. The traditional approaches to this problem are free scheduling, gang scheduling, or space sharing. This paper examines a less common technique called dynamic space sharing. One approach to dynamic space sharing, Automatic Self Allocating Threads (ASAT), is compared to all of the traditional approaches to scheduling a mixed load of jobs.
doi:10.1109/ipps.1997.580911
dblp:conf/ipps/SeveranceE97
fatcat:oirgjp4iurhz5pfd5tikn5xqyi