Implicitly-threaded parallelism in Manticore

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

Volumn , Issue , 2008, Pages 119-130

  Fluet, Matthew ^a   Rainey, Mike ^b   Reppy, John ^b   Shaw, Adam ^b  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b UNIVERSITY OF CHICAGO   (United States)

Author keywords

Data parallelism; Exceptions; Implicitly threaded parallelism; Parallel binding; Parallel case

Indexed keywords

DATA PARALLELISM; EXCEPTIONS; IMPLICITLY-THREADED PARALLELISM; PARALLEL BINDING; PARALLEL CASE;

APPLICATIONS; AVAILABILITY; BINDING ENERGY; COMPUTER PROGRAMMING; COMPUTER SYSTEMS PROGRAMMING; DESIGN; FOURIER TRANSFORMS; FUNCTIONAL PROGRAMMING; HIGH LEVEL LANGUAGES; LINGUISTICS; PARALLEL PROCESSING SYSTEMS; PROGRAM COMPILERS; PROGRAMMING THEORY; QUERY LANGUAGES;

PARALLEL PROGRAMMING;

EID: 59249097205     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1411204.1411224     Document Type: Conference Paper

References (43)

1. Arvind, R. S. Nikhil, and K. K. Pingali. I-structures: Data structures for parallel computing. ACM TOPLAS, 11(4), October 1989, pp. 598-632.
2. Armstrong, J., R. Virding, C. Wikström, and M. Williams. Concurrent programming in ERLANG (2nd ed.). Prentice Hall International (UK) Ltd., Hertfordshire, UK, UK, 1996.
3. Boehm, H.-J., R. Atkinson, and M. Plass. Ropes: an alternative to strings. Software - Practice &Experience, 25(12), 1995, pp. 1315-1330.
4. Barton, R., D. Adkins, H. Prokop, M. Frigo, C. Joerg, M. Renard, D. Dailey, and C. Leiserson. Cilk Pousse, 1998. Viewed on March 20, 2008 at 2:45 PM.
5. Blelloch, G. E., S. Chatterjee, J. C. Hardwick, J. Sipelstein, and M. Zagha. Implementation of a portable nested data-parallel language. JPDC, 21(1), 1994, pp. 4-14.
6. Buck, I., T. Foley, D. Horn, J. Sugerman, K. Fatahalian, M. Houston, and P. Hanrahan. Brook for GPUs: stream computing on graphics hardware. SIGGRAPH '04, 23(3), July 2004, pp. 777-786.
7. Blelloch, G. E. and J. Greiner. A provable time and space efficient implementation of NESL. In ICFP '96, New York, NY, May 1996. ACM, pp. 213-225.
8. Blumofe, R. D., C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: an efficient multithreaded runtime system. SIGPLAN Not., 30(8), 1995, pp. 207-216.
9. Blelloch, G. E. Programming parallel algorithms. CACM, 39(3), March 1996, pp. 85-97.
10. Chakravarty, M. M. T. and G. Keller. More types for nested data parallel programming. In ICFP '00, New York, NY, September 2000. ACM, pp. 94-105.
11. Chakravarty, M. M. T., G. Keller, R. Leshchinskiy, and W. Pfannenstiel. Nepal - Nested Data Parallelism in Haskell. In Euro-Par '01, vol. 2150 of LNCS, New York, NY, August 2001. Springer-Verlag, pp. 524-534.
12. Chakravarty, M. M. T., R. Leschchinski, S. Peyton Jones, G. Keller, and S. Marlow. Data Parallel Haskell: A status report. In DAMP '07, New York, NY, January 2007. ACM, pp. 10-18.
13. Dean, J. and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In OSDI '04, December 2004, pp. 137-150.
14. Dailey, D. and C. E. Leiserson. Using Cilk to write multiprocessor chess programs. The Journal of the International Computer Chess Association, 2002.
15. Fluet, M., N. Ford, M. Rainey, J. Reppy, A. Shaw, and Y Xiao. Status report: The Manticore project. In ML '07, New York, NY, October 2007. ACM, pp. 15-24.
16. Fluet, M., M. Rainey, J. Reppy, A. Shaw, and Y. Xiao. Manticore: A heterogeneous parallel language. In DAMP '07, New York, NY, January 2007. ACM, pp. 37-44.
17. Fluet, M., M. Rainey, and J. Reppy. A scheduling framework for general-purpose parallel, languages. In ICFP '08, New York, NY, September 2008. ACM.
18. Gaudiot, J.-L., T. DeBoni, J. Feo, W. Bohm, W. Najjar, and P. Miller. The Sisal model of functional programming and its implementation.. In pAs '97, Los Alamitos, CA, March 1997. IEEE Computer Society Press, pp. 112-123.
19. GHC. The Glasgow Haskell Compiler. Available from http://www.haske11.org/ ghc.
20. Gansner, E. R. and J. H. Reppy (eds.). The Standard ML Basis Library. Cambridge University Press, Cambridge, England, 2004.
21. Halstead Jr., R. H. Implementation of multilisp: Lisp on a multiprocessor. In LFP '84, New York, NY, August 1984. ACM, pp. 9-17.
22. Hammond, K. Parallel SML: a Functional Language and its Implementation in Dactl. The MIT Press, Cambridge, MA, 1991.
23. Hedqvist, P. A parallel and multithreaded ERLANG implementation. Master's dissertation, Computer Science Department, Uppsala University, Uppsala, Sweden, June 1998.
24. Hauser, C., C. Jacobi, M. Theimer, B. Welch, and M. Weiser. Using threads in interactive systems: A case study. In SOSP '93, December 1993, pp. 94-105.
25. Harris, T., S. Marlow, S. Peyton Jones, and M. Herlihy. Composable memory transactions. In PPoPP '05, New York, NY, June 2005. ACM, pp. 48-60.
26. Jones, M. P. and P. Hudak. Implicit and explicit parallel programming in Haskell. Technical Report Research Report YALEU/DCS/RR-982, Yale University, August 1993.
27. Leshchinskiy, R., M. M. T. Chakravarty, and G. Keller. Higher order flattening. In V. Alexandrov, D. van Albada, P. Sloot, and J. Dongarra (eds.), ICCS '06, number 3992 in LNCS, New York, NY, May 2006. Springer-Verlag, pp. 920-928.
28. Leroy, X. and F. Pessaux. Type-based analysis of uncaught exceptions. ACM Trans. Program. Lang. Syst., 22(2), 2000, pp. 340-377.
29. Luckham, D. Programming with Specifications. Texts and Monographs in Computer Science. Springer-Verlag, 1990.
30. Nikhil, R. S. and Arvind. Implicit Parallel Programming in pH. Morgan Kaufmann Publishers, San Francisco, CA, 2001.
31. Nikhil, R. S. ID Language Reference Manual. Laboratory for Computer Science, MIT, Cambridge, MA, July 1991.
32. Parnas, D. L. A technique for software module specification with examples. CACM, 15(5), May 1972, pp. 330-336.
33. Pike, R., S. Dorward, R. Griesemer, and S. Quinlan. Interpreting the data: Parallel analysis with sawzall. Scientific Programming Journal, 13(4), 2005, pp. 227-298.
34. Peyton Jones, S., A. Gordon, and S. Finne. Concurrent Haskell. In POPL '96, New York, NY, January 1996. ACM, pp. 295-308.
35. Peyton Jones, S., A. Reid, F. Henderson, T. Hoare, and S. Marlow. A semantics for imprecise exceptions. In PLDI '99, New York, NY, May 1999. ACM, pp. 25-36.
36. Rainey, M. The Manticore runtime model. Master's dissertation, University of Chicago, January 2007. Available from http://manticore.cs.uchicago.edu.
37. Reppy, J. H. CML: A higher-order concurrent language. In PLDI '91, New York, NY, June 1991. ACM, pp. 293-305.
38. Reppy, J. H. Concurrent Programming in ML. Cambridge University Press, Cambridge, England, 1999.
39. Reppy, J. and Y. Xiao. Toward a parallel implementation of Concurrent ML. In DAMP '08, New York, NY, January 2008. ACM.
40. Shaw, A. Data parallelism in Manticore. Master's dissertation, University of Chicago, July 2007. Available from http://manticore.es.uchicago.edu.
41. Trinder, P. W., K. Hammond, H.-W. Loidl, and S. L. Peyton Jones. Algorithm + strategy = parallelism. JFP, 8(1), January 1998, pp. 23-60.
42. Tarditi, D., S. Puri, and J. Oglesby. Accelerator: using data parallelism to program, gpus for general-purpose uses. SIGOPS Oper. Syst. Rev., 40(5), 2006, pp. 325-335.
43. Yi, K. An abstract interpretation for estimating uncaught exceptions in standard ml programs. Sci. Comput. Program., 31(1), 1998, pp. 147-173.