On-the-fly maintenance of series-parallel relationships in Fork-Join multithreaded programs

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn 16, Issue , 2004, Pages 133-144

  Bender, Michael A ^a,b,c   Fineman, Jeremy T ^a   Gilbert, Seth ^a   Leiserson, Charles E ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MIT CSAII   (United States)

^c STONY BROOK UNIVERSITY   (United States)

Author keywords

Algorithm; Amortized analysis; Cilk; Data race; Data structure; Dynamic set; Fork join; Graph; Least common ancestor; Locking; Multi threading; Mutual exclusion; On the fly; Order maintenance; Parallel computing; Parse tree; Race detection

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; PROGRAM PROCESSORS; SOFTWARE ENGINEERING;

AMORTIZED ANALYSIS; LEAST COMMON ANCESTORS; MULTITHREADING; MUTUAL EXCLUSION;

PARALLEL PROCESSING SYSTEMS;

EID: 8344220428     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007912.1007933     Document Type: Conference Paper

References (37)

1. S. Abiteboul, H. Kaplan, and T. Milo. Compact labeling schemes for ancestor queries. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 547-556, 2001.
2. S. Alstrup, P. Bille, and T. Rauhe. Labeling schemes for small distances in trees. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 689-698, 2003.
3. S. Alstrup, C. Gavoille, H. Kaplan, and T. Rauhe. Nearest common ancestors: a survey and a new distributed algorithm. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pages 258-264, 2002.
4. S. Alstrup, J. Holm, K. de Lichtenberg, and M. Thorup. Direct routing on trees. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 342-349, 1998.
5. S. Alstrup and T. Rauhe. Improved labeling scheme for ancestor queries. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 947-953, 2002.
6. R. J. Anderson and H. Woll. Wait-free parallel algorithms for the union-find problem. In Proceedings of the ACM Symposium on the Theory of Computing, pages 370-380, 1991.
7. A. Andersson and O. Petersson. Approximate indexed lists. Journal of Algorithms, 29:256-276, 1998.
8. M. Arias, L. J. Cowen, and K. A. Laing. Compact roundtrip routing with topology-independent node names. In Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 43-52, 2003.
9. N. Arora, R. Blumofe, and G. Plaxton. Thread scheduling for multi-programmed multiprocessors. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pages 119-129, 1998.
10. M. A. Bender, R. Cole, E. D. Demaine, M. Farach-Colton, and J. Zito. Two simplified algorithms for maintaining order in a list. In Proceedings of the European Syposium on Algorithms, pages 152-164, 2002.
11. R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An efficient multithreaded runtime system. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 207-216, Santa Barbara, California, July 1995.
12. R. D. Blumofe and C. E. Leiserson. Scheduling multithreaded computations by work stealing. J. ACM, 46(5):720-748, 1999.
13. G.-I. Cheng, M. Feng, C. E. Leiserson, K. H. Randall, and A. F. Stark. Detecting data races in Cilk programs that use locks. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, Puerto Vallarta, Mexico, June 1998.
14. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press and McGraw-Hill, second edition, 2001.
15. P. F. Dietz. Maintaining order in a linked list. In Proceedings of the ACM Symposium on the Theory of Computing, pages 122-127, May 1982.
16. P. F. Dietz, J. I. Seiferas, and J. Zhang. A tight lower bound for on-line monotonic list labeling. In Proceedings of the Scandinavian Workshop on Algorithm Theory, volume 824 of Lecture Notes in Computer Science, pages 131-142, July 1994.
17. P. F. Dietz and D. D. Sleator. Two algorithms for maintaining order in a list. In Proceedings of the ACM Symposium on the Theory of Computing, pages 365-372, May 1987.
18. P. F. Dietz and J. Zhang. Lower bounds for monotonic list labeling. In Proceedings of the Scandinavian Workshop on Algorithm Theory, volume 447 of Lecture Notes in Computer Science, July 1990.
19. A. Dinning and E. Schonberg. An empirical comparison of monitoring algorithms for access anomaly detection. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 1-10, 1990.
20. M. Feng and C. E. Leiserson. Efficient detection of determinacy races in Cilk programs. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pages 1-11, Newport, Rhode Island, June 1997.
21. M. Frigo, C. E. Leiserson, and K. H. Randall. The implementation of the Cilk-5 multithreaded language. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 212-223, 1998.
22. C. Gavoille, D. Peleg, S. Pérennes, and R. Raz. Distance labeling in graphs. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 210-219, 2001.
23. A. Itai, A. G. Konheim, and M. Rodeh. A sparse table implementation of priority queues. In S. Even and O. Kariv, editors, Proceedings of the Colloquium on Automata, Languages, and Programming, volume 115 of Lecture Notes in Computer Science, pages 417-431, Acre (Akko), Israel, July 1981.
24. H. Kaplan, T. Milo, and R. Shabo. A comparison of labeling schemes for ancestor queries. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 954-963, 2002.
25. M. Katz, N. A. Katz, A. Korman, and D. Peleg. Labeling schemes for flow and connectivity. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 927-936, 2002.
26. J. Mellor-Crummey. On-the-fly detection of data races for programs with nested fork-join parallelism. In Proceedings of Supercomputing, pages 24-33, 1991.
27. I. Nudler and L. Rudolph. Tools for the efficient development of efficient parallel programs. In Proceedings of the First Israeli Conference on Computer Systems Engineering, May 1986.
28. Supercomputing Technologies Group, MIT Laboratory for Computer Science. Cilk 5.3.2 Reference Manual, November 2001.
29. R. E. Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22(2):215-225, April 1975.
30. R. E. Tarjan. Applications of path compression on balanced trees. Journal of the ACM, 26(4):690-715, October 1979.
31. R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, 1983.
32. M. Thorup and U. Zwick. Compact routing schemes. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pages 1-10, 2001.
33. A. K. Tsakalidis. Maintaining order in a generalized linked list. Acta Informatica, 21(1):101-112, May 1984.
34. D. E. Willard. Inserting and deleting records in blocked sequential files. Technical Report TM81-45193-5, Bell Laboratories, 1981.
35. D. E. Willard. Maintaining dense sequential files in a dynamic environment. In Proceedings of the ACM Symposium on the Theory of Computing, pages 114-121, San Francisco, California, May 1982.
36. D. E. Willard. Good worst-case algorithms for inserting and deleting records in dense sequential files. In Proceedings of the ACM International Conference on Management of Data, pages 251-260, Washington, D.C., May 1986.
37. D. E. Willard. A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time. Information and Computation, 97(2):150-204, April 1992.