Status report: The manticore project

ML'07: Proceedings of the 2007 Workshop on ML

Volumn , Issue , 2007, Pages 15-24

  Fluet, Matthew ^a   Ford, Nic ^b   Rainey, Mike ^b   Reppy, John ^b   Shaw, Adam ^b   Xiao, Yingqi ^b  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b UNIVERSITY OF CHICAGO   (United States)

Author keywords

Concurrent languages; Data parallel languages; ML

Indexed keywords

CONCURRENT LANGUAGES; DATA PARALLEL LANGUAGES;

DATA ACQUISITION; MARKUP LANGUAGES; PARALLEL PROGRAMMING; SYSTEMS ANALYSIS;

PROJECT MANAGEMENT;

EID: 38849187765     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1292535.1292539     Document Type: Conference Paper

References (68)

1. Appel, A. W. Simple generational garbage collection and fast allocation. SP&E, 19(2), 1989, pp. 171-183.
2. Appel, A. W. Compiling with Continuations. Cambridge University Press, Cambridge, England, 1992.
3. 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.
4. Blelloch, G. E., S. Chatterjee, L C. Hardwick, L Sipelstein, and M. Zagha. Implementation of a portable nested dataparallel language. JPDC, 21(1), 1994, pp. 4-14.
5. 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.
6. 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.
7. Blumofe, R. D. and C. E. Leiserson. Scheduling multithreaded computations by work stealing. JACM, 46(5), 1999, pp. 720-748.
8. Blelloch, G. E. Programming parallel algorithms. CACM, 39(3), March 1996, pp. 85-97.
9. Bruggeman, C., O. Waddell, and R. K. Dybvig. Representing control in the presence of one-shot continuations. In PLDI •96, New York, NY, May 1996. ACM, pp. 99-107.
10. Callahan, D., B. L. Chamberlain, and H. P. Zima. The Cascade High Productivity Language. In HIPS '04, Los Alamitos, CA, April 2004. IEEE Computer Society Press, pp. 52-60.
11. 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.
12. 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.
13. 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.
14. Carlsson, R., K. Sagonas, and J. Wilhelmsson. Message analysis for concurrent programs using message passing. ACM TOPLAS, 28(4), July 2006, pp. 715-746.
15. Demaine, E. D. Higher-order concurrency in Java. In WoTUG20, April 1997, pp. 34-47. Available from http://theory.csail.mit.edu/~edemaine/papers/ WoTUG20/.
16. Danvy, O. and A. Filinski. Representing control: A study of the CPS transformation. MSCS, 2(4), 1992, pp. 361-391.
17. Doligez, D. and G. Gonthier. Portable, unobtrusive garbage collection for multiprocessor systems. In POPL '94, New York, NY, January 1994. ACM, pp. 70-83.
18. Dean, J. and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In OSDI '04, December 2004, pp. 137-150.
19. Dybvig, R. K. and R. Hieb. Engines from continuations. Comp. Lang., 14(2), 1989, pp. 109-123.
20. Doligez, D. and X. Leroy. A concurrent, generational garbage collector for a multithreaded implementation of ml. In POPL '93, New York, NY, January 1993. ACM, pp. 113-123.
21. Flatt, M. and R. B. Findler. Kill-safe synchronization abstractions. In PLDI '04, June 2004, pp. 47-58.
22. Fisher, K. and J. Reppy. Compiler support for lightweight concurrency. Technical memorandum, Bell Labs, March 2002. Available from http://moby.cs.uchicago.edu/.
23. 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.
24. George, L. and A. Appel. Iterated register coalescing. ACM TOPLAS, 18(3), May 1996, pp. 300-324.
25. 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.
26. George, L., F. Guillame, and J. Reppy. A portable and optimizing back end for the SML/NJ compiler. In CC '94, April 1994, pp. 83-97.
27. Garey, M. R. and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
28. Gansner, E. R. and J. H. Reppy. A Multi-threaded Higher-order User Interface Toolkit, vol. 1 of Software Trends, pp. 61-80. John Wiley & Sons, 1993.
29. Gansner, E. R. and J. H. Reppy (eds.). The Standard ML Basis Library. Cambridge University Press, Cambridge, England, 2004.
30. Hammond, K. Parallel SML: a Functional Language and its Implementation in Dactl. The MIT Press, Cambridge, MA, 1991.
31. Hedqvist, P. A parallel and multithreaded ERLANG implementation. Master's dissertation, Computer Science Department, Uppsala University, Uppsala, Sweden, June 1998.
32. Haynes, C T. and D. P. Friedman. Engines build process abstractions. In LFP '84, New York, NY, August 1984. ACM, pp. 18-24.
33. Haynes, C. T., D. P. Friedman, and M. Wand. Continuations and coroutines. In LFP '84, New York, NY, August 1984. ACM, pp. 293-298.
34. 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.
35. Hofstee, H. P. Cell broadband engine architecture from 20,000 feet. Available at http://www-128.ibm.com/developerworks/power/library/pa-cbea.html, August 2005.
36. 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.
37. Keller, G. Transformation-based Implementation of Nested Data Parallelism for Distributed Memory Machines. Ph.D. dissertation, Technische Universität Berlin, Berlin, Germany, 1999.
38. 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.
39. Leroy, X. The Objective Caml System (release 3.00), April 2000. Available from http://caml.inria.fr.
40. Marlow, S., S. P. Jones, A. Moran, and J. Reppy. Asynchronous exceptions in Haskell. In PLDI '01, June 2001, pp. 274-285.
41. Mohr, E., D. A. Kranz, and R. H. Halstead Jr. Lazy task creation: a technique for increasing the granularity of parallel programs. In LFP '90, New York, NY, June 1990. ACM, pp. 185-197.
42. Nikhil, R. S. and Arvind. Implicit Parallel Programming in pH. Morgan Kaufmann Publishers, San Francisco, CA, 2001.
43. Nikhil, R. S. ID Language Reference Manual. Laboratory for Computer Science, MIT, Cambridge, MA, July 1991.
44. Olukotun, K. and L. Hammond. The future of microprocessors. ACM Queue, 3(7), September 2005. Available from http://www.acmqueue.org.
45. 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.
46. Pettersson, M. A term pattern-match compiler inspired by finite automata theory. In CC '92, vol. 641 of LNCS, New York, NY, October 1992. Springer-Verlag, pp. 258-270.
47. Peyton Jones, S., A. Tolmach, and T. Hoare. Playing by the rules: Rewriting as a practical optimization technique in GHC In Proceedings of the 2001 Haskell Workshop, September 2001, pp. 203-233.
48. Rainey, M. The Manticore runtime model. Master's dissertation, University of Chicago, January 2007. Available from http://manticore.cs.uchicago.edu.
49. Ramsey, N. Concurrent programming in ML. Technical Report CS-TR-262-90, Dept. of CS., Princeton University, April 1990.
50. Reeves, W T. Particle systems - a technique for modeling a class of fuzzy objects. ACM TOG, 2(2), 1983, pp. 91-108.
51. Reppy, J. H. First-class synchronous operations in Standard ML. Technical Report TR 89-1068, Dept. of CS, Cornell University, December 1989.
52. Reppy, J. H. Asynchronous signals in Standard ML. Technical Report TR 90-1144, Dept. of CS, Cornell University, Ithaca, NY, August 1990.
53. Reppy, J. H. CML: A higher-order concurrent language. In PLDI '91, New York, NY, June 1991. ACM, pp. 293-305.
54. Reppy, J. H. Concurrent Programming in ML. Cambridge University Press, Cambridge, England, 1999.
55. Reppy, J. Optimizing nested loops using local CPS conversion. HOSC, 15, 2002, pp. 161-180.
56. Rossberg, A. HaMLet. Available from http://www.ps.uni-sb.de/hamlet.
57. Ramsey, N. and S. Peyton Jones. Featherweight concurrency in a portable assembly language. Unpublished paper available at http://www.cminusminus.org/ abstracts/c-con.html, November2000.
58. Russell, G. Events in Haskell, and how to implement them. In ICFP '01, September 2001, pp. 157-168.
59. Reppy, J. and Y Xiao. Specialization of CML messagepassing primitives. In POPL '07, New York, NY, January 2007. ACM, pp. 315-326.
60. Shao, Z. and A. W. Appel. Efficient and safe-for-space closure conversion. ACM TOPLAS, 22(1), 2000, pp. 129-161.
61. Shivers, O., J. W. Clark, and R. McGrath. Atomic heap transactions and fine-grain interrupts. In ICFP '99, New York, NY, September 1999. ACM, pp. 48-59.
62. Shaw, A. Data parallelism in Manticore. Master's dissertation, University of Chicago, July 2007. Available from http://manticore.es.uchicago.edu.
63. Shivers, O. Continuations and threads: Expressing machine concurrency directly in advanced languages. In CW '97, New York, NY, January 1997. ACM.
64. Steele Jr., G. L. Parallel programming and code selection in Fortress. In PPoPP '06, New York, NY, March 2006. ACM, p. 1. Keynote talk; slides available from http://research.sun.com/projects/plrg/CGOPPoPP2006public.pdf.
65. Vandevoorde, M. T. and E. S. Roberts. Workcrews: an abstraction for controlling parallelism. IJPP, 17(4), August 1988, pp. 347-366.
66. Wand, M. Continuation-based multiprocessing. In LFP '80, New York, NY, August 1980. ACM, pp. 19-28.
67. Young, C., L. YN, T. Szymanski, J. Reppy, R. Pike, G. Narlikar, S. Mullender, and E. Grosse. Protium, an infrastructure for partitioned applications. In HotOS-X, January 2001, pp. 41-46.
68. Ziarek, L., P. Schatz, and S. Jagannathan. Stabilizers: a modular checkpointing abstraction for concurrent functional programs. In ICFP '06, New York, NY, September 2006. ACM, pp. 136-147.