Benefits of cache-affinity scheduling in shared-memory multiprocessors: A summary

Josep Torrellas, Andrew Tucker, Anoop Gupta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

An interesting and common class of workloads for shared-memory multiprocessors is multiprogrammed workloads. Because these workloads generally contain more processes than there are processors in the machine, there are two factors that increase the number of cache misses. First, several processes are forced to time-share the same cache, resulting in one process displacing the cache state previously built up by a second one. Consequently, when the second process runs again, it generates a stream of misses as it rebuilds ita cache state. Second since an idle processor simply selects the highest priority runnable process, a given process often moves from one CPU to another. This frequent migration results in the process having to continuously reload its state into new caches, producing streams of cache misses. To reduce the number of misses in these workloads, processes should reuse their cached state more. One way to encourage this is to schedule each process based on its affinity to individual caches, that is, based on the amount of state that the process has accumulated in an individual cache. This technique is called i cache affinity scheduling.

Original languageEnglish (US)
Title of host publicationProceedings of the 1993 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 1993
PublisherAssociation for Computing Machinery, Inc
Pages272-274
Number of pages3
ISBN (Electronic)0897915801, 9780897915809
DOIs
StatePublished - Jun 1 1993
Externally publishedYes
Event1993 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 1993 - Santa Clara, United States
Duration: May 10 1993May 14 1993

Publication series

NameProceedings of the 1993 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 1993

Other

Other1993 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 1993
CountryUnited States
CitySanta Clara
Period5/10/935/14/93

    Fingerprint

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

Torrellas, J., Tucker, A., & Gupta, A. (1993). Benefits of cache-affinity scheduling in shared-memory multiprocessors: A summary. In Proceedings of the 1993 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 1993 (pp. 272-274). (Proceedings of the 1993 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 1993). Association for Computing Machinery, Inc. https://doi.org/10.1145/166955.167038