Speaker: Kai Li, Princeton University
Thread Scheduling for Cache LocalityDate: September 13, 1996
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.
This is joint work to be published in ASPLOS'96 with James Philbin, Jan Edler: NEC Research Institute, Otto J. Anshus: University of Tromso, Craig C. Douglas: IBM T.J. Watson Research Center