Performance evaluation of task pools based on hardware synchronization

IEEE/ACM SC2004 Conference, Proceedings

Volumn , Issue , 2004, Pages 683-695

  Hoffmann, Ralf ^a   Korch, Matthias ^a   Rauber, Thomas ^a  

^a UNIVERSITY OF BAYREUTH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS; DATA STRUCTURES; PERFORMANCE; PROGRAM PROCESSORS; SYNCHRONIZATION;

MEMORY MANAGEMENT; PTHREADS LIBRARY CALLS; SHARED-MEMORY COMPUTER SYSTEMS;

COMPUTER HARDWARE;

EID: 23944438611     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (44)

1. J. H. Anderson, Y.-J. Kim, and T. Herman. Shared-memory mutual exclusion: Major research trends since 1986. Distributed Computing, 16:75-100, 2003. Special issue celebrating the 20th anniversary of PODC.
2. E. D. Berger, K. S. McKinley, R. D. Blumofe, and P. R. Wilson. Hoard: A scalable memory allocator for multithreaded applications. In The Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-IX), Cambridge, MA, Nov. 2000.
3. W. Blochinger, W. Küchlin, and A. Weber. The distributed object-oriented threads system DOTS. In A. Ferreira, J. Rolim, H. Simon, and S.-H. Teng, editors, Fifth Intl. Symp. on Solving Irregularly Structured Problems in Parallel (IRREGULAR '98), number 1457 in LNCS, pages 206-217, Berkeley, CA, U.S.A., Aug. 1998. Springer.
4. P. Brucker. Scheduling Algorithms. Springer, Berlin, 3rd edition, 2001.
5. C. Busch, M. Mavronicolas, and P. Spirakis. The cost of concurrent, low-contention read-modify-write. In Proceedings of the 10th Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), Umeå, Sweden, 2003.
6. D. R. Butenhof. Programming with POSIX Threads. Addison Wesley, 1997.
7. R. L. Cariño and I. Banicescu. A load balancing tool for distributed parallel loops. In Proceedings of the International Workshop on Challenges of Large Application in Distributed Environments (CLADE) 2003, pages 39-46. IEEE Computer Society Press, June 2003.
8. C. Chantrapornchai, S. Tongsima, and E. H.-M. Sha. Imprecise task schedule optimization. In Proceedings of the International Conference on Fuzzy Systems, 1997.
9. A. T. Chronopoulos, S. Penmatsa, and N. Yu. Scalable loop self-scheduling schemes for heterogeneous clusters. In Proceedings of the IEEE International Conference on Cluster Computing (CLUSTER'02), page 353, Nov. 2002.
10. M. Cosnard, E. Jeannot, and T. Yang. SLC: Symbolic scheduling for executing parameterized task graphs on multiprocesors. In International Conference on Parallel Processing, 1999.
11. S. P. Dandamudi and S. Ayachi. Performance of hierarchical processor scheduling in shared-memory multiprocessor systems. IEEE Transactions on Computers, 48(11):1202-1213, 1999.
12. T. Decker. Virtual data space - load balancing for irregular applications. Parallel Computing, 26(13-14):1825-1860, Dec. 2000.
13. A. Gerasoulis, J. Jiao, and T. Yang. Experience with graph scheduling for mapping irregular scientific computation. In Proceedings of the First IPPS Workshop on Solving Irregular Problems on Distributed Memory Machines, Apr. 1995.
14. P. Hanrahan, D. Salzman, and L. Aupperle. A rapid hierarchical radiosity algorithm. In Proceedings of SIGGRAPH, 1991.
15. M. Herlihy, V. Luchangco, and M. Moir. Space- and time-adaptive nonblocking data structures. In CATS, 2003.
16. J. Hippold and G. Rünger. Task pool teams for implementing irregular algorithms on clusters of SMPs. In Proc. of IPDPS, Nice, France, 2003. CD-ROM.
17. C. A. R. Hoare. Quicksort. The Computer Journal, 5(4):10-15, 1962.
18. T. Johnson, T. A. Davis, and S. M. Hadfield. A concurrent dynamic task graph. Parallel Computing, 22(2):327-333, 1996.
19. L. V. Kale and S. Krishnan. CHARM++. In G. V. Wilson and P. Lu, editors, Parallel Programming in C++, chapter 5, pages 175-214. MIT Press, Cambridge, MA, 1996.
20. M. Korch and T. Rauber. A comparison of task pools for dynamic load balancing of irregular algorithms. Concurrency and Computation: Practice and Experience, 16:1-47, Jan. 2004.
21. V. Kumar, A. Y. Grama, and N. R. Vempaty. Scalable load balancing techniques for parallel computers. Journal of Parallel and Distributed Computing, 22(1):60-79, 1994.
22. Y.-K. Kwok and I. Ahmad. Benchmarking and comparison of the task graph scheduling algorithms. Journal of Parallel and Distributed Computing, 59(3):381-422, 1999.
23. M. Levoy. Efficient ray tracing of volume data. ACM Transactions on Graphics, 9(3):245-251, July 1990.
24. M. Levoy. Volume rendering by adaptive refinement. The Visual Computer, 6(1):2-7, Feb. 1990.
25. V. Luchangco, M. Moir, and N. Shavit. Obstruction-free synchronization: Double-ended queues as an example. In Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS), 2003.
26. J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors, http://www.cs.rochester.edu/u/scott/synchronization/pseudocode/ss.html.
27. J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1):21-65, 1991.
28. M. M. Michael and M. L. Scott. Nonblocking algorithms and preemption-safe locking on multiprogrammed shared-memory multiprocessors. Journal of Parallel and Distributed Computing, 51(1):1-26, 1998.
29. J. Nieh and M. Levoy. Volume rendering on scalable shared-memory MIMD architectures. In Proceedings of the Boston Workshop on Volume Visualization, pages 17-24. ACM Press, Oct. 1992.
30. A. Osman and H. Ammar. Dynamic load balancing strategies for parallel computers. In International Symposium on Parallel and Distributed Computing (ISPDC), July 2002.
31. A. Podehl, T. Rauber, and G. Hunger. A shared-memory implementation of the hierarchical radiosity method. Theoretical Computer Science, 196(1-2):215-240, 1998.
32. K. H. Randall. Cilk: Efficient Multithreaded Computing. PhD thesis, MIT Department of Electrical Engineering and Computer Science, June 1998.
33. L. Rauchwerger. Run-time parallelization: It's time has come. Journal of on Parallel Computing, Special Issue on Languages & Compilers for Parallel Computers, 24(3-4):527-556, 1998.
34. K. Schloegel, G. Karypis, and V. Kumar. A unified algorithm for load-balancing adaptive scientific simulations. In Proc. Supercomputing 2000, 2000.
35. J. P. Singh, A. Gupta, and M. Levoy. Parallel visualization algorithms: Performance and architectural implications. IEEE Computer, 27(7):45-55, July 1994.
36. J. P. Singh, C. Holt, T. Tosuka, A. Gupta, and J. L. Hennessy. Load balancing and data locality in adaptive hierarchical n-body methods: Barnes-Hut, fast multipole, and radiosity. Journal of Parallel and Distributed Computing, 27(2):118-141, June 1995.
37. SPARC International, Inc. The SPARC Architecture Manual Version 9, 2000.
38. J. M. Tendler, S. Dodson, S. Fields, H. Lee, and B. Sinharoy. POWER4 System Microarchitecture. IBM Server Group, Oct. 2001.
39. V. Thomé, D. Vianna, R. Costa, A. Plastino, and O. da Silveira Filho. Exploring load balancing in a scientific SPMD application. In Proceedings of the 2002 ICPP Workshops, pages 419-426, Aug. 2002.
40. S. Tongsima, C. Chantrapornchai, E. H.-M. Sha, and N. Passos. Probabilistic rotation: Scheduling graphs with uncertain execution time. In Proceedings of the International Conference on Parallel Processing, pages 292-297, 1997.
41. V.-Y. Vee and W.-J. Hsu. A Scalable and Efficient Storage Allocator on Shared-Memory Multiprocessors. In Proceedings of the International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99), pages 230-235, Fremantle, Australia, 1999.
42. K.-P. Vo. Vmalloc: A general and efficient memory allocator. Software Practice & Experience, 26:1-18, 1996.
43. S. C. Woo, M. Ohara, E. Torrie, J. P. Singh, and A. Gupta. The SPLASH-2 programs: Characterization and methodological considerations. In Proceedings of the 22nd International Symposium on Computer Architecture, pages 24-36, Santa Margherita Ligure, Italy, 1995.
44. T. Yang and A. Gerasoulis. PYRROS: Static task scheduling and code generation for message passing multiprocessors. In Proceedings of the 6th ACM International Conference on Supercomputing, pages 428-437, Washington D.C., July 1992.