Manticore: A heterogeneous parallel language

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2007, Pages 37-44

  Fluet, Matthew ^a   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

[No Author keywords available]

Indexed keywords

FUNCTIONAL LANGUAGE; MANTICORE; PARALLEL LANGUAGE; RUNTIME MODELS;

CONCURRENCY CONTROL; DATA STRUCTURES; FUNCTIONAL PROGRAMMING; SCHEDULING; SOFTWARE DESIGN; SOFTWARE PROTOTYPING;

PARALLEL PROGRAMMING;

EID: 35348874231     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1248648.1248656     Document Type: Conference Paper

References (53)

1. Anderson, T. E., B. N. Bershad, E. D. Lazowska, and H. M. Levy. Scheduler activations: Effective kernel support for the user-level management of parallelism. ACM TOCS, 10(1), February 1992, pp. 53-79.
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, J. C. Hardwick, J. Sipelstein, and M. Zagha. Implementation of a portable nested data-parallel language. JPDC, 21(1), 1994, p. 4=14.
5. 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.
6. Blumofe, R. D. and C. E. Leiserson. Scheduling multithreaded computations by work stealing. JACM, 46(5), 1999, pp. 720-748.
7. Blelloch, G. E. Programming parallel algorithms. CACM, 39(3), March 1996, pp. 85-97.
8. 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.
9. Carlisle, M., L. J. Hendren, A. Rogers, and J. Reppy. Supporting SPMD execution for dynamic data structures. ACM TOPLAS, 17(2), March 1995, pp. 233-263.
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. Carlisle, M. C. and A. Rogers. Software caching and computation migration in Olden. In PPoPP '95, New York, NY, July 1995. ACM, pp. 29-38.
13. 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/.
14. Dean, J. and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In OSDI '04, December 2004, pp. 137-150.
15. Dybvig, R. K. and R. Hieb. Engines from continuations. Comput. Lang., 14(2), 1989, pp. 109-123.
16. Flatt, M. and R. B. Findler. Kill-safe synchronization abstractions. In PLDI '04, June 2004. (to appear).
17. Fisher, K. and J. Reppy. Compiler support for lightweight concurrency. Technical memorandum, Bell Labs, March 2002. Available from http://moby.es.uchicago.edu/.
18. George, L. and A. Appel. Iterated register coalescing. ACM TOPLAS, 18(3), May 1996, pp. 300-324.
19. 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.
20. 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.
21. 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.
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. Haynes, C. T. and D. P. Friedman. Engines build process abstractions. In LFP'84, New York, NY, August 1984. ACM, pp. 18-24.
25. Haynes, C. T., D. P. Friedman, and M. Wand. Continuations and coroutines. In LFP'84, New York, NY, August 1984. ACM, pp. 293-298.
26. 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.
27. 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.
28. Kurt Debattista, Kevin Vella, J. C. Wait-free cache-affinity thread scheduling. IEEE Proceedings Software, 150(2), 2003, pp. 137-146.
29. 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.
30. Leroy, X. The Objective Caml System (release 3.00), April 2000. Available from http://caml.inria.fr.
31. Marlow, S., S. P. Jones, A. Moran, and J. Reppy. Asynchronous exceptions in Haskell. In PLDI '01, June 2001, pp. 274-285.
32. 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.
33. Muller, G., J. L. Lawall, and H. Duchesne. A framework for simplifying the development of kernel schedulers: Design and performance evaluation. In HASE '05, October 2005, pp. 56-65.
34. Nikhil, R. S. and Arvind. Implicit Parallel Programming in pH. Morgan Kaufmann Publishers, San Francisco, CA, 2001.
35. Nikhil, R. S. ID Language Reference Manual. Laboratory for Computer Science, MIT, Cambridge, MA, July 1991.
36. Rainey, M. The Manticore runtime model. Master's dissertation, University of Chicago, January 2007. Available from http://manticore.es.uchicago.edu.
37. Reeves, W. T. Particle systems - a technique for modeling a class of fuzzy objects. ACM TOG, 2(2), 1983, pp. 91-108.
38. Regehr, J. Using Hierarchical Scheduling to Support Soft Real-Time Applications on General-Purpose Operating Systems. Ph.D. dissertation, University of Virginia, 2001.
39. Reppy, J. H. First-class synchronous operations in Standard ML. Technical Report TR 89-1068, Dept. of CS, Cornell University, December 1989.
40. Reppy, J. H. CML: A higher-order concurrent language. In PLDI "91, June 1991, pp. 293-305.
41. Reppy, J. H. Concurrent Programming in ML. Cambridge University Press, Cambridge, England, 1999.
42. Reynolds, J. C. The discoveries of continuations. LASC, 6(3-4), 1993, pp. 233-248.
43. Rossberg, A. HaMLet. Available from http://www.ps.uni-sb.de/hamlet.
44. 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, November 2000.
45. Russell, G. Events in Haskell, and how to implement them. In ICFP '01, September 2001, pp. 157-168.
46. Reppy, J. and Y. Xiao. Specialization of CML message-passing primitives. In POPL '07, January 2007.
47. Shivers, O. Continuations and threads: Expressing machine concurrency directly in advanced languages. In CW '97, January 1997.
48. Shavit, N. and D. Touitou. Software transactional memory. In PODC '95, New York, NY, 1995. ACM, pp. 204-213.
49. Vandevoorde, M. T. and E. S. Roberts. Workcrews: an abstraction for controlling parallelism. IJPP, 17(4), August 1988, pp. 347-366.
50. Wand, M. Continuation-based multiprocessing. In LISP'80, August. 1980, pp. 19-28.
51. Xiao, Y. Toward optimization of Concurrent ML. Master's dissertation, University of Chicago, December 2005.
52. 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.
53. 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.