A scheduling policy for preserving cache locality in a multiprogrammed system

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 324
  • Download : 0
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 affected. If frequent context switching replaces the data loaded into cache memory before they are completely reused, the programs suffer 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 beneficial impact on the overall system performance due to the enhanced processor utilization. (C) 2000 Published by Elsevier Science B.V. All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2000-11
Language
English
Article Type
Article
Keywords

PERFORMANCE

Citation

JOURNAL OF SYSTEMS ARCHITECTURE, v.46, no.13, pp.1191 - 1204

ISSN
1383-7621
DOI
10.1016/S1383-7621(00)00020-5
URI
http://hdl.handle.net/10203/67742
Appears in Collection
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0