Thread scheduling for cache locality

J. Philbin, J. Edler, O. J. Anshus, C. C. Douglas, K. Li

Research output: Contribution to journalConference article

15 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
JournalComputer architecture news
Volume24
Issue numberSpecial Issu
DOIs
StatePublished - 1996
Externally publishedYes
EventProceedings of the 1996 7th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS-VII - Cambridge, MA, USA
Duration: Oct 1 1996Oct 5 1996

All Science Journal Classification (ASJC) codes

  • Engineering(all)

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. Computer architecture news, 24(Special Issu), 60-71. https://doi.org/10.1145/237090.237151