Designing irregular parallel algorithms with mutual exclusion and lock-free protocols

Journal of Parallel and Distributed Computing

Volumn 66, Issue 6, 2006, Pages 854-866

  Cong, Guojing ^a   Bader, David A ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

High performance algorithm engineering; Irregular algorithm; Parallel algorithms; Shared memory

Indexed keywords

ABSTRACTING; COMPUTER PROGRAMMING; DATA STRUCTURES; HARDWARE; INTERCONNECTION NETWORKS; PROGRAM PROCESSORS; SYNCHRONIZATION;

FINE-GRAINED SYNCHRONIZATION; HIGH-PERFORMANCE ALGORITHM ENGINEERING; IRREGULAR ALGORITHM; SHARED MEMORY;

PARALLEL ALGORITHMS;

EID: 33646270888     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2005.12.004     Document Type: Article

References (67)

1. J. Alemany, E.W. Felton, Performance issues in non-blocking synchronization on shared-memory multiprocessors, in: Proceedings of the 11th ACM Symposium on Principles of Distributed Computing, Vancouver, Canada, August 1992, pp. 125-134.
2. An L., Xiang Q.S., and Chavez S. A fast implementation of the minimum spanning tree method for phase unwrapping. IEEE Trans. Med. Imaging 19 8 (2000) 805-808
3. R.J. Anderson, H. Woll, Wait-free parallel algorithms for the union-find problem, in: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC), New Orleans, LA, May 1991, pp. 370-380.
4. J. Aspnes, M.P. Herlihy, Wait-free data structures in the asynchronous PRAM model, in: Proceedings of the 2nd Annual Symposium on Parallel Algorithms and Architectures (SPAA-90), Crete, Greece, July 1990, pp. 340-349.
5. Attiya H., Lynch N., and Shavit N. Are wait-free algorithms fast?. J. ACM 41 4 (1994) 725-763
6. D.A. Bader, G. Cong, A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs), in: Proceedings of the International l Parallel and Distributed Processing Symposium (IPDPS 2004), Santa Fe, NM, April 2004.
7. D.A. Bader, G. Cong, Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs, in: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS 2004), Santa Fe, NM, April 2004.
8. Bader D.A., and Cong G. A fast parallel spanning tree algorithm for symmetric multiprocessors (SMPs). J. Parallel Distributed Comput. 65 9 (2005) 994-1006
9. D.A. Bader, A.K. Illendula, B.M.E. Moret, N. Weisse-Bernstein, Using PRAM algorithms on a uniform-memory-access shared-memory architecture, in: G.S. Brodal, D. Frigioni, A. Marchetti-Spaccamela (Eds.), Proceedings of the 5th International Workshop on Algorithm Engineering (WAE 2001), Lecture Notes in Computer Science, vol. 2141, Århus, Denmark, Springer, Berlin, 2001, pp. 129-144.
10. D.A. Bader, S. Sreshta, N. Weisse-Bernstein, Evaluating arithmetic expressions using tree contraction: a fast and scalable parallel implementation for symmetric multiprocessors (SMPs), in: S. Sahni, V.K. Prasanna, U. Shukla (Eds.), Proceedings of the 9th International Conference on High Performance Computing (HiPC 2002), Lecture Notes in Computer Science, vol. 2552, Bangalore, India, Springer, Berlin, December 2002, pp. 63-75.
11. G. Barnes, Wait-free algorithms for heaps, Technical Report TR-94-12-07, University of Washington, Seattle, WA, 1994.
12. Brinkhuis M., Meijer G.A., van Diest P.J., Schuurmans L.T., and Baak J.P. Minimum spanning tree analysis in advanced ovarian carcinoma. Anal. Quant. Cytol. Histol. 19 3 (1997) 194-201
13. C. Chen, S. Morris, Visualizing evolving networks: minimum spanning trees versus pathfinder networks, in: IEEE Symposium on Information Visualization, Seattle, WA, IEEE Computer Society Press, 2003, pp. 67-74.
14. B. Chor, A. Israeli, M. Li, On processor coordination using asynchronous hardware, in: Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, Vancouver, Canada, August 1987, pp. 86-97.
15. S. Chung, A. Condon, Parallel implementation of Borůvka's minimum spanning tree algorithm, in: Proceedings of the 10th International Parallel Processing Symposium (IPPS'96), April 1996, pp. 302-315.
16. Coffman T., Greenblatt S., and Marcus S. Graph-based technologies for intelligence analysis. Comm. ACM 47 3 (2004) 45-47
17. R. Cole, P.N. Klein, R.E. Tarjan, A linear-work parallel algorithm for finding minimum spanning trees, in: Proceedings of the 6th Annual Symposium on Parallel Algorithms and Architectures (SPAA-94), Newport, RI, ACM, New York, June 1994, pp. 11-15.
18. R. Cole, P.N. Klein, R.E. Tarjan, Finding minimum spanning forests in logarithmic time and linear work using random sampling, in: Proceedings of the 8th Annual Symposium on Parallel Algorithms and Architectures (SPAA-96), Newport, RI, ACM, New York, June 1996, pp. 243-250.
19. R. Cole, O. Zajicek, The APRAM: incorporating asynchrony into the PRAM model, in: Proceedings of the 1st Annual Symposium Parallel Algorithms and Architectures (SPAA-89), Santa Fe, NM, June 1989, pp. 169-178.
20. G. Cong, D.A. Bader, The Euler tour technique and parallel rooted spanning tree, in: Proceedings of the International Conference on Parallel Processing (ICPP), Montreal, Canada, August 2004, pp. 448-457.
21. D.E. Culler, R.M. Karp, D.A. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: towards a realistic model of parallel computation, in: 4th Symposium on Principles and Practice of Parallel Programming, ACM SIGPLAN, May 1993, pp. 1-12.
22. Dolev D., Dwork C., and Stockmeyer L. On the minimal synchronism needed for distributed consensus. J. ACM 34 1 (1987) 77-97
23. Dore J.C., Gilbert J., Bignon E., Crastes de Paulet A., Ojasoo T., Pons M., Raynaud J.P., and Miquel J.F. Multivariate analysis by the minimum spanning tree method of the structural determinants of diphenylethylenes and triphenylacrylonitriles implicated in estrogen receptor binding, protein kinase C activity, and MCF7 cell proliferation. J. Med. Chem. 35 3 (1992) 573-583
24. Dwork C., Lynch N., and Stockmeyer L. Consensus in the presence of partial synchrony. J. ACM 35 2 (1988) 288-323
25. Fischer M.J., Lynch N.A., and Paterson M.S. Impossibility of distributed consensus with one faulty process. J. ACM 32 2 (1985) 374-382
26. K. Fraser, Practical lock-freedom, Ph.D. Thesis, King's College, University of Cambridge, United Kingdom, September 2003.
27. S. Goddard, S. Kumar, J.F. Prins, Connected components algorithms for mesh-connected parallel computers, in: S.N. Bhatt (Ed.), Parallel Algorithms: 3rd DIMACS Implementation Challenge, October 17-19, 1994, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 30, American Mathematical Society, Providence, RI, 1997, pp. 43-58.
28. Gottlieb A., Grishman R., Kruskal C.P., McAuliffe K.P., Rudolph L., and Snir M. The NYU ultracomputer-designing a MIMD, shared-memory parallel machine. IEEE Trans. Comput. C-32 2 (1984) 175-189
29. J. Greiner, A comparison of data-parallel algorithms for connected components, in: Proceedings of the 6th Annual Symposium on Parallel Algorithms and Architectures (SPAA-94), Cape May, NJ, June 1994, pp. 16-25.
30. Herlihy M.P. Wait-free synchronization. ACM Trans. Programming Languages Systems (TOPLAS) 13 1 (1991) 124-149
31. Herlihy M.P. A methodology for implementing highly concurrent data objects. ACM Trans. Programming Languages Systems (TOPLAS) 15 5 (1993) 745-770
32. M. Herlihy, J.E.B. Moss, Transactional memory: architectural support for lock-free data structures, in: Proceedings of the 20th International Symposium on Computer Architecture, San Diego, CA, May 1993, pp. 289-300.
33. M.P. Herlihy, J.M. Wing, Axioms for concurrent objects, in: Proceedings of the 14th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, Munich, West Germany, January 1987, pp. 13-26.
34. T.-S. Hsu, V. Ramachandran, N. Dean, Parallel implementation of algorithms for finding connected components in graphs, in: S.N. Bhatt (Ed.), Parallel Algorithms: 3rd DIMACS Implementation Challenge, October 17-19, 1994, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 30, American Mathematical Society, Providence, RI, 1997, pp. 23-41.
35. IBM, Assembler Language Reference, AIX 4.3 books, first ed., 1997.
36. JáJá J. An Introduction to Parallel Algorithms (1992), Addison-Wesley Publishing Company, New York
37. Kayser K., Jacinto S.D., Bohm G., Frits P., Kunze W.P., Nehrlich A., and Gabius H.J. Application of computer-assisted morphometry to the analysis of prenatal development of human lung. Anat. Histol. Embryol. 26 2 (1997) 135-139
38. Kayser K., Stute H., and Tacke M. Minimum spanning tree, integrated optical density and lymph node metastasis in bronchial carcinoma. Anal. Cell Pathol. 5 4 (1993) 225-234
39. Krebs V.E. Mapping networks of terrorist cells. Connections 24 3 (2002) 43-52
40. A. Krishnamurthy, S.S. Lumetta, D.E. Culler, K. Yelick, Connected components on distributed memory machines, in: S.N. Bhatt (Ed.), Parallel Algorithms: 3rd DIMACS Implementation Challenge, October 17-19, 1994, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 30, American Mathematical Society, Providence, RI, 1997, pp. 1-21.
41. A. LaMarca, A performance evaluation of lock-free synchronization protocols, in: Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, CA, August 1994, pp. 130-140.
42. Lamport L. Concurrent reading and writing. Comm. ACM 20 11 (1977) 806-811
43. Lamport L. Specifying concurrent program modules. ACM Trans. Programming Languages Systems (TOPLAS) 5 2 (1983) 190-222
44. V. Lanin, D. Shasha, Concurrent set manipulation without locking, in: Proceedings of the 7th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Austin, TX, March 1988, pp. 211-220.
45. Maon Y., Schieber B., and Vishkin U. Parallel ear decomposition search (EDS) and st-numbering in graphs. Theoret. Comput. Sci. 47 3 (1986) 277-296
46. H. Massalin, C. Pu, Threads and input/output in the synthesis kernel, in: Proceedings of the 12th ACM Symposium on Operating Systems Principles (SOSP), Litchfield Park, AZ, December 1989, pp. 191-201.
47. Matos M., Raby B.N., Zahm J.M., Polette M., Birembaut P., and Bonnet N. Cell migration and proliferation are not discriminatory factors in the in vitro sociologic behavior of bronchial epithelial cell lines. Cell Motility Cytoskeleton 53 1 (2002) 53-65
48. S. Meguerdichian, F. Koushanfar, M. Potkonjak, M. Srivastava, Coverage problems in wireless ad-hoc sensor networks, in: Proceedings of the INFOCOM '01, Anchorage, AK, IEEE Press, New York, April 2001, pp. 1380-1387.
49. Mehlhorn K., and Näher S. The LEDA Platform of Combinatorial and Geometric Computing (1999), Cambridge University Press, Cambridge
50. G.L. Miller, V. Ramachandran, Efficient parallel ear decomposition with applications. Manuscript, UC Berkeley, MSRI, January 1986.
51. B.M.E. Moret, H.D. Shapiro, An empirical assessment of algorithms for constructing a minimal spanning tree, in: DIMACS Monographs in Discrete Mathematics and Theoretical Computer Science: Computational Support for Discrete Mathematics, vol. 15, American Mathematical Society, Providence, RI, 1994, pp. 99-117.
52. V. Olman, D. Xu, Y. Xu, Identification of regulatory binding sites using minimum spanning trees, in: Proceedings of the 8th Pacific Symposium on Biocomputing (PSB 2003), Hawaii, World Scientific Publications, 2003, pp. 327-338.
53. Pettie S., and Ramachandran V. A randomized time-work optimal parallel algorithm for finding a minimum spanning forest. SIAM J. Comput. 31 6 (2002) 1879-1895
54. C.K. Poon, V. Ramachandran, A randomized linear work EREW PRAM algorithm to find a minimum spanning forest, in: Proceedings of the 8th International Symposium on Algorithms and Computation (ISAAC'97), Lecture Notes in Computer Science, vol. 1350, Springer, Berlin, 1997, pp. 212-222.
55. N. Shavit, D. Touitou, Software transactional memory, in: Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, Ottowa, Canada, August 1995, pp. 204-213.
56. Shiloach Y., and Vishkin U. An O ( log n ) parallel connectivity algorithm. J. Algorithms 3 1 (1982) 57-67
57. Tarjan R.E., and Van Leeuwen J. Worst-case analysis of set union algorithms. J. ACM 31 2 (1984) 245-281
58. Tarjan R.E., and Vishkin U. An efficient parallel biconnectivity algorithm. SIAM J. Comput. 14 4 (1985) 862-874
59. Tseng Y.-C., Juang T.T.-Y., and Du M.-C. Building a multicasting tree in a high-speed network. IEEE Concurrency 6 4 (1998) 57-67
60. P. Tsigas, Y. Zhang, A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems, in: Proceedings of the 13th Annual Symposium on Parallel Algorithms and Architectures (SPAA-01), Crete, Greece, September 2001, pp. 134-143.
61. Valiant L.G. A bridging model for parallel computation. Comm. ACM 33 8 (1990) 103-111
62. J. Valois, Lock-free data structures, Ph.D. Thesis, Rensselaer Polytechnic Institute, Troy, NY, May 1995.
63. J.D. Valois, Lock-free linked lists using compare-and-swap, in: Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, Ottowa, Canada, August 1995, pp. 214-222.
64. Vishkin U. On efficient parallel strong orientation. Inform. Process. Lett. 20 5 (1985) 235-240
65. U. Vishkin, S. Dascal, E. Berkovich, J. Nuzman, Explicit multi-threading (XMT) bridging models for instruction parallelism, in: Proceedings of the 10th Annual Symposium on Parallel Algorithms and Architectures (SPAA-98), Puerto Vallarta, Mexico, June 1998, ACM, New York, pp. 140-151.
66. D.L. Weaver, T. Germond (Eds.), The SPARC Architecture Manual, Version 9, Prentice-Hall, Englewood Cliffs, NJ, 1994.
67. S.Q. Zheng, J.S. Lim, S.S. Iyengar, Routing using implicit connection graphs, in: 9th International Conference on VLSI Design: VLSI in Mobile Communication, Bangalore, India, January 1996, IEEE Computer Society Press.