Just in Time Load Balancing

作者: Rosario Cammarota , Alexandru Nicolau , Alexander V. Veidenbaum

DOI: 10.1007/978-3-642-37658-0_1

关键词: Loop level parallelismComputer scienceMemory hierarchyLoad balancing (computing)Distributed computingParallel computingIteration space

摘要: Leveraging Loop Level Parallelism (LLP) is one of the most attractive techniques for improving program performance on emerging multi-cores. Ordinary programs contain a large amount parallel and DOALL loops, however multi-core designs feature rapid increase in number on-chip cores ways such share resources - as pipeline memory hierarchy, leads to an possible high-performance configurations. This trend design makes attaining peak through exploitation LLP increasingly complex problem.

参考文章(26)
Bjarne Stroustrup, The C++ programming language (2nd ed.) Addison-Wesley Longman Publishing Co., Inc.. ,(1991)
Christine Deane, George Ho, Phil Mucci, Shirley Browne, PAPI: A Portable Interface to Hardware Performance Counters hpcmp users group conference. ,(1999)
G H Barnes, S F Lundstrom, A controllable MIMD architecture Advanced computer architecture. pp. 30- 38 ,(1986)
Steven Lucco, A Dynamic Scheduling Technique for Irregular Parallel Programs. programming language design and implementation. pp. 200- 211 ,(1992)
Leslie Lamport, The hyperplane method for an array computer Parallel Processing. pp. 113- 131 ,(1975) , 10.1007/3-540-07135-0_114
Vishal Aslot, Max Domeika, Rudolf Eigenmann, Greg Gaertner, Wesley B. Jones, Bodo Parady, SPEComp: A New Benchmark Suite for Measuring Parallel Computer Performance international workshop on openmp. pp. 1- 10 ,(2001) , 10.1007/3-540-44587-0_1
K.K. Yue, D.J. Lilja, Parameter estimation for a generalized parallel loop scheduling algorithm hawaii international conference on system sciences. ,vol. 2, pp. 187- 188 ,(1995) , 10.1109/HICSS.1995.375462
J. Mark Bull, Darragh O'Neill, A microbenchmark suite for OpenMP 2.0 ACM SIGARCH Computer Architecture News. ,vol. 29, pp. 41- 48 ,(2001) , 10.1145/563647.563656
John Aycock, A brief history of just-in-time ACM Computing Surveys. ,vol. 35, pp. 97- 113 ,(2003) , 10.1145/857076.857077