A comparison of task pools for dynamic load balancing of irregular algorithms

Concurrency and Computation: Practice and Experience

Volumn 16, Issue 1, 2004, Pages 1-47

  Korch, Matthias ^a   Rauber, Thomas ^a  

^a UNIVERSITY OF BAYREUTH   (Germany)

Author keywords

Dynamic task scheduling; Hierarchical radiosity; Irregular algorithms; Performance evaluation; Task pools; Threads; Volume rendering

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GRAMMARS; DATA STRUCTURES; JAVA PROGRAMMING LANGUAGE; PARALLEL PROCESSING SYSTEMS; PERFORMANCE; RESPONSE TIME (COMPUTER SYSTEMS); STORAGE ALLOCATION (COMPUTER);

DYNAMIC LOAD BALANCING; DYNAMIC TASK SCHEDULING; HIERARCHICAL RADIOSITY; IRREGULAR ALGORITHMS; PERFORMANCE EVALUATION; TASK BASED ALGORITHMS; TASK POOLS; THREADS; VOLUME RENDERING;

PARALLEL ALGORITHMS;

EID: 0347656830     PISSN: 15320626     EISSN: None     Source Type: Journal    
DOI: 10.1002/cpe.745     Document Type: Article

References (48)

1. Singh JP, Holt C, Tosuka T, Gupta A, Hennessy JL. Load balancing and data locality in adaptive hierarchical n-body methods: Barnes-Hut, fast multipole, and radiosity. Journal of Parallel and Distributed Computing 1995; 27(2): 118-141.
2. Brucker P. Scheduling Algorithms (3rd edn). Springer: Berlin, 2001.
3. Woo SC, Ohara M, Torrie E, Singh JP, Gupta A. The SPLASH-2 programs: Characterization and methodological considerations. Proceedings of the 22nd International Symposium on Computer Architecture, Santa Margherita Ligure, Italy, 1995. ACM Press: New York, 1995; 24-36.
4. Turing AM, Furbank PN, Ince D, Saunders PT, Britton JL, Gandy R, Yates CEM. Collected Works of A. M. Turing. North-Holland: Amsterdam, 1992, 2001.
5. Hanrahan P, Salzman D, Aupperle L. A rapid hierarchical radiosity algorithm. Proceedings of SIGGRAPH, 1991.
6. Tongsima S, Chantrapornchai C, Sha EH-M, Passos N. Probabilistic rotation: Scheduling graphs with uncertain execution time. Proceedings International Conference on Parallel Processing, 1997. IEEE Computer Society Press: Washington, DC, 1997; 292-297.
7. Chantrapornchai C, Tongsima S, Sha EH-M. Imprecise task schedule optimization. Proceedings International Conference on Fuzzy Systems, 1997. IEEE Computer Society Press: Washington, DC, 1997.
8. Korch M. Einsatz von Taskpools in Pthreads und Java zur parallelen Implementierung irregulärer Algorithmen. Diplomarbeit, Martin-Luther-Universität Halle-Wittenberg, 2001.
9. Butenhof DR. Programming with POSIX Threads. Addison Wesley: Reading, MA, 1997.
10. Oaks S, Wong H. Java Threads (2nd edn). O'Reilly: New York, 1999.
11. Michael MM, Scott NL. Nonblocking algorithms and preemption-safe locking on multiprogrammed shared - memory multiprocessors. Journal of Parallel and Distributed Computing 1998; 51(1):1-26.
12. Valois JD. Lock-free linked lists using compare-and-swap. Symposium on Principles of Distributed Computing, 1995. ACM Press: New York, 1995; 214-222.
13. Herlihy M. A methodology for implementing highly concurrent data objects. ACM Transactions on Programming Languages and Systems 1993; 15(5):745-770.
14. Prakash S, Lee Y-H, Johnson T. Non-blocking algorithms for concurrent data structures. Technical Report 91-002, Department of Computer and Information Sciences, University of Florida, 1991.
15. Eggers SJ, Katz RH. The effects of sharing on the cache and bus performance of parallel programs. Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS III), 1989; 257-270.
16. Torrellas J, Lam MS, Hennessy JL. False sharing and spatial locality in multiprocessor caches. IEEE Transactions on Computers 1994; 43(6):651-663.
17. http://ai2.inf.uni-bayreuth.de/projects/taskpools/.
18. Berrendorf R, Ziegler H. PCL - The performance counter library: A common interface to access hardware performance counters on microprocessors. Internal Report FZJ-ZAM-IB-9816, Forschungszentrum Jülich, 1998.
19. Podehl A, Rauber T, Rünger G. A shared-memory implementation of the hierarchical radiosity method. Theoretical Computer Science 1998; 196(1-2):215-240.
20. Korch M, Rauber T. Evaluation of task pools for the implementation of parallel irregular algorithms. Proceedings 2002 ICPP Workshop on Compile/Run Time Techniques for Parallel Computing (CRTPC), Vancouver, 2002. IEEE Computer Society Press: Los Alamitos, CA, 2002; 597-604.
21. Nieh J, Levoy M. Volume rendering on scalable shared-memory MIMD architectures. Proceedings of the Boston Workshop on Volume Visualization. ACM Press: New York, 1992; 17-24.
22. Levoy M. Display of surfaces from volume data. IEEE Computer Graphics & Applications 1988; 8(3):29-37.
23. Levoy M. Efficient ray tracing of volume data. ACM Transactions on Graphics 1990; 9(3):245-251.
24. Levoy M. Volume rendering by adaptive refinement. The Visual Computer 1990; 6(1):2-7.
25. Matsumoto M, Nishimura T. Mersenne Twister: A 623-dimensional equidistributed uniform pseudorandom number generator. ACM Transactions on Modeling and Computer Simulations (Special Issue on Uniform Random Number Generation) 1998; 8(1):3-30.
26. Kwok Y-K, Ahmad I. Benchmarking and comparison of the task graph scheduling algorithms. Journal of Parallel and Distributed Computing 1999; 59(3):381-422.
27. Cosnard M, Jeannot E, Yang T. SLC: Symbolic scheduling for executing parameterized task graphs on multiprocessors. International Conference on Parallel Processing, 1999.
28. Gerasoulis A, Jiao J, Yang T. Experience with graph scheduling for mapping irregular scientific computation. Proceedings of the First IPPS Workshop on Solving Irregular Problems on Distributed Memory Machines, 1995.
29. Yang T, Gerasoulis A. PYRROS: Static task scheduling and code generation for message passing multiprocessors. Proceedings of the 6th ACM International Conference on Supercomputing, Washington, DC, 1992. ACM Press: New York, 1992; 428-437.
30. Johnson T, Davis TA, Hadfield SM. A concurrent dynamic task graph. Parallel Computing 1996; 22(2):327-333.
31. Wu M-Y. Parallel incremental scheduling. Parallel Processing Letters 1995; 5(4):659-670.
32. Rauchwerger L. Run-time parallelization: It's time has come. Journal of Parallel Computing (Special Issue on Languages and Compilers for Parallel Computers) 1998; 24(3/4):527-556.
33. Hwang Y-S, Moon B, Sharma SD, Ponnusamy R, Das R, Saltz JH. Runtime and language support for compiling adaptive irregular programs on distributed memory machines. Software - Practice and Experience 1995; 25(6):597-621.
34. Hummel S, Schonberg E, Flynn L. Factoring: A method for scheduling parallel loops. Communications of the ACM 1992; 35(8):90-101.
35. Banicescu I, Hummel SF. Balancing processor loads and exploiting data locality in n-body simulations. Proceedings Supercomputing '95 Conference, 1995. ACM Press/IEEE Computer Society Press: New York/Silver Spring, MD, 1995.
36. Banicescu I. Load balancing and data locality in the parallelization of the fast multipole algorithm. PhD Thesis, Polytechnic University, 1996.
37. Carino RL, Banicescu I. Dynamic scheduling of parallel loops with variable iterate execution times. Proceedings IPDPS-Workshop on Parallel and Distributed Scientific and Engineering Computing with Applications, 2002. IEEE: Washington, DC, 2002.
38. Kumar V, Grama AY, Vempaty NR. Scalable load balancing techniques for parallel computers. Journal of Parallel and Distributed Computing 1994; 22(1):60-79.
39. Tucker A. Efficient scheduling on multiprogrammed shared-memory multiprocessors. PhD Thesis, Stanford University, 1993.
40. Durand D, Montaut T, Kervella L, Jalby W. Impact of memory contention on dynamic scheduling on NUMA multiprocessors. IEEE Transactions on Parallel and Distributed Systems 1996; 7(11):1201-1214.
41. Schloegel K, Karypis G, Kumar V. A unified algorithm for load-balancing adaptive scientific simulations. Proceedings Supercomputing 2000, 2000. IEEE/ACM SIGARCH: Dallas, TX, 2000.
42. Watts J, Taylor S. A practical approach to dynamic load balancing. IEEE Transactions on Parallel and Distributed Systems 1998; 9(3):235-248.
43. Dandamudi SP, Ayachi S. Performance of hierarchical processor scheduling in shared-memory multiprocessor systems. IEEE Transactions on Computers 1999; 48(11):1202-1213.
44. Rudolph L, Slivkin-Allalouf M, Upfal E. A simple load balancing scheme for task allocation in parallel machines. ACM Symposium on Parallel Algorithms and Architectures, 1991; 237-245.
45. Podehl A, Rauber T, Rünger G. Scalability and granularity issues of the hierarchical radiosity method. Proceedings of the Euro-Par '96, vol. 1. Springer: Berlin, 1996; 789-798.
46. Wen C. A distributed task queue for load balancing on the CM5. (Draft).
47. Thomé V, Vianna D, Costa R, Plastino A, da Silveira Filho O. Exploring load balancing in a scientific SPMD application. Proceedings 2002 ICPP-Workshop on High Performance Scientific and Engineering Computing with Applications (HPSECA), Vancouver, 2002. IEEE Computer Society Press: Los Alamitos, CA, 2002; 419-426.
48. Hippold J, Rünger G. Task pool teams for implementing irregular algorithms on clusters of SMPs. Technical Report SFB393/02-18, Chemnitz University of Technology, 2002.