I-structures: data structures for parallel computing

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

I-structures: data structures for parallel computing

Full text

Pdf (2.40 MB)

Source

ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 11 , Issue 4 (October 1989) table of contents

Pages: 598 - 632

Year of Publication: 1989

ISSN:0164-0925

Authors

Arvind	Massachusetts Institute of Technology, Cambridge
Rishiyur S. Nikhil	Massachusetts Institute of Technology, Cambridge
Keshav K. Pingali	Cornell Univ., Ithaca, NY

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 17, Downloads (12 Months): 85, Citation Count: 76

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/69558.69562 What is a DOI?

ABSTRACT

It is difficult to achieve elegance, efficiency, and parallelism simultaneously in functional programs that manipulate large data structures. We demonstrate this through careful analysis of program examples using three common functional data-structuring approaches-lists using Cons, arrays using Update (both fine-grained operators), and arrays using make-array (a “bulk” operator). We then present I-structure as an alternative and show elegant, efficient, and parallel solutions for the program examples in Id, a language with I-structures. The parallelism in Id is made precise by means of an operational semantics for Id as a parallel reduction system. I-structures make the language nonfunctional, but do not lose determinacy. Finally, we show that even in the context of purely functional languages, I-structures are invaluable for implementing functional data abstractions.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	W. B. Ackerman, A STRUCTURE MEMORY FOR DATA FLOW COMPUTERS, Massachusetts Institute of Technology, Cambridge, MA, 1977
	2	ALLEN, J., AND KENNEDY, K. PFC: A program to convert FORTRAN to parallel form. Tech. Rep. MASC-TR82-6, Rice University, Houston, Tex., March 1982.
	3	ARIOLA, Z., AND ARVIND. P-TAC: A parallel intermediate language. Tech. Rep. CSG Memo 295, MIT Lab. for Computer Science, Massachusetts ilnstitute of Technology, Cambridge, Jan. 1989.
	4	Arvind , David E. Culler, Dataflow architectures, Annual review of computer science vol. 1, 1986, Annual Reviews Inc., Palo Alto, CA, 1986
	5	Arvind , R S Nikhil, Executing a program on the MIT tagged-token dataflow architecture, Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe, p.1-29, March 1987, Eindhoven, The Netherlands
	6	ARVIND, NIKHIL, R. S., AND PINGALI, K.K. Id nouveau reference manual, part II: Semantics. Tech. Rep., Computation Structures Group, MIT Lab. for Computer Science, Massachusetts Institute of Technology, Cambridge, 1987.
	7	ARVIND, AND THOMAS, R.E. I-Structures: An efficient data structure for functional languages. Tech. Rep. MIT/LCS/TM-178, MIT Lab. for Computer Science, Massachusetts Institute of Technology, Cambridge, 1981.
	8	BARENDREGT, H., AND VAN LEEUWEN, M. Functional programming and the language TALE. Tech. Rep. TR 412, Mathematical Institute, Utrecht, The Netherlands, 1985.
	9	CULLER, D.E. Effective datafiow execution of scientific applications. Ph.D. dissertation, MIT Lab. for Computer Science, Massachusetts Institute of Technology, Cambridge. To appear.
	10	D. E. Culler, RESOURCE MANAGEMENT FOR THE TAGGED TOKEN DATAFLOW ARCHITECTURE, Massachusetts Institute of Technology, Cambridge, MA, 1985
	11	D. E. Culler , Arvind, Resource requirements of dataflow programs, Proceedings of the 15th Annual International Symposium on Computer architecture, p.141-150, May 30-June 02, 1988, Honolulu, Hawaii, United States
	12	J R Driscoll , N Sarnak , D D Sleator , R E Tarjan, Making data structures persistent, Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.109-121, May 28-30, 1986, Berkeley, California, United States [doi>10.1145/12130.12142]
	13	GOSTELOW, K. P., AND THOMAS, R.E. A view of datafiow. In AFIPS Conference Proceedings, vol. 48, 1979, pp. 629-636.
	14	Paul Hudak, A semantic model of reference counting and its abstraction (detailed summary), Proceedings of the 1986 ACM conference on LISP and functional programming, p.351-363, August 1986, Cambridge, Massachusetts, United States [doi>10.1145/319838.319876]
	15	R. Jagadeesan , P. Panangaden , K. Pingali, A fully abstract semantics for a functional language with logic variables, Proceedings of the Fourth Annual Symposium on Logic in computer science, p.294-303, June 1989, Pacific Grove, California, United States
	16	Thomas Johnsson, Lambda lifting: transforming programs to recursive equations, Proc. of a conference on Functional programming languages and computer architecture, p.190-203, January 1985, Nancy, France
	17	KELLER, R. M. FEL (function equation language) programmer's guide. Tech. Rep., AMPS Tech. Memo. 7, Dept. of Computer Science, University of Utah, Salt Lake City, April 1983.
	18	D. J. Kuck , R. H. Kuhn , D. A. Padua , B. Leasure , M. Wolfe, Dependence graphs and compiler optimizations, Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.207-218, January 26-28, 1981, Williamsburg, Virginia [doi>10.1145/567532.567555]
	19	Gary Lindstrom, Functional programing and the logical variable, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.266-280, January 14-16, 1985, New Orleans, Louisiana, United States [doi>10.1145/318593.318657]
	20	NIKHIL, R.S. Id (version 88.1) reference manual. Tech. Rep. CSG Memo 284, MIT Lab. for Computer Science, Massachusetts Institute of Technology, Cambridge, Aug. 1988.
	21	NIKHIL, R. S., PINGALI, K., AND ARVlND. Id nouveau. Tech. Rep. CSG Memo 265, Computation Structures Group, MIT Lab. for Computer Science, Massachusetts Institute of Technology, Cambridge, July 1986.
	22	David A. Padua , Michael J. Wolfe, Advanced compiler optimizations for supercomputers, Communications of the ACM, v.29 n.12, p.1184-1201, Dec. 1986 [doi>10.1145/7902.7904]
	23	Simon L. Peyton Jones, The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science), Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
	24	Keshav Pingali , Kattamuri Ekanadham, Accumulators: A New Logic Variable Abstractions for Functional Languages, Proceedings of the Eighth Conference on Foundations of Software Technology and Theoretical Computer Science, p.377-399, December 21-23, 1988
	25	K. R. Traub, A COMPILER FOR THE MIT TAGGED-TOKEN DATAFLOW ARCHITECTURE, Massachusetts Institute of Technology, Cambridge, MA, 1986
	26	TRAUB, K.R. Sequential implementation of lenient progr ~mming languages. Ph.D. dissertation, Tech. Rep. TR-417, MIT Laboratory for Computer ScierLce, Massachusetts Institute of Technology, Cambridge, May 1988.
	27	Philip Wadler, A new array operation, Proc. of a workshop on Graph reduction, p.328-335, September 1987, Santa Fe, New Mexico, United States
	28	Philip Wadler, Listlessness is better than laziness: Lazy evaluation and garbage collection at compile-time, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.45-52, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802020]

CITED BY 76

	Vijay A. Saraswat , Martin Rinard , Prakash Panangaden, The semantic foundations of concurrent constraint programming, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.333-352, January 21-23, 1991, Orlando, Florida, United States
	Henry Cejtin , Suresh Jagannathan , Richard Kelsey, Higher-order distributed objects, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.5, p.704-739, Sept. 1995
	Suresh Jagannathan , Jim Philbin, A customizable substrate for concurrent languages, ACM SIGPLAN Notices, v.27 n.7, p.55-81, July 1992
	Girija J. Narlikar , Guy E. Blelloch, Space-efficient implementation of nested parallelism, ACM SIGPLAN Notices, v.32 n.7, p.25-36, July 1997
	Robert D. Blumofe , Charles E. Leiserson, Scheduling multithreaded computations by work stealing, Journal of the ACM (JACM), v.46 n.5, p.720-748, Sept. 1999
	William Marcus Miller , Walid A. Najjar , A. P. Wim Böhm, A quantitative analysis of locality in dataflow programs, Proceedings of the 24th annual international symposium on Microarchitecture, p.12-18, September 1991, Albuquerque, New Mexico, Puerto Rico
	Radha Jagadeesan , Keshav Pingali, Abstract semantics for a higher-order functional language with logic variables, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.355-366, January 19-22, 1992, Albuquerque, New Mexico, United States
	John Launchbury, A natural semantics for lazy evaluation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.144-154, March 1993, Charleston, South Carolina, United States
	Guy E. Blelloch , Phillip B. Gibbons , Yossi Matias, Provably efficient scheduling for languages with fine-grained parallelism, Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, p.1-12, June 24-26, 1995, Santa Barbara, California, United States
	Prasad Vishnubhotla, Fine-grain parallelism in the ALPS programming language, Proceedings of the 1990 conference on Supercomputing, p.506-514, October 1990, New York, New York, United States
	Joachim Niehren, Functional computation as concurrent computation, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.333-343, January 21-24, 1996, St. Petersburg Beach, Florida, United States
	Radha Jagadeesan , Keshav Pingali , Prakash Panangaden, A fully abstract semantics for a first-order functional language with logic variables, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.4, p.577-625, Oct. 1991
	Anant Agarwal , Ricardo Bianchini , David Chaiken , Kirk L. Johnson , David Kranz , John Kubiatowicz , Beng-Hong Lim , Kenneth Mackenzie , Donald Yeung, The MIT Alewife machine: architecture and performance, ACM SIGARCH Computer Architecture News, v.23 n.2, p.2-13, May 1995
	Anant Agarwal , Ricardo Bianchini , David Chaiken , Kirk L. Johnson , David Kranz , J. Kubiatowicz , B.-H. Lim , K. Mackenzie , D. Yeung, The MIT Alewife machine: architecture and performance, 25 years of the international symposia on Computer architecture (selected papers), p.509-520, June 27-July 02, 1998, Barcelona, Spain
	Joxan Jaffar , Spiro Michaylov , Roland H. C. Yap, A methodology for managing hard constraints in CLP systems, ACM SIGPLAN Notices, v.26 n.6, p.306-316, June 1991
	Karl J. Ottenstein , Robert A. Ballance , Arthur B. MacCabe, The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages, ACM SIGPLAN Notices, v.25 n.6, p.257-271, Jun. 1990
	Guy E. Blelloch, Programming parallel algorithms, Communications of the ACM, v.39 n.3, p.85-97, March 1996
	Krishna M. Kavi , Roberto Giorgi , Joseph Arul, Scheduled Dataflow: Execution Paradigm, Architecture, and Performance Evaluation, IEEE Transactions on Computers, v.50 n.8, p.834-846, August 2001
	Tyng-Ruey Chuang, A randomized implementation of multiple functional arrays, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.173-184, July-Sept. 1994
	Guy E. Blelloch , Phillip B. Gibbons , Yossi Matias, Provably efficient scheduling for languages with fine-grained parallelism, Journal of the ACM (JACM), v.46 n.2, p.281-321, March 1999
	Leonid Libkin , Rona Machlin , Limsoon Wong, A query language for multidimensional arrays: design, implementation, and optimization techniques, ACM SIGMOD Record, v.25 n.2, p.228-239, June 1996
	Satoshi Sekiguchi , Toshio Shimada , Kei Hiraki, Sequential description and parallel execution language DFCII dataflow supercomputers, Proceedings of the 5th international conference on Supercomputing, p.57-66, June 17-21, 1991, Cologne, West Germany
	Guy E. Blelloch , Phillip B. Gibbons , Girija J. Narlikar , Yossi Matias, Space-efficient scheduling of parallelism with synchronization variables, Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, p.12-23, June 23-25, 1997, Newport, Rhode Island, United States
	Zena M. Ariola, A syntactic approach to program transformations, ACM SIGPLAN Notices, v.26 n.9, p.116-129, Sept. 1991
	Tyng-Ruey Chuang , Benjamin Goldberg, Real-time deques, multihead Turing machines, and purely functional programming, Proceedings of the conference on Functional programming languages and computer architecture, p.289-298, June 09-11, 1993, Copenhagen, Denmark
	S. ShouHan Wang , Augustus K. Uht, Ideograph/Ideogram: framework/hardware for eager evaluation, Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture, p.125-134, November 27-29, 1990, Orlando, Florida, United States
	Shail Aditya , Joseph E. Stoy , Arvind, Semantics of barriers in a non-strict, implicitly-parallel language, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.204-215, June 26-28, 1995, La Jolla, California, United States
	Panagiota Fatourou, Low-contention depth-first scheduling of parallel computations with write-once synchronization variables, Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, p.189-198, July 2001, Crete Island, Greece
	Girija J. Narlikar , Guy E. Blelloch, Space-efficient scheduling of nested parallelism, ACM Transactions on Programming Languages and Systems (TOPLAS), v.21 n.1, p.138-173, Jan. 1999
	Donald Yeung , Anant Agarwal, Experience with fine-grain synchronization in MIMD machines for preconditioned conjugate gradient, ACM SIGPLAN Notices, v.28 n.7, p.187-192, July 1993
	Dana S. Henry , Christopher F. Joerg, A tightly-coupled processor-network interface, ACM SIGPLAN Notices, v.27 n.9, p.111-122, Sept. 1992
	Fabien Quilleré , Sanjay Rajopadhye, Optimizing memory usage in the polyhedral model, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.5, p.773-815, Sept. 2000
	Osamu Tatebe , Yuetsu Kodama , Satoshi Sekiguchi , Yoshinori Yamaguchi, Highly efficient implementation of MPI point-to-point communication using remote memory operations, Proceedings of the 12th international conference on Supercomputing, p.267-273, July 1998, Melbourne, Australia
	Klaus E. Schauser , Seth C. Goldstein, How much non-strictness do lenient programs require?, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.216-225, June 26-28, 1995, La Jolla, California, United States
	Sholin Kyo , Satoshi Sekiguchi , Mitsuhisa Sato, Data stream control optimization in dataflow architectures, Proceedings of the 7th international conference on Supercomputing, p.37-46, July 19-23, 1993, Tokyo, Japan
	Kechang Dai , Wolfgang K. Giloi, A basic architecture supporting LGDG computation, ACM SIGARCH Computer Architecture News, v.18 n.3b, p.23-33, Sept. 1990
	Anant Agarwal , John Kubiatowicz , David Kranz , Beng-Hong Lim , Donald Yeung , Godfrey D'Souza , Mike Parkin, Sparcle: An Evolutionary Processor Design for Large-Scale Multiprocessors, IEEE Micro, v.13 n.3, p.48-61, May 1993
	Shigeru Kusakabe , Eiichi Takahashi , Rin-ichiro Taniguchi , Makoto Amamiya, Dataflow-Based Lenient Implementation of a Functional Language, Valid, on Conventional Multi-processors, Proceedings of the IFIP WG10.3 Working Conference on Parallel Architectures and Compilation Techniques, p.279-288, August 24-26, 1994
	Johannes Grabmeier , Erich Kaltofen , Volker Weispfenning, Cited References, Computer algebra handbook, Springer-Verlag New York, Inc., New York, NY, 2003
	John M. A. Roy , Mark D. Nagel , Lubomir Bic, Partitioning declarative programs into communicating processes, Proceedings of the 1990 conference on Supercomputing, p.846-855, October 1990, New York, New York, United States
	Edward A. Lee , Thomas M. Parks, Dataflow process networks, Readings in hardware/software co-design, Kluwer Academic Publishers, Norwell, MA, 2001
	Keshav Pingali , Micah Beck , Richard Johnson , Mayan Moudgill , Paul Stodghill, Dependence flow graphs: an algebraic approach to program dependencies, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.67-78, January 21-23, 1991, Orlando, Florida, United States
	Paul G. Whiting , Robert S. V. Pascoe, A History of Data-Flow Languages, IEEE Annals of the History of Computing, v.16 n.4, p.38-59, December 1994
	Eun Ha Rho , Sang Yong Han , Heung Hwan Kim , Dae Joon Hwang, Effects of data bundling in non-strict data structures, Proceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques, p.140-148, June 27-29, 1995, Limassol, Cyprus
	Bernard K. Gunther, Multithreading with Distributed Functional Units, IEEE Transactions on Computers, v.46 n.4, p.399-411, April 1997
	Alfredo Cristobal-Salas , Andrei Tchernykh , Jean-Luc Gaudiot , Wen-Yen Lin, Non-strict execution in parallel and distributed computing, International Journal of Parallel Programming, v.31 n.2, p.77-105, April 2003
	Wesley M. Johnston , J. R. Paul Hanna , Richard J. Millar, Advances in dataflow programming languages, ACM Computing Surveys (CSUR), v.36 n.1, p.1-34, March 2004
	Sumit Sur , A. P. Wim Böhm, Functional I-structure, and M-structure Implementations of NAS Benchmark FT, Proceedings of the IFIP WG10.3 Working Conference on Parallel Architectures and Compilation Techniques, p.47-56, August 24-26, 1994
	Jack B. Dennis, Fresh Breeze: a multiprocessor chip architecture guided by modular programming principles, ACM SIGARCH Computer Architecture News, v.31 n.1, March 2003
	Zhen Fang , Lixin Zhang , John B. Carter , Liqun Cheng , Michael Parker, Fast synchronization on shared-memory multiprocessors: an architectural approach, Journal of Parallel and Distributed Computing, v.65 n.10, p.1158-1170, October 2005
	D. F. Bacon , X. Shen, Braids and fibers: language constructs with architectural support for adaptive responses to memory latencies, IBM Journal of Research and Development, v.50 n.2/3, p.209-221, March 2006
	Jan-Willem Maessen, Eager Haskell: resource-bounded execution yields efficient iteration, Proceedings of the 2002 ACM SIGPLAN workshop on Haskell, p.38-50, October 03, 2002, Pittsburgh, Pennsylvania
	Osamu Tatebe , Umpei Nagashima , Satoshi Sekiguchi , Hisayoshi Kitabayashi , Yoshiyuki Hayashida, Design and implementation of FMPL, a fast message-passing library for remote memory operations, Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM), p.15-15, November 10-16, 2001, Denver, Colorado
	Samir Genaim , Andy King, Inferring non-suspension conditions for logic programs with dynamic scheduling, ACM Transactions on Computational Logic (TOCL), v.9 n.3, p.1-43, June 2008
	Isabelle Attali , Denis Caromel , Yung-Syau Chen , Jean-Luc Gaudiot , Andrew L. Wendelborn, Enhancing Functional and Irregular Parallelism: Stateful Functions and their Semantics, International Journal of Parallel Programming, v.29 n.4, p.433-460, August 2001
	Frédéric Loulergue, Editorial: Introduction to the special issue on semantics and costs models for high-level parallel programming, Computer Languages, Systems and Structures, v.33 n.3-4, p.79-81, October, 2007
	J. Niehren , J. Schwinghammer , G. Smolka, A concurrent lambda calculus with futures, Theoretical Computer Science, v.364 n.3, p.338-356, 8 November 2006
	John Reppy , Yingqi Xiao, Specialization of CML message-passing primitives, ACM SIGPLAN Notices, v.42 n.1, January 2007
	Yao Guo , Vladimir Vlassov , Raksit Ashok , Richard Weiss , Csaba Andras Moritz, Synchronization coherence: A transparent hardware mechanism for cache coherence and fine-grained synchronization, Journal of Parallel and Distributed Computing, v.68 n.2, p.165-181, February, 2008
	Steven Swanson , Andrew Schwerin , Martha Mercaldi , Andrew Petersen , Andrew Putnam , Ken Michelson , Mark Oskin , Susan J. Eggers, The WaveScalar architecture, ACM Transactions on Computer Systems (TOCS), v.25 n.2, p.4-es, May 2007
	Andrew Petersen , Andrew Putnam , Martha Mercaldi , Andrew Schwerin , Susan Eggers , Steve Swanson , Mark Oskin, Reducing control overhead in dataflow architectures, Proceedings of the 15th international conference on Parallel architectures and compilation techniques, September 16-20, 2006, Seattle, Washington, USA
	Malcolm Dowse , Andrew Butterfield, Modelling deterministic concurrent I/O, ACM SIGPLAN Notices, v.41 n.9, September 2006
	Weirong Zhu , Vugranam C Sreedhar , Ziang Hu , Guang R. Gao, Synchronization state buffer: supporting efficient fine-grain synchronization on many-core architectures, ACM SIGARCH Computer Architecture News, v.35 n.2, May 2007
	Henry G. Baker, Structured programming with limited private types in Ada: nesting if for the soaring eagles, ACM SIGAda Ada Letters, v.XI n.5, p.79-90, July/August 1991
	C. K. Yuen, Hamming numbers, lazy evaluation, and eager disposal, ACM SIGPLAN Notices, v.27 n.8, p.71-75, Aug. 1992
	Henry G. Baker, Lively linear Lisp: “look ma, no garbage!”, ACM SIGPLAN Notices, v.27 n.8, p.89-98, Aug. 1992
	C. K. Yuen, Which model of programming for LISP: sequential, functional or mixed?, ACM SIGPLAN Notices, v.26 n.10, p.83-92, Oct. 1991
	José Nelson Amaral , Wen-Yen Lin , Jean-Luc Gaudiot , Guang R. Gao, Exploiting Locality in Single Assignment Data Structures Updated Through Split-Phase Transactions, Cluster Computing, v.4 n.4, p.281-293, October 2001
	P. W. Trinder , K. Hammond , H.-W. Loidl , S. L. Peyton Jones, Algorithm + strategy = parallelism, Journal of Functional Programming, v.8 n.1, p.23-60, January 1998
	J. Hammes , S. Sur , W. Böhm, On the effectiveness of functional language features: NAS benchmark FT, Journal of Functional Programming, v.7 n.1, p.103-123, January 1997
	Thomas Johnsson, Efficient graph algorithms using lazy monolithic arrays, Journal of Functional Programming, v.8 n.4, p.323-333, July 1998
	Joachim Niehren, Uniform confluence in concurrent computation, Journal of Functional Programming, v.10 n.5, p.453-499, September 2000
	Matthew Fluet , Mike Rainey , John Reppy , Adam Shaw, Implicitly-threaded parallelism in Manticore, ACM SIGPLAN Notices, v.43 n.9, September 2008
	Daniel Spoonhower , Guy E. Blelloch , Robert Harper , Phillip B. Gibbons, Space profiling for parallel functional programs, ACM SIGPLAN Notices, v.43 n.9, September 2008
	Matthew Fluet , Mike Rainey , John Reppy, A scheduling framework for general-purpose parallel languages, ACM SIGPLAN Notices, v.43 n.9, September 2008
	Daniel Spoonhower , Guy E. Blelloch , Phillip B. Gibbons , Robert Harper, Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures, Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, August 11-13, 2009, Calgary, AB, Canada