Feedback directed implicit parallelism

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2007, Pages 251-264

  Harris, Tim ^a   Singh, Satnam ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Functional programming; Haskell; Implicit parallelism

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; FUNCTIONAL PROGRAMMING; OPTIMIZATION; STORAGE ALLOCATION (COMPUTER); SYNCHRONIZATION;

HASKELL; IMPLICIT PARALLELISM; PARALLELIZATION;

PROGRAM PROCESSORS;

EID: 38849195471     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1291151.1291192     Document Type: Conference Paper

References (19)

1. Arvind, David E. Culler, and Gino K. Maa. Assessing the benefits of fine-grained parallelism in dataflow programs. Technical Report 279, Computation Structures Group, MIT, March. 1988.
2. K. E. Batcher. Sorting networks and their applications. In Proceedings of the AFIPS Spring Joint Computing Conference, 1969.
3. R. Blumofe and C. Leiserson. Scheduling multithreaded computations by work stealing. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico., pages 356-368, November 1994.
4. Robert Ennals. Adaptive Evaluation of Non-Strict Programs. PhD thesis, Cambridge University Computer Laboratory, 2004.
5. Robert Ennals and Simon Peyton Jones. Optimistic evaluation: an adaptive evaluation strategy for non-strict programs. In ICFP '03: Pmceedings of the eighth ACM SIGPLAN international conference on Functional programming, pages 287-298. ISBN 1-58113-756-7.
6. Kevin Hammond. Parallel functional programming: An introduction. In International Symposium on Parallel Symbolic Computation, Hagenberg/Linz, Austria, September 1994.
7. Tim Harris. Dynamic adaptive pre-tenuring. In International Symposium on Memory Management (ISMM '00), volume 36(1) of ACM SIGPLAN Notices, pages 127-136, January 2001.
8. Tim Harris, Simon Marlow, and Simon Peyton Jones. Haskell on a shared-memory multiprocessor. In Haskell '05: Proceedings of the 2005 ACM SIGPLAN workshop on Haskell, pages 49-61, September 2005.
9. Danny Hendler, Yossi Lev, Mark Moir, and Nir Shavit. A dynamic-sized nonblocking work stealing deque. Technical Report TR-2005-144, Sun Microsystems Laboratories, 2005.
10. Raj Jain. The art of computer systems performance analysis. Wiley, 1991.
11. H-W. Loidl. Granularity in Large-Scale Parallel Functional Programming. PhD thesis, Department of Computing Science, University of Glasgow, March 1998.
12. James Stewart Mattson. An effective speculative evaluation technique for pamllel supercombinator graph reduction. PhD thesis, University of California at San Diego.
13. Rishiyur S Nikhil and Arvind. Implicit Parallel Programming in pH. Morgan Kaufman, 2001.
14. Randy B. Osborne. Speculative computation in multilisp. In LFP '90: Pmceedings of the 1990 ACM conference on LISP and functional programming, pages 198-208. ISBN 0-89791-368-X.
15. Simon Peyton Jones, Andrew Gordon, and Sigbjorn Finne. Concurrent haskell. In POPL '96: Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 295-308, New York, NY, USA, 1996.' ISBN 0-89791-769-3.
16. Paul Roe. Parallel Programming Using Functional Languages. PhD thesis, Department of Computing Science, University of Glasgow, 1991.
17. Kenneth R. Traub. Implementation of non-strict functioned programming languages. MIT Press, Cambridge, MA, USA, 1991. ISBN 0-262-70042-5.
18. Kenneth R. Traub, Gregory M. Papadopoulos, Michael J. Beckerle, James E. Hicks, and Jonathan Young. Overview of the Monsoon project. In ICCD '91: Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors, pages 150-155. ISBN 0-8186-2270-9.
19. P. W. Trinder, K. Hammond, H.-W. Loidl, and S. L. Peyton Jones. Algorithm + strategy = parallelism. J. Funct. Program., 8(1):23-60, 1998. ISSN 0956-7968.