A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Locality-information-based scheduling in shared-memory multiprocessors
[chapter]
1996
Lecture Notes in Computer Science
Lightweight threads have become a common abstraction in the field of programming languages and operating systems. This paper examines the performance implications of locality information usage in thread scheduling algorithms for scalable shared-memory multiprocessors. The elements of a distributed scheduler using all available locality information as well as experimental measurements are presented. Most shared-memory multiprocessors use multiple stages of caches to hide latency. Data structures
doi:10.1007/bfb0022298
fatcat:a2tqyztdcjapzmupo4sbvnq77e