A proposal for parallel self-adjusting computation

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

Volumn , Issue , 2007, Pages 3-9

  Hammer, Matthew ^a   Acar, Umut A ^a   Rajagopalan, Mohan ^b   Ghuloum, Anwar ^b  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b INTEL CORPORATION   (United States)

Author keywords

Change propagation; Dynamic dependency graphs; Fork join programs; Parallel change propagation; Parallelism; Self adjusting computation; Series parallel programs

Indexed keywords

ALGORITHMS; AUTOMATION; COMPUTATION THEORY; DATA STRUCTURES; GRAPH THEORY; SOFTWARE PROTOTYPING;

CHANGE PROPAGATION; DYNAMIC DEPENDENCY GRAPHS; FORK-JOIN PROGRAMS; PARALLEL CHANGE PROPAGATION; SELF-ADJUSTING COMPUTATION; SEQUENTIAL EXECUTION MODELS; SERIES-PARALLEL PROGRAMS;

PARALLEL PROGRAMMING;

EID: 35348879709     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1248648.1248651     Document Type: Conference Paper

References (14)

1. Umut A. Acar. Self-Adjusting Computation. PhD thesis, Department of Computer Science, Carnegie Mellon University, May 2005.
2. Umut A. Acar, Guy E. Blelloch, Matthias Blume, and Kanat Tangwongsan. An experimental analysis of self-adjusting computation. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2006.
3. Umut A. Acar, Guy E. Blelloch, and Robert Harper. Adaptive functional programming. In Proceedings of the 29th Annual ACM Symposium on Principles of Programming Languages, pages 247259, 2002.
4. Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorge L. Vittes, and Maverick Woo. Dynamizing static algorithms with applications to dynamic trees and history independence. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004.
5. Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, and Jorge L. Vittes. Kinetic algorithms via self-adjusting computation. Technical Report CMU-CS-06-115, Department of Computer Science, Carnegie Mellon University, March 2006.
6. Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, and Charles E. Leiserson. On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs. In SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pages 133-144, New York, NY, USA, 2004. ACM Press.
7. Guy E. Blelloch. Vector models for data-parallel computing. MIT Press, Cambridge, MA, USA, 1990.
8. Guy E. Blelloch and John Greiner. Parallelism in sequential functional languages. In Proceedings of the Symposium on Functional Programming and Computer Architecture, pages 226-237, June 1995.
9. Richard Cole and Ramesh Hariharan. Dynamic lca queries on trees. SIAM Journal on Computing, 34(4):894-923, 2005.
10. Karl Crary, David Walker, and Greg Morrisett. Typed memory management in a calculus of capabilities. In Conference Record of POPL 99: The 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Antonio, Texas, pages 262-275, New York, NY, 1999.
11. P. F. Dietz and D. D. Sleator. Two algorithms for maintaining order in a list. In Proceedings of the 19th ACM Symposium on Theory of Computing, pages 365-372, 1987.
12. 3: A linear language with locations. In TLCA'04: Proceedings of the Seventh International Conference on Typed Lambda Calculi and Applications, pages 293-307. Springer-Verlag, April 2005.
13. Raimund Seidel, and Cecilia R. Aragon. Randomized search trees. Algorithmica, 16(4-5):464-497, 1996.
14. David Walker and Greg Morrisett. Alias types for recursive data structures. Lecture Notes in Computer Science, 2071, 2001.