Thread scheduling for cache locality

James Philbin, Jan Edler, Otto J. Anshus, Craig C. Douglas, Kai Li

Research output: Contribution to journalArticle

21 Scopus citations

Abstract

This paper describes a method to improve the cache locality of sequential programs by scheduling fine-grained threads. The algorithm relies upon hints provided at the time of thread creation to determine a thread execution order likely to reduce cache misses. This technique may be particularly valuable when compiler-directed tiling is not feasible. Experiments with several application programs, on two systems with different cache structures, show that our thread scheduling method can improve program performance by reducing second-level cache misses.

Original languageEnglish (US)
Pages (from-to)60-71
Number of pages12
JournalOperating Systems Review (ACM)
Volume30
Issue number5
DOIs
StatePublished - Dec 1996

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Thread scheduling for cache locality'. Together they form a unique fingerprint.

  • Cite this

    Philbin, J., Edler, J., Anshus, O. J., Douglas, C. C., & Li, K. (1996). Thread scheduling for cache locality. Operating Systems Review (ACM), 30(5), 60-71. https://doi.org/10.1145/248208.237151