How to write parallel programs: A guide to the perplexed

ACM Computing Surveys (CSUR)

Volumn 21, Issue 3, 1989, Pages 323-357

  Carriero, Nicholas ^a   Gelernter, David ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

Linda; parallel programming methodology; parallelism

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SYSTEMS, DIGITAL--PARALLEL PROCESSING;

CONCURRENT PROGRAMMING; PARALLEL PROGRAMMING; PROGRAMMING PARADIGMS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0024738868     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/72551.72553     Document Type: Article

References (47)

1. Ashcraft, C., Carriero, N., and Gelernter, D. 1989. Is explicit parallelism natural? Hybrid DB search and sparse LDLT factorization using Linda. Res. Rep. 744, Dept. of Computer Science, Yale Univ., New Haven, Conn., Jan.
2. Bal, H. E., and Tanenbaum, A. S. 1987. Orca: A language for distributed object-based programming. Internal Rep. 140, Dept. Wiskunde en In-formatica, Vrije Universiteit, Amsterdam, Dec.
3. Birrell, A. D., and Nelson, B. J. 1984. Implementing remote procedure calls. ACM Trans. Comput. Syst. 2, 1 (Feb.), 39–59.
4. Bjornson, R., Carriero, N., and Gelernter, D. 1989. The implementation and performance of hypercube Linda. Res. Rep. 690, Dept. of Computer Science, Yale Univ., New Haven, Conn., Mar.
5. Bjornson, R., Carriero, N., Gelernter, D., and Leichter, J. 1988. Linda, the portable parallel. Res. Rep. 520, Dept. of Computer Science, Yale Univ., New Haven, Conn., Jan.
6. Borrman, L., Herdieckerhoff, M., and Klein, A. 1988. Tuple space integrated into Modula-2, Implementation of the Linda concept on a hierarchical multiprocessor. In Proceedings of CONPAR ’88, Jesshope and Reinartz, Eds. Cambridge Univ. Press, New York.
7. Brinch Hansen, P. 1975. The programming language Concurrent Pascal. IEEE Trans. Softw. Eng. SE-1, 2, 199–206.
8. Carriero, N., and Gelernter, D. 1988. Applications experience with Linda. In Proceedings of the ACM Symposium on Parallel Programming (New Haven, July). ACM, New York, pp. 173–187.
9. Carriero, N., and Gelernter, D. 1989. Linda in context. Commun. ACM 32, 4 (Apr.), 444–458.
10. Carriero, N., Gelernter, D., and Leichter, J. 1986. Distributed data structures in Linda. In Proceedings of the ACM Symposium on Principles of Programming Languages (St. Petersburg, Jan.). ACM, New York.
11. Chen, M. C. 1986. A parallel language and its compilation to multiprocessor architectures or VLSI. In Proceedings of the ACM Symposium on Principles of Programming Languages (St. Petersburg, Jan.). ACM, New York.
12. Cheriton, D. R., and Zwaenpoel, W. 1985. Distributed process groups in the V Kernel. ACM Trans. Comput. Syst. 3, 2 (May), 77–107.
13. Dally, W. J. 1988. Object-oriented concurrent programming in CST. In Proceedings of the 3rd Conference on Hypercube Concurrent Computers and Applications. (Pasadena, Jan, 1988) JPL/Caltech, p. 33.
14. Department of Defense, U.S. 1982. Reference Manual for the Ada Programming Language. ACM AdaTEC, July.
15. Gelernter, D. 1989. Information management in Linda. In M. Reeve and S. E. Zenith, eds., Parallel processing and artificial intelligence, J. Wiley (1989):/23–34, Proceedings of AI and Communicating Process Architectures (London, July).
16. Gelernter, D., Jagganathan, S., and London, T. 1987. Environments as first class objects. In Proceedings of the ACM Symposium on Principles of Programming Languages (Munich, Jan.). ACM, New York.
17. Gelernter, D., Carriero, N., Chandran, S., and Chang, S. 1985. Parallel programming in Linda. In Proceedings of the International Conference on Parallel Processing (St. Charles, Ill., Aug.). IEEE, 255–263.
18. Gilmore, P. 1979. Massive Parallel Processor (MPP): Phase One Final Report. Tech. Rep. GER-16684, Goodyear Aeorospace Co., Akron.
19. Greengard, L., and Rokhlin, V. 1987. A fast algorithm for particle simulations. J. Comput. Phys. 73, 2 (Dec), 325–348.
20. Halstead, R. 1985. Multilisp: A language for concurrent symbolic computation. ACM Trans. Program. Lang. Syst. 7, 4 (Oct.), 501–538.
21. Henderson, P. 1982. Purely functional operating systems. In Functional Programming and Its Applications, J. Darlington, P. Henderson, and D. A. Turner, Eds. Cambridge Univ. Press, New York, pp. 177–192.
22. Hillis, W. D., and Steele, G. L. 1986. Data parallel algorithms. Commun. ACM 29, 12 (Dec), 1170–1183.
23. Hoare, C. A. R. 1974. Monitors: An operating system structuring concept. Commun. ACM 17, 10 (Oct.), 549–557.
24. Hoare, C. A. R. 1978. Communicating sequential processes. Commun. ACM 21, 11 (Aug.), 666–677.
25. Hudak, P. 1986. Parafunctional programming. Computer 19, 8 (Aug.), 60–70
26. Jordan, H. F. 1986. Structuring parallel algorithms in an MIMD, shared memory environment. Parallel Comput. 3, 93–110.
27. Jul, E., Levy, H., Hutchinson, N., and Black, A. 1988. Fine-grained mobility in the Emerald system. ACM Trans. Comput. Syst. 6, 1 (Feb.), 109–133.
28. Kahn, G. 1974. The semantics of a simple language for parallel processing. In Proceedings of the IFIP Congress 74. North Holland, 471.
29. Lampson, B. W., and Redell, D. D. 1980. Experience with processes and monitors in Mesa. Commun. ACM 23, 2 (Feb.), 105–117.
30. Lee, C. C., Skedzielewski, S., and Feo, J. 1988. On the implementation of applicative languages on shared-memory, MIMD multiprocessors. In Proceedings of the ACM/SIGPLAN Symposium on Parallel Programming (New Haven, Aug.). ACM, New York.
31. Leler, W. 1989. PIX, the latest NEWS. In Proceedings of COMPCON Spring ’89 (San Francisco, Feb.). IEEE.
32. Marsland, T. A., and Campbell, M. 1982. Parallel search of strongly ordered game trees. ACM Comput. Surv. 14, 4 (Dec), 533–552.
33. Matsuoka, S., and Kawai, S. 1988. Using tuple space communication in distributed object-oriented languages. In Proceedings of OOPSLA ’88 (San Diego, Sept. 25–30), 276–284.
34. May, M. D. 1983. Occam. SIGPLAN Not. (ACM) 18, 4 (April), 69–79.
35. Mullender, S. J., and Tanenbaum, A. S. 1986. The design of a capability-based distributed operating system. Comput. J. 29, 4 (Mar.), 289–300.
36. Musgrave, F. K., and Mandelbrot, B. B. 1989. Natura ex machina. IEEE Comput. Graph. Appl. 9, 1 (Jan.), 4–7.
37. Narem, J. E. 1988. DB: A parallel news database in Linda. Tech. memo, Dept. of Computer Science, Yale Univ., New Haven, Conn., Aug.
38. Nikhil, R., Pingali, K., and Arvind. 1986. Id Nouveau. Memo 265, Computation Structures Group, MIT, Cambridge, Mass.
39. Olson, T. J. 1986. Finding lines with the Hough Transform on the BBN Butterfly parallel processor. Butterfly Proj. Rep. 10, Dept. of Comput. Science, Univ. of Rochester, New York, Sept.
40. Ringwood, G. A. 1988. Parlog86 and the dining logicians. Commun. ACM 31, 1 (Jan.), 10–25.
41. Roth, P. 1985. Portnoy’s Complaint. Fawcett Crest, p. 309 (first published by Random House, New York 1967).
42. Seitz, C. 1985. The cosmic cube. Commun. ACM 28, 1 (1985), 22–33.
43. Shapiro, E., Ed. 1987. Concurrent Prolog Collected Papers. Vols. 1 and 2. MIT Press, New York.
44. Whiteside, R. A., and Leichter, J. S. 1988. Using Linda for supercomputing on a local area network. In Proceedings of Supercomputing, (Orlando, Fla., Nov.), 192–199.
45. Wirth, N. 1977. Modula: A language for modular multiprogramming. Softw. Pract. Exp. 7, 3–35.
46. Xu, A. S. 1988. A fault-tolerant network kernel for Linda. Tech. Rep. MIT/LCS/TR-424, Laboratory for Computer Science, MIT, Cambridge, Mass., Aug.
47. Young, M., et al. 1987. The duality of memory and communication in the implementation of a multiprocessor operating system. In Proceedings of the 11th ACM Symposium on Operating Systems Principles (Austin, Tex., Nov.). ACM, New York, pp. 63–76.