Thread scheduling for cache locality

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

Research output: Contribution to journalArticle

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
JournalSIGPLAN Notices (ACM Special Interest Group on Programming Languages)
Volume31
Issue number9
DOIs
StatePublished - Sep 1996

    Fingerprint

ASJC Scopus subject areas

  • Software
  • Computer Graphics and Computer-Aided Design

Cite this