๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A scheduling policy for preserving cache locality in a multiprogrammed system

โœ Scribed by Inbum Jung; Jongwoong Hyun; Joonwon Lee


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
520 KB
Volume
46
Category
Article
ISSN
1383-7621

No coin nor oath required. For personal study only.

โœฆ Synopsis


In a multiprogrammed system, when the operating system switches contexts, in addition to the cost for handling the processes being swapped out and in, the cache performance of processors also can be aected. If frequent context switching replaces the data loaded into cache memory before they are completely reused, the programs suer from cache misses due to the damage in cache locality. In particular, for the programs with good cache locality, such as blocked programs, a scheduling mechanism of keeping cache locality against context switching is essential to achieve good processor utilization. To solve this requirement, we propose a preemption-safe policy to exploit the cache locality of blocked programs in a multiprogrammed system. The proposed policy delays context switching until a block is fully reused, but also compensates for the monopolized processor time on processor scheduling mechanisms. Our simulation results show that in a situation, where blocked programs are run on multiprogrammed shared-memory multiprocessors, the proposed policy improves the performance of these programs due to a decrease in cache misses. In such situations, it also has a beneยฎcial impact on the overall system performance due to the enhanced processor utilization.


๐Ÿ“œ SIMILAR VOLUMES