Supporting Dynamic Data Structures on Distributed-Memory Machines

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 17, Issue 2, 1995, Pages 233-263

  Rogers, Anne ^a   Carlisle, Martin C ^a   Reppy, John H ^b   Hendren, Laurie J ^c  

^a PRINCETON UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

Dynamic data structures

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; COMPUTER SOFTWARE; DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS; PARALLEL PROCESSING SYSTEMS; PERFORMANCE; PROGRAM COMPILERS; SOFTWARE PROTOTYPING; STORAGE ALLOCATION (COMPUTER);

DISTRIBUTED MEMORY MACHINES; DYNAMIC DATA STRUCTURES; PARALLEL PROGRAMMING; RUN TIME ENVIRONMENTS;

DATA STRUCTURES;

EID: 0029273301     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/201059.201065     Document Type: Article

References (46)

1. Allen, R. And Kennedy K 1987. Automatic translation of FORTRAN programs to vector form. ACM Trans. Program. Lang. Syst. 9, 4 (Oct.), 491–542.
2. Allen F., Burke M, Charles P, Cytron R., And Ferrantej. 1988. An Overview Of The Ptran Analysis System For Multiprocessing. J. Parallel Distrib. Comput. 5, 5 (Oct.), 617–640.
3. Amarasinghe S. And Lam M 1993. Communication Optimization And Code Generation For Distributed Memory Machines. In Proceedings Of The Sigplan '93 Conference On Programming Language Design And Implementation. Acm, New York, 126-138.
4. Anderson J. And Lam M. 1993. Global optimizations for parallelism and locality on scalable parallel machines. In Proceedings of the SIGPLAN '93 Conference on Programming Language Design and Implementation. ACM, New York, 112–125.
5. Appel A. AND Li, K. 1991. Virtual memory primitives for user programs. In Proceedings of the 4th International Conference on Architectural Support for Programming Languages and Operating Systems. ACM, New York, 96-107.
6. Bal H., Kaashoek M. F., And Tanenbaum A 1992. Orca: A language for parallel programming of distributed systems. IEEE Trans. Softw. Eng. 18, 3 (Mar.), 190–205.BILARDI G. AND NICOLAU A. 1989. Adaptive bitonic sorting: An optimal parallel algorithm for shared-memory machines. SIAM J. Comput. 18, 2, 216–228.
7. Bobrow D. AND WEGBREIT, B. 1973. A model and stack implementation of multiple environments. Commun. ACM 16, 10, 591–603.
8. Callahan, D. And Kennedy K. 1988. Compiling programs for distributed-memory multiprocessors. J. Supercomput. 2, 2 (Oct.), 151–169.
9. Carlisle M., Rogers A., Reppy J. And Hendren L. 1994. Early Experiences With Olden. In Languages And Compilers For Parallel Machines: 6Th International Workshop, U. Baner-Jee D. Gelernter A. Nicolau And D. Padua Eds. Lecture Notes In Computer Science, Vol. 768. Springer-Verlag, Berlin, 1–20.
10. Carriero N., Gelernter D., And Leichter J. 1986. Distributed Data Structures In Linda. In Conference Record Of The 13Th Annual Acm Symposium On Principles Of Programming Languages. Acm, New York, 236–242.
11. Chase J., Amador F. G., Lazowska E., Levy H. M., And Littlefield R. J. 1989. The Amber system: Parallel programming on a network of multiprocesors. In Proceedings of the 12th ACM Symposium on Operating Systems Principles. ACM, New York, 147–158.
12. Chase J., AMADOR F. G., Lazowska E., LEVY H. M., And Littlefield R. J. 1989. The Amber system: Parallel programming on a network of multiprocesors. In Proceedings of the 12th ACM Symposium on Operating Systems Principles. ACM, New York, 147–158.
13. Cornien T., Leiserson C., and Rivest R. 1989. Introduction to Algorithms. McGraw-Hill, New York.
14. Culler D. E., Dusseau A., GOLDSTEIN S. C. Krishnamurthy A., LUMETTA S., Von ElCKEN, T., and Yelick K. 1993. Parallel programming in Split-C. In Proceedings of Supercomputing 93. IEEE Computer Society Press, Los Alamitos, Ca., 262-273.
15. Fraser C. W. And Hanson D. R. 1995. A Retargetable C Compiler: Design and Implementation. Benjamin/Cummings, Redwood City, Ca.
16. Gerndt M. 1990. Automatic parallelization for distributed-memory multiprocessing systems. Ph. D. thesis, University of Bonn.
17. Guibas L. AND STOLFI J. 1985. General subdivisions and voronoi diagrams. ACM Trans. Graph. 4, 2, 74–123.
18. Gupta R. 1992. SPMD execution of programs with dynamic data structures on distributed memory machines. In Proceedings of the 1992 International Conference on Computer Languages. IEEE Computer Society Press, Los Alamitos, Ca., 232–241.
19. Halstead R. H., JR. 1985. Multilisp: A language for concurrent symbolic computation. ACM Trans. Program. Lang. Syst. 7, 4 (Oct.), 501–538.
20. Hendren L. J. 1990. Parallelizing programs with recursive data structures. Ph. D. thesis, Cornell University, Ithaca, N.Y.
21. Hendren L. J. AND NICOLAU A. 1990. Parallelizing programs with recursive data structures. IEEE Trans. Parallel Distrib. Syst. 1, 35–47.
22. Hendren, L. J., Hummel J., AND NICOLAU A. 1992. Abstractions for recursive pointer data structures: Improving the analysis and transformation of imperative programs. In Proceedings of the SIGPLAN '92 Conference on Programming Language Design and Implementation. ACM, New York, 249–260.
23. Hiranandani S., Kennedy K., AND Tseng C. 1991. Compiler optimizations for FORTRAN D on MIMD distributed memory machines. In Proceedings of Supercomputing 91. IEEE Computer Society Press, Los Alamitos, Ca., 86–100.
24. Hogen G. and Loogen, R. 1993. A new stack technique for the management of runtime structures in distributed implementations. Tech. Rep. 3, RWTH Aachen.
25. Horwat W., Chien A., And Dally W. 1989. Experience With Cst: Programming And Implementation. In Proceedings Of The Sigplan '89 Conference On Programming Language Design And Implementation. Acm, New York, 101–108.
26. Hsieh, W., Wang P. And Weihl, W. 1993. Computation Migration: Enhancing Locality For Distributed-Memory Parallel Systems. In Proceedings Of The 4Th Acm Sigplan Symposium On Principles And Practice Of Parallel Programming. Acm, New York, 239–248.
27. Jul E., Levy H., Hutchinsonn., And Black A. 1988. Fine-Grained Mobility In The Emerald System. Acm Trans. Comput. Syst. 6, 1, 109–133.
28. Karamcheti V. And Chien A. 1993. Concert — Efficient Runtime Support For Concurrent Object-Oriented Programming Languages On Stock Hardware. In Proceedings Of Supercomputing 93. Ieee Computer Society Press, Los Alamitos, Ca., 598–607.
29. Karp, R. 1977. Probabilistic analysis of partitioning algorithms for the traveling-saleman problem in the plane. Math Oper. Res. 2, 3 (Aug.), 209–224.
30. Koelbel C. 1990. Compiling programs for nonshared memory machines. Ph. D. thesis, Purdue University, West Lafayette, Ind.
31. Larus J. R. 1991. Compiling lisp programs for parallel execution. Lisp Symb. Comput. 4, L 29–99.
32. Larus, J. R. 1989. Restructuring symbolic programs for concurrent execution on multiprocessors. Ph. D. thesis, University of California, Berkeley.
33. Larus J. R. And Hilfinger P. N. 1988. Detecting conflicts between structure accesses. In Proceedings of the ‘ SIGPLAN ’$8 Conference on Programming Language Design and Implementation. ACM, New York, 21–34.
34. Larus J. R. AND HILFINGER, P. N. 1988. Restructuring Lisp programs for concurrent execution. In Proceedings of the ACM/SIGPLAN PPEALS 1988 — Parallel Programming: Experience with Applications, Languages and Systems. ACM, New York, 100–110.
35. Lee D. T. and Schachter B. J. 1980. Two algorithms for constructing a delaunay triangulation. Int. J. Comput. Inf. Sal. 9, 3, 219–242.
36. Lumetta S., Murphy L., Li, X., Culler D., And Khalil I 1993. Decentralized optimal power pricing: The development of a parallel program. In Proceedings of Supercomputing 93. IEEE Computer Society Press, Los Alamitos, Ca., 240–249.
37. Mohr, E., Kranz D. A., and Halstead R. H. Jr. 1991. Lazy task creation: A technique for increasing the granularity of parallel programs. IEEE Trans. Parallel Dist. Syst. 2, 3 (July), 264–280.
38. Muller J. 1993. Parallelverarbeitung auf workstation-clustern mittels express und network-linda. Diplomarbeit in Elektrotechnik, RWTH-Aachen.
39. Nikhil R. 1994. Cid: A parallel, “shared-memory” C for distributed-memory machines. In Proceedings of the 7th Annual Workshop on Languages and Compilers for Parallel Computing, Dept. of Computer Science, Cornell University, Ithaca, N.Y.
40. Roberts E. S. And Vandevoorde M. T. 1989. WorkCrews: An abstraction for controlling parallelism. Tech. Rep. 42, DEC Systems Research Center, Palo Alto, Ca. April.
41. Rogers, A. And Pingali K. 1989. Process decomposition through locality of reference. In Proceedings of the SIGPLAN '89 Conference on Programming Language Design and Implementation. ACM, New York, 69–80.
42. Rogers, A, Reppy J., And Hendren L. 1993. Supporting Spmd Execution For Dynamic Data Structures. In Languages And Compilers For Parallel Machines: 5Th International Workshop, U. Banerjee D Gelericter, A. Nicolau, Andd. Padua Eds. Lecture Notes In Computer Science, Vol 757. Springer-Verlag, Berlin, 192–207.
43. Schoinas I., Falsafi B., Lebeck A. R., Reinhardt S. K., Larus J. R, And Wood D. A. 1994. Fine-Grain Access Control For Distributed Shared Memory. In Proceedings Of The 6Th International Conference On Architectural Support For Programming Languages And Operating Systems. Acm, New York, 297–306.
44. Von Eicken T, Culler D. E., Goldstein S. C, And Schauser K. E. 1992. Active Messages: A Mechanism For Integrating Communication And Computation. In Proceedings Of The 19Th Annual International Symposium On Computer Architecture. Acm, New York, 256–266.
45. Weihl, W., Brewer E., Colbrook A., Dellarocas C., Hsieh W., Joseph A., Wald-Spurger, C., And Wang P. 1989. Prelude: A System For Portable Parallel Software. Mit/Lcs 519, Massachusetts Institute Of Technology, Cambridge, Mass.
46. Wolfe M 1989. Optimizing Supercompilers For Supercomputers. Pitman Publishing, London. Zima H., Bast H. And Gerndt M. 1988. Superb: A Tool For Semi-Automatic Mimd/Simd Parallelization. Parallel Comput. 6 1, 1–18.