Parallel depth first vs. work stealing schedulers on CMP architectures
Vasileios Liaskovitis(Carnegie Mellon University), Chris Wilkerson(Intel (United States)), Guy E. Blelloch(Carnegie Mellon University), Limor Fix(Intel (United States)), Babak Falsafi(École Polytechnique Fédérale de Lausanne), Michael A. Kozuch(Intel (United States)), Todd C. Mowry(Carnegie Mellon University), Nikos Hardavellas(Carnegie Mellon University), Phillip B. Gibbons(Intel (United States)), Shimin Chen(Intel (United States)), Anastassia Ailamaki(Carnegie Mellon University)
Cited by 5
Related Papers
GraphChi: large-scale graph computation on just a PC
|Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)|2012|904
Design and evaluation of a compiler algorithm for prefetching
|Unknown|1992|769
Ambit
|Unknown|2017|433
Compiler-based prefetching for recursive data structures
|Unknown|1996|399
A scalable approach to thread-level speculation
|Unknown|2000|388