Data parallel algorithms

Communications of the ACM

Volumn 29, Issue 12, 1986, Pages 1170-1183

  Hillis, W Daniel ^a   Steele, Guy L ^a  

^a SUN MICROSYSTEMS   (United States)

Author keywords

Combinator reduction; combinatow; Connection Machine computer system; log linked lists; parallel prefix; SIMD; sorting; Ultracomputer

Indexed keywords

COMPUTER SYSTEMS, DIGITAL - PARALLEL PROCESSING;

CONNECTION MACHINE; DATA PARALLEL ALGORITHMS;

COMPUTER PROGRAMMING;

EID: 0022882379     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/7902.7903     Document Type: Article

References (25)

1. Backus, J. Can programming be liberated from the von Neumann style? A functional style and its algebra of programs (1977 ACM Turing Award Lecture). Commun. ACM 21, 8 (Aug. 1978), 613–641.
2. Batcher, K.E. Sorting networks and their applications. In Proceedings of the 1968 Spring joint Computer Conference (Reston, Va., Apr.) AFIPS, Reston, Va., 1968, pp. 307–314.
3. Batcher, K.E. Design of a massively parallel processor. IEEE Trans. Comput. C-29, 9 (Sept. 1980), 836–840.
4. Bawden, A. A programming language for massively parallel computers. Master’s thesis, Dept. of Electrical Engineering and Computer Science, MIT, Cambridge, Mass., Sept. 1984.
5. Bawden, A. Connection graphs. In Proceedings of the 1986 ACM Conference on Lisp and Functional Programming. ACM. (Cambridge, Mass., Aug. 4–6). New York. 1986, pp. 258–265.
6. Blelloch, G. AFL-I: A programming language for massively concurrent computers. Master’s thesis, Dept. of Electrical Engineering and Computer Science, MIT, Cambridge, Mass., June 1986.
7. Blelloch, G. Parallel prefix versus concurrent memory access. Tech. Rep., Thinking Machines Corp., Cambridge, Mass., 1986.
8. Bouknight, W.J., Denenberg, S.A., Mclntyre, D.E., Randall, J.M., Sameh, A.H., and Slotnick, D.L. The ILLIAC IV system. Proc. IEEE 60, 4 (Apr. 1972), 369–388.
9. Christman, D.P. Programming the Connection Machine. Master’s thesis, Dept. of Electrical Engineering and Computer Science, MIT, Cambridge, Mass., Jan. 1983.
10. Christman, D.P. Programming the Connection Machine. Tech. Rep. ISL-84-3, Xerox Palo Alto Research Center, Palo Alto, Calif., Apr. 1984. (Reprint of the author’s master’s thesis at MIT.)
11. Falkoff, A.D., and Orth, D.L. Development of an APL standard. In APL 79 Conference Proceedings (Rochester, N.Y., June). ACM, New York, pp. 409–453. Published as APL Quote Quad 9, 4 (June 1979).
12. Flanders, P.M., et al. Efficient high speed computing with the distributed array processor. In High Speed Computer and Algorithm Organization, Kuch, Lawrie, and Sameh, Eds. Academic Press, New York, 1977, pp. 113–127.
13. Haynes, L.S., Lau, R.L., Siewiorek, D.P., and Mizell, D.W. A survey of highly parallel computing. Computer (Jan. 1982), 9–24.
14. Hillis, W.D. The Connection Machine. MIT Press, Cambridge, Mass., 1985.
15. Iverson, K.E. A Programming Language. Wiley, New York, 1962.
16. Knuth. D.E. The Art of Computer Programming. Vol. 3. Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.
17. Knuth, D. E. The Art of Computer Programming. Vol. 2, Seminumerical Algorithms [Second Edition). Addison-Wesley, Reading, Mass., 1981.
18. Kung, H.T., and Lieserson, C.E. Algorithms for VLSI processor arrays. In Introduction to VLSI Systems, L. Carver and L. Conway. Eds. Addison-Wesley, New York, 1980. pp. 271–292.
19. Lim, W. Fast algorithms for labeling connected components in 2-D arrays. Tech. Rep. 86.22, Thinking Machines Corp., Cambridge, Mass., July 1986.
20. Minsky, M., and Papert, S. Perceptrons. 2nd ed. MIT Press, Cambridge, Mass., 1979.
21. Pan, V., and Reif, J. Efficient parallel solution of linear systems. Tech. Rep. TR-02-85, Aiken Computation Laboratory, Harvard Univ., Cambridge, Mass., 1985.
22. Schwartz. J.T. Ultracomputers. ACM Trans. Program. Lang. Syst. 2, 4 (Oct. 1980), 484–521.
23. Shaw. D.E. The NON-VON Supercomputer. Tech. Rep., Dept. of Computer Science, Columbia Univ., New York, Aug. 1982.
24. Steele. G.L., Jr., and Hillis. W.D. Connection machine Lisp: Finegrained parallel symbolic processing. In Proceedings of the 1986 ACM Conference on Lisp and Functional Programming (Cambridge, Mass., Aug. 4–6). ACM, New York, 1986. pp. 279–297.
25. Turner. D.A. A new implementation technique for applicative languages. Softw. Pract. Exper. 9 (1979), 31–49.