A provably time-efficient parallel implementation of full speculation

ACM Transactions on Programming Languages and Systems

Volumn 21, Issue 2, 1999, Pages 240-285

  Greiner, John ^a   Blelloch, Guy E ^b  

^a Rice University   (United States)

^b Carnegie Mellon University   (United States)

Author keywords

Abstract machines; Parallel languages; Profiling semantics; Speculation; Threads

Indexed keywords

ABSTRACT MACHINES; DIRECTED ACYCLIC GRAPH (DAG);

ABSTRACTING; COMPUTER PROGRAMMING LANGUAGES; COSTS; DATA FLOW ANALYSIS; GRAPH THEORY; PROGRAMMING THEORY; SEMANTICS;

PARALLEL PROCESSING SYSTEMS;

EID: 0041412807     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/316686.316690     Document Type: Article

References (51)

1. BAKER, JR., H. G. AND HEWITT, C. 1977. The incremental garbage collection of processes. In Proceedings of Symposium on AI and Programming Languages. SIGPLAN Notices, vol. 12. 55-59.
2. BLELLOCH, G., GIDDONS, P., AND MATIAS, Y. 1995. Provably efficient scheduling for languages with fine-grained parallelism. In ACM Symposium on Parallel Algorithms and Architectures. 1-12.
3. BLELLOCH, G. AND GREINER, J. 1995. Parallelism in sequential functional languages. In Proceedings 7th International Conference on Functional Programming Languages and Computer Architecture. 226-237.
4. BLELLOCH, G. AND REID-MILLER, M. 1997. Pipelining with futures. In Proceedings 9th ACM Symposium on Parallel Algorithms and Architectures. 249-259.
5. BLELLOCH, G. E. 1992. NESL: A nested data-parallel language. Tech. Rep. CMU-CS-92-103, Carnegie Mellon University. Jan.
6. BLELLOCH, G. E. AND GREINER, J. 1996. A provable time and space efficient implementation of NESL. In ACM SIGPLAN International Conference on Functional Programming. 213-225.
7. BLUMOFE, R. D., JOERG, C. F., KUSZMAUL, B. C., LEISERSON, C. E., RANDALL, K. H., AND ZHOU, Y. 1995. Cilk: An efficient multithreaded runtime system. In Proceedings 5th ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming. Santa Barbara, CA, 207-216.
8. BLUMOFE, R. D. AND LEISERSON, C. E. 1993. Space-efficient scheduling of multithreaded computations. In Proceedings 25th ACM Symposium on Theory of Computing. 362-371.
9. CALLAHAN, D. AND SMITH, B. 1990. A future-based parallel language for a general-purpose highly-parallel computer. In Languages and Compilers for Parallel Computing, D. Galernter, A. Nicolau, and D. Padua, Eds. Research Monographs in Parallel and Distributed Computing. MIT Press, Chapter 6, 95-113.
10. CHANDRA, R., GUPTA, A., AND HENNESSY, J. L. 1990. COOL: a language for parallel programming. In Languages and Compilers for Parallel Computing, D. Gelernter, A. Nicolau, and D. Padua, Eds. Research Monographs in Parallel and Distributed Computing. MIT Press, Chapter 8, 126-148.
11. FEELEY, M. 1993. An efficient and general implementation of futures on large scale shared-memory multiprocessors. Ph.D. thesis, Brandeis University.
12. FELLEISEN, M. AND FRIEDMAN, D. P. 1987. A calculus for assignments in higher-order languages. In Proceedings 13th ACM Symposium on Principles of Programming Languages. 314-325.
13. FLANAGAN, C. AND FELLEISEN, M. 1995. The semantics of future and its use in program optimization. In Proceedings 22nd ACM Symposium on Principles of Programming Languages. 209-220.
14. GIL, J. AND MATIAS, Y. 1994. Fast and efficient simulations among CRCW PRAMs. Journal of Parallel and Distributed Computing 23, 2 (Nov.), 135-148.
15. GOLDMAN, R. AND GABRIEL, R. P. 1988. Qlisp: Experience and new directions. In Proceedings ACM SIGPLAN Symposium on Parallel Programming: Experience with Applications, Languages and Systems. 111-123.
16. GOTTLIEB, A., LUDACHEVSKY, B. D., AND RUDOLPH, L. 1983. Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors. ACM Trans. Program. Lang. Syst. 5, 2 (Apr.).
17. GREINER, J. 1997. Semantics-based parallel cost models and their use in provably efficient implementations. Ph.D. thesis, Carnegie Mellon University.
18. GREINER, J. AND BLELLOCH, G. E. 1996. A provably time-efficient parallel implementation of full speculation. In Proceedings 23rd ACM Symposium on Principles of Programming Languages. 309-321.
19. GRIT, D. H. AND PAGE, R. L. 1981. Deleting irrelevant tasks in an expression-oriented multiprocessor system. ACM Trans. Program. Lang. Syst. 3, 1 (Jan.), 49-59.
20. HALSTEAD, JR., R. H. 1985. Multilisp: A language for concurrent symbolic computation. ACM Trans. Program. Lang. Syst. 7, 4 (Oct.), 501-538.
21. HALSTEAD, JR., R. H. 1989. New ideas in Parallel Lisp: Language design, implementation, and programming tools. In Parallel Lisp: Languages and Systems, US/Japan Workshop on Parallel Lisp, T. Ito and R. H. Halstead, Jr., Eds. Number 441 in Lecture Notes in Computer Science. Springer-Verlag, 2-51.
22. HUDAK, P. AND ANDERSON, S. 1987. 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. Springer-Verlag, 234-256.
23. HUDAK, P. AND KELLER, R. M. 1982. Garbage collection and task deletion in distributed applicative processing systems. In Proceedings ACM Conference on LISP and Functional Programming. 168-178.
24. HUDAK, P. AND MOHR, E. 1988. Graphinators and the duality of SIMD and MIMD. In Proceedings ACM Conference on LISP and Functional Programming. 224-234.
25. ITO, T. AND MATSUI, M. 1989. A parallel lisp language PaiLisp and its kernal specification. In Parallel Lisp: Languages and Systems, US/Japan Workshop on Parallel Lisp, T. Ito and R. H. Halstead, Jr., Eds. Number 441 in Lecture Notes in Computer Science. Springer-Verlag, 58-100.
26. JOY, M. AND AXFORD, T. 1992. Parallel combinator reduction: Some performance bounds. Tech. Rep. RR210, University of Warwick.
27. KENNAWAY, R. 1994. A conflict between call-by-need computation and parallelism (extended abstract). In Proceedings Conditional Term Rewriting Systems-94. 247-261.
28. KRANZ, D. A., HALSTEAD, JR., R. H., AND MOHR, E. 1989. Mul-T: A high-performance parallel lisp. In Proceedings ACM SIGPLAN Conference on Programming Language Design and Implementation. 81-90.
29. LANDIN, P. J. 1964. The mechanical evaluation of expressions. The Computer Journal 6, 308-320.
30. MATIAS, Y. AND VISHKIN, U. 1991. On parallel hashing and integer sorting. Journal of Algorithms 12, 4 (Dec.), 573-606.
31. MATIAS, Y. AND VISHKIN, U. 1995. A note on reducing parallel model simulations to integer sorting. In Proceedings 9th International Parallel Processing Symposium. 208-212.
32. MILLER, J. S. 1987. MultiScheme: A parallel processing system based on MIT Scheme. Ph.D. thesis, Massachusetts Institute of Technology.
33. MOREAU, L. 1994. The PCKS-machine. an abstract machine for sound evaluation of parallel functional programs with first-class continuations. In European Symposium on Programming. Number 788 in Lecture Notes in Computer Science. Springer-Verlag, 424-438.
34. MOREAU, L. 1995. The semantics of Scheme with future. Tech. Rep. M95/7, Department of Electronics and Computer Science, University of Southampton.
35. MOREAU, L. 1996. The semantics of Scheme with future. In Proceedings 1st ACM SIGPLAN International Conference on Functional Programming. 146-156.
36. NIKHIL, R. S. 1990. The parallel programming language Id and its compilation for parallel machines. Tech. Rep. Computation Structures Group Memo 313, Massachusetts Institute of Technology. July.
37. NIKHIL, R. S. 1991. Id version 90.1 reference manual. Tech. Rep. Computation Structures Group Memo 284-1, Laboratory for Computer Science, Massachusetts Institute of Technology. July.
38. NIKHIL, R. S., ARVIND, HICKS, J., ADITYA, S., AUGUSTSSON, L., MAESSEN, J.-W., AND ZHOU, Y. 1995. pH language reference manual, version 1.0 - preliminary. Tech. Rep. Computation Structures Group Memo 369, Laboratory for Computer Science, Massachusetts Institute of Technology. Jan.
39. OSBORNE, R. B. 1989. Speculative computation in Multilisp. Ph.D. thesis, Massachusetts Institute of Technology.
40. PARIGOT, M. 1988. Programming with proofs: A second order type theory. In Proceedings 2nd European Symposium on Programming, H. Ganzinger, Ed. Lecture Notes in Computer Science, vol. 300. Springer-Verlag, 145-159.
41. PARTRIDGE, A. S. 1991. Speculative evaluation in parallel implementations of lazy functional languages. Ph.D. thesis, Department of Computer Science, University of Tasmania.
42. PARTRIDGE, A. S. AND DEKKER, A. H. 1989. Speculative parallelism in a distributed graph reduction machine. In Proceedings Hawaii International Conference on System Sciences. Vol. 2. 771-779.
43. PEYTON JONES, S. L. 1989. Parallel implementations of functional programming languages. The Computer Journal 32, 2, 175-186.
44. PLOTKIN, G. D. 1974. Call-by-name, call-by-value and the λ-calculus. Theor. Comput. Sci. 1.
45. RANADE, A. G. 1989. Fluent parallel computation. Ph.D. thesis, Yale University, New Haven, CT.
46. ROE, P. 1990. Calculating lenient programs' performance. In Proceedings Functional Programming, Glasgow 1990, S. L. Peyton Jones, G. Hutton, and C. K. Holst, Eds. Workshops in computing. Springer-Verlag, 227-236.
47. ROE, P. 1991. Parallel programming using functional languages. Ph.D. thesis, Department of Computing Science, University of Glasgow.
48. ROSENDAHL, M. 1989. Automatic complexity analysis. In Proceedings 4th International Conference on Functional Programming Languages and Computer Architecture. Springer-Verlag.
49. SANDS, D. 1990. Calculi for time analysis of functional programs. Ph.D. thesis, University of London, Imperial College.
50. TRAUB, K. R. 1988. Sequential implementation of lenient programming languages. Ph.D. thesis, Massachusetts Institute of Technology.
51. TREMBLAY, G. AND GAO, G. R. 1995. The impact of laziness on parallelism and the limits of strictness analysis. In Proceedings High Performance Functional Computing, A. P. W. Bohm and J. T. Feo, Eds. 119-133.