A provable time and space efficient implementation of NESL

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 31, Issue 6, 1996, Pages 213-225

  Blelloch, Guy E ^a   Greiner, John ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17144377502     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/232629.232650     Document Type: Article

References (33)

1. G. Blelloch, G. L. Miller, and D. Talmor. Developing a practical projection-based parallel Delaunay algorithm. In Proceedings ACM Symposium on Computational Geometry, May 1996.
2. Guy Blelloch, Phil Gibbons, and Yossi Matias. Provably efficient scheduling for languages with fine-grained parallelism. In ACM Symposium on Parallel Algorithms and Architectures, July 1995.
3. Guy Blelloch and John Greiner. Parallelism in sequential functional languages. In Proceedings 7th International Conference on Functional Programming Languages and Computer Architecture, pages 226-237, June 1995.
4. Guy Blelloch and Girija Narlikar. A comparison of two n-body algorithms. In Dimacs implementation challenge workshop, October 1994.
5. Guy E. Blelloch. Vector Models for Data-Parallel Computing. MIT Press, 1990.
6. Guy E. Blelloch. NESL: A nested data-parallel language (version 3.1). Technical Report CMU-CS-95-170, Carnegie Mellon University, 1995.
7. Guy E. Blelloch. Programming parallel algorithms. Communications of the ACM, March 1996.
8. Guy E. Blelloch, Siddhartha Chatterjee, Jonathan C. Hardwick, Jay Sipelstein, and Marco Zagha. Implementation of a portable nested data-parallel language. Journal of Parallel and Distributed Computing, 21(1):4-14, April 1994.
9. Guy E. Blelloch and Jonathan C. Hardwick. Class notes: Programming parallel algorithms. Technical Report CMU-CS-93-115, Carnegie Mellon University, February 1993.
10. R. D. Blumofe and C. E. Leiserson. Space-efficient scheduling of multithreaded computations. In Proc. 25th ACM Symp. on Theory of Computing, pages 362-371, May 1993.
11. F. Warren Burton. Storage management in virtual tree machines. IEEE Trans, on Computers, 37(3):321-328, 1988.
12. F. Warren Burton and David J. Simpson. Space efficient execution of deterministic parallel programs. Manuscript, December 1994.
13. Matthias Felleisen and Daniel P. Friedman. A calculus for assignments in higher-order languages. In Proceedings 13th ACM Symposium on Principles of Programming Languages, pages 314-325, January 1987.
14. Cormac Flanagan and Mattias Felleisen. The semantics of future and its use in program optimization. In Proceedings 22nd ACM Symposium on Principles of Programming Languages, pages 209-220, 1995.
15. Joseph Gil and Yossi Matias. Fast and efficient simulations among CRCW PRAMs. Journal of Parallel and Distributed Computing, 23(2):135-148, November 1994.
16. Allan Gottlieb, B. D. Lubachevsky, and Larry Rudolph. Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors. ACM Transactions on Programming Languages and Systems, 5(2), April 1983.
17. John Greiner. A comparison of parallel algorithms for connected components. In Proceedings 6th ACM Symposium on Parallel Algorithms and Architectures, pages 16-25, June 1994.
18. John Greiner and Guy E. Blelloch. A provably time-efficient parallel implementation of full speculation. In Proceedings 23rd ACM Symposium on Principles of Programming Languages, pages 309-321, January 1996.
19. High Performance Fortran Forum. High Performance Fortran Language Specification, May 1993.
20. Paul Hudak. A semantic model of reference counting and its abstraction (detailed summary). In Proceedings ACM Conference on LISP and Functional Programming, pages 351-363, August 1986.
21. Paul Hudak and Steve Anderson. Pomset interpretations of parallel functional programs. In Proceedings 3rd International Conference on Functional Programming Languages and Computer Architecture, number 274 in Lecture Notes in Computer Science, pages 234-256. Springer-Verlag, September 1987.
22. Joseph JáJá. An Introduction to Parallel Algorithms. Addison-Wesley, Reading, Mass., 1992.
23. R. M. Karp and V. Ramachandran. Parallel algorithms for shared memory machines. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science - Volume A: Algorithms and Complexity. MIT Press, Cambridge, Mass., 1990.
24. Yossi Matias and Uzi Vishkin. On parallel hashing and integer sorting. Journal of Algorithms, 12(4):573-606, 1991.
25. Greg Morrisett, Matthias Felleisen, and Robert Harper. Abstract models of memory management. In Proceedings of the Symposium on Functional Programming and Computer Architecture, pages 66-77, June 1995.
26. Abhiram G. Ranade. Fluent Parallel Computation. PhD thesis, Yale University, New Haven, CT, 1989.
27. Paul Roe. Parallel Programming using Functional Languages. PhD thesis, Department of Computing Science, University of Glasgow, February 1991.
28. J. R. Rose and G. L. Steele Jr. C*: An extended C language for data parallel programming. In Proceedings Second International Conference on Supercomputing, Vol. 2, pages 2-16, May 1987.
29. Mads Rosendahl. Automatic complexity analysis. In Proceedings 4th International Conference on Functional Programming Languages and Computer Architecture. Springer-Verlag, September 1989.
30. David Sands. Calculi for Time Analysis of Functional Programs. PhD thesis, University of London, Imperial College, September 1990.
31. David B. Skillicorn and W. Cai. A cost calculus for parallel functional programming. Journal of Parallel and Distributed Computing, 28(1):65-83, July 1995.
32. Dan Suciu and Val Tannen. Efficient compilation of high-level data parallel algorithms. In Proceedings 6th ACM Symposium on Parallel Algorithms and Architectures, pages 57-66, June 1994.
33. Wolf Zimmermann. Complexity issues in the design of functional languages with explicit parallelism. In Proceedings International Conference on Computer Languages, pages 34-43, 1992.