Work-stealing for mixed-mode parallelism by deterministic team-building

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2011, Pages 105-115

  Wimmer, Martin ^a   Träff, Jesper Larsson ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

deterministic team building; mixed mode parallelism; quicksort; work stealing

Indexed keywords

DATA PARALLEL; DEGENERATE CASE; HARDWARE THREADS; LOCALITY AWARE; LOCK-FREE DATA STRUCTURES; MIXED MODE; NUMBER OF THREADS; PARTITIONING STEP; QUICKSORT; TEAM BUILDING; THREADING BUILDING BLOCKS; TIGHTLY-COUPLED; WORK-STEALING;

DATA STRUCTURES; STANDARDIZATION;

ALGORITHMS;

EID: 79959638447     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989493.1989507     Document Type: Conference Paper

References (21)

1. N. S. Arora, R. D. Blumofe, and C. G. Plaxton. Thread scheduling for multiprogrammed multiprocessors. Theory of Computing Systems, 34(2):115-144, 2001.
2. R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An efficient multithreaded runtime system. Journal of Parallel and Distributed Computing, 37(1):55-69, 1996. (Pubitemid 126167766) (Pubitemid 126167766)
3. R. D. Blumofe and C. E. Leiserson. Scheduling multithreaded computations by work stealing. Journal of the ACM, 46(5):720-748, 1999.
4. V. Boudet, F. Desprez, and F. Suter. One-step algorithm for mixed data and task parallel scheduling without data replication. In 17th International Parallel and Distributed Processing Symposium (IPDPS), page 41, 2003.
5. S. Chakrabarti, J. Demmel, and K. A. Yelick. Models and scheduling algorithms for mixed data and task parallel programs. Journal of Parallel and Distributed Computing, 47(2):168-184, 1997. (Pubitemid 127174399)
6. L. A. Crowl, M. Crovella, T. J. LeBlanc, and M. L. Scott. The advantages of multiple parallelizations in combinatorial search. Journal of Parallel and Distributed Computing, 21(1):110-123, 1994.
7. F. Desprez and F. Suter. Impact of mixed-parallelism on parallel implementations of the Strassen and Winograd matrix multiplication algorithms. Concurrency - Practice and Experience, 16(8):771-797, 2004.
8. J. Dümmler, T. Rauber, and G. Rünger. Communicating multiprocessor-tasks. In Languages and Compilers for Parallel Computing (LCPC), volume 5234 of Lecture Notes in Computer Science, pages 292-307, 2007.
9. P.-F. Dutot, T. N'Takpé, F. Suter, and H. Casanova. Scheduling parallel task graphs on (almost) homogeneous multicluster platforms. IEEE Transactions on Parallel and Distributed Systems, 20(7):940-952, 2009.
10. D. R. Helman, D. A. Bader, and J. JáJá. A randomized parallel sorting algorithm with an experimental study. Journal of Parallel and Distributed Computing, 52(1):1-23, 1998. (Pubitemid 128343527) (Pubitemid 128343527)
11. M. Herlihy and N. Shavit. The Art of Multiprocessor Programming. Morgan Kaufmann Publishers, 2008.
12. A. Kukanov and M. J. Voss. The foundations for scalable multi-core software in Intel Threading Building Blocks. Intel Technology Journal, 11(4), 2007.
13. A. Radulescu and A. J. C. van Gemund. A low-cost approach towards mixed task and data parallel scheduling. In Proceedings of the 2001 International Conference on Parallel Processing (ICPP), pages 69-76, 2001.
14. T. Rauber and G. Rünger. A coordination language for mixed task and and data parallel programs. In Proceedings of the 1999 ACM Symposium on Applied Computing (SAC), pages 146-155, 1999.
15. T. Rauber and G. Rünger. Mixed task and data parallel executions in general linear methods. Scientific Programming, 15(3):137-155, 2007. (Pubitemid 350084285)
16. J. Shirako, D. M. Peixotto, V. Sarkar, and W. N. S. III. Phasers: a unified deadlock-free construct for collective and point-to-point synchronization. In Proceedings of the 22nd Annual International Conference on Supercomputing (ICS), pages 277-288. ACM, 2008.
17. J. Singler, P. Sanders, and F. Putze. MCSTL: The Multi-core Standard Template Library. In 13th International Euro-Par Conference, volume 4641 of LNCS, pages 682-694. Springer, 2007.
18. S. Thibault, R. Namyst, and P.-A. Wacrenier. Building portable thread schedulers for hierarchical multiprocessors: The BubbleSched framework. In Euro-Par, Parallel Processing, volume 4641 of Lecture Notes in Computer Science, pages 42-51, 2007.
19. P. Tsigas and Y. Zhang. A simple, fast parallel implementation of quicksort and its performance evaluation on SUN Enterprise 10000. In Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP), pages 372-381, 2003.
20. M. Wimmer and J. L. Träff. Work-stealing for mixed-mode parallelism by deterministic team-building. CoRR, abs/1012.5030, 2010.
21. M. Wimmer and J. L. Träff. A work-stealing framework for mixed-mode parallel applications. In Workshop on Multi-threaded Architectures and Applications (MTAAP 2011) at International Parallel and Distributed Processing Symposium (IPDPS 2011), 2011.