Composing parallel software efficiently with lithe

ACM SIGPLAN Notices

Volumn 45, Issue 6, 2010, Pages 376-387

  Pan, Heidi ^a   Hindman, Benjamin ^b   Asanović, Krste ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Composability; Cooperative Scheduling; Hierarchical Scheduling; Oversubscription; Parallelism; Resource Management; User Level Scheduling

Indexed keywords

COMPOSABILITY; COOPERATIVE SCHEDULING; HIERARCHICAL SCHEDULING; OVERSUBSCRIPTION; PARALLELISM; RESOURCE MANAGEMENT; USER-LEVEL SCHEDULING;

LIBRARIES; NATURAL RESOURCES MANAGEMENT; RESOURCE ALLOCATION;

SCHEDULING;

EID: 77957594732     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1809028.1806639     Document Type: Conference Paper

References (44)

1. Atul Adya et al. Cooperative task management without manual stack management. In USENIX, 2002.
2. Thomas Anderson et al. Scheduler activations: Effective kernel support for the user-level management of parallelism. In SOSP, 1991.
3. Animoto. http://www.animoto.com.
4. Robert Blumofe et al. Cilk: An efficient multithreaded runtime system. In PPOPP, 1995.
5. Rohit Chandra et al. Parallel Programming in OpenMP. Morgan Kaufmann, 2001.
6. Jike Chong et al. Scalable hmm based inference engine in large vocabulary continuous speech recognition. In ICME, 2009.
7. Timothy Davis. Multifrontal multithreaded rank-revealing sparse QR factorization. Transactions on Mathematical Software, Submitted.
8. K. Dussa et al. Dynamic partitioning in a Transputer environment. In SIGMETRICS, 1990.
9. EVE Online. http://www.eveonline.com.
10. Kathleen Fisher and John Reppy. Compiler support for lightweight concurrency. Technical report, Bell Labs, 2002.
11. Flickr. http://www.flickr.com.
12. Matthew Fluet et al. A scheduling framework for general-purpose parallel languages. In ICFP, 2008.
13. Bryan Ford and Sai Susarla. CPU inheritance scheduling. In OSDI, 1996.
14. Seth Copen Goldstein et al. Lazy threads: Implementing a fast parallel call. Journal of Parallel and Distributed Computing, 1996.
15. Google Voice. http://voice.google.com.
16. GraphicsMagick. http://www.graphicsmagick.org.
17. Benjamin Hindman. Libprocess. http://www.eecs.berkeley.edu/benh/ libprocess.
18. Parry Husbands and Katherine Yelick. Multithreading and one-sided communication in parallel lu factorization. In Supercomputing, 2007.
19. Intel. Math Kernel Library for the Linux Operating System: User's Guide. 2007.
20. Ravi Iyer. CQoS: A framework for enabling QoS in shared caches of CMP platforms. In ICS, 2004.
21. Haoqiang Ji et al. The OpenMP implementation of NAS parallel benchmarks and its performance. Technical report, NASA Ames Research Center, 1999.
22. Laxmikant V. Kale, Joshua Yelon, and Timothy Knauff. Threads for interoperable parallel programming. Languages and Compilers for Parallel Computing, 1996.
23. Jakub Kurzak et al. Scheduling linear algebra operations on multicore processors. Technical report, LAPACK, 2009.
24. C. L. Lawson et al. Basic linear algebra subprograms for FORTRAN usage. Transactions on Mathematical Software, 1979.
25. Jae Lee et al. Globally-synchronized frames for guaranteed qualityof- service in on-chip networks. In ISCA, 2008.
26. Peng Li et al. Lightweight concurrency primitives. In Haskell, 2007.
27. Rose Liu et al. Tessellation: Space-time partitioning in a manycore client OS. In HotPar, 2009.
28. Brian Marsh et al. First-class user-level threads. OS Review, 1991.
29. Cathy McCann et al. A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors. Transactions on Computer Systems, 1993.
30. Ana Lucia DeMoura and Robert Ierusalimschy. Revisiting coroutines. Transactions on Programming Languages and Systems, 2009.
31. Rajesh Nishtala and Kathy Yelick. Optimizing collective communication on multicores. In HotPar, 2009.
32. Simon Peter et al. 30 seconds is not enough! a study of operating system timer usage. In Eurosys, 2008.
33. John Regehr. Using Hierarchical Scheduling to Support Soft Real- Time Applications in General-Purpose Operating Systems. PhD thesis, University of Virginia, 2001.
34. James Reinders. Intel Threading Building Blocks: Outfitting C++ for Multi-core Processor Parallelism. O'Reilly, 2007.
35. Charles Severance and Richard Enbody. Comparing gang scheduling with dynamic space sharing on symmetric multiprocessors using automatic self-allocating threads. In IPPS, 1997.
36. Stackless Python. http://www.stackless.com.
37. Guangming Tan et al. A parallel dynamic programming algorithm on a multi-core architecture. In SPAA, 2007.
38. Andrew Tucker and Anoop Gupta. Process control and scheduling issues for multiprogrammed shared-memory multiprocessors. OS Review, 1989.
39. Dean Tullsen et al. Exploiting choice: Instruction fetch and issue on an implementable simultaneous multithreading processor. In ISCA, 1996.
40. Rob von Behren et al. Capriccio: Scalable threads for internet services. In SOSP, 2003.
41. Carl Waldspurger and William Weihl. Lottery scheduling: Flexible proportional-share resource management. In OSDI, 1994.
42. Mitchell Wand. Continuation-based multiprocessing. In LFP, 1980.
43. Samuel Williams et al. Optimization of sparse matrix-vector multiplication on emerging multicore platforms. In Supercomputing, 2007.
44. YouTube. http://www.youtube.com