Implementing declarative parallel bottom-avoiding choice

Proceedings - Symposium on Computer Architecture and High Performance Computing

Volumn 2002-January, Issue , 2002, Pages 82-89

  Rauber Du Bois, A ^a   Pointon, R ^a   Loidl, H W ^a   Trinder, P ^a  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

Computer architecture; Concurrent computing; Control systems; Data structures; High performance computing; Neodymium; Proposals; Runtime; Skeleton; Yarn

Indexed keywords

COMPUTER CONTROL SYSTEMS; CONCURRENCY CONTROL; CONTROL SYSTEMS; DATA STRUCTURES; MEMORY ARCHITECTURE; NEODYMIUM; SEMANTICS; YARN;

CONCURRENT COMPUTING; HIGH PERFORMANCE COMPUTING; PROPOSALS; RUNTIMES; SKELETON;

COMPUTER ARCHITECTURE;

EID: 84948732899     PISSN: 15506533     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CAHPC.2002.1180763     Document Type: Conference Paper

References (22)

1. F. Burton. Nondeterminism with Referential Transparency in Functional Programming Languages. Computer Journal, 31(3):243-247, 1988.
2. I. Checkland. Speculative Concurrent Evaluation in a Lazy Functional Language. PhD thesis, Department of Computer Science, University of York, 1995.
3. W. Clinger. Nondeterministic Call by Need is Neither Lazy Nor by Name. In LFP'82 - Conf on LISP and Functional Programming, pages 226-234, Pittsburgh, PA, 1982.
4. J. Dermoudy. Effective Runtime Management of Parallelism in a Functional Programming Context. PhD thesis, University of Tasmania, 2002. Under assessment.
5. S. Finne and S. Peyton Jones. Programming Reactive Systems in Haskell. In Glasgow Workshop on Functional Programming, Workshops in Computing, pages 50-66, Ayr, Scotland, Sept. 1994. Springer-Verlag.
6. P. Henderson. Functional Programming - Application and Implementation, chapter Non-deterministic Primitives and Backtrack Problems. Prentice-Hall, 1980.
7. M. Hennessy and E. Ashcroft. Parameter Passing Mechanisms and Nondeterminism. In Symp on the Theory of Computing, Boulder, CO, 1977.
8. R. Hughes and A. Moran. Making Choices Lazily. In FPCA'95 - Intl Conf on Functional Programming Languages and Computer Architecture, pages 108-119, La Jolla, CA, June 1995. ACM Press.
9. R. Hughes and J. O'Donnell. Expressing and Reasoning about Nondeterministic Functional Programs. In Glasgow Workshop on Functional Programming, pages 308-328. Springer-Verlag, 1989.
10. J. Kennaway and C. Hoare. A Theory of Nondeterminism. In Intl Colloquium on Automata, Languages, and Programming, LNCS 85, pages 338-350. Springer-Verlag, 1980.
11. H.-W. Loidl, P. Trinder, K. Hammond, S. Junaidu, R. Morgan, and S. Peyton Jones. Engineering Parallel Symbolic Programs in GPH. Concurrency - Practice and Experience, 11:701-752, 1999.
12. J. Mattson Jr. An Effective Speculative Evaluation Technique for Parallel Supercombinator Graph Reduction. PhD thesis, University of California, San Diego, Feb. 1993.
13. J. McCarthy. A Basis for a Mathematical Theory of Computations. In Computer Programming and Formal Systems, pages 33-70. North-Holland, 1963.
14. A. Moran. Call-by-name, Call-by-need, and McCarthy's Amb. PhD thesis, Department of Computing Science, Chalmers University, 1998.
15. A. Partridge. Speculative Evaluation in Parallel Implementations of Lazy Functional Languages. PhD thesis, University of Tasmania, 1991.
16. S. Peyton Jones, A. Gordon, and S. Finne. Concurrent Haskell. In POPL'96 - Symp on Principles of Programming Languages, pages 295-308. ACM Press, Jan. 1996.
17. R. Pointon, P. Trinder, and H.-W. Loidl. The Design and Implementation of Glasgow distributed Haskell. In IFL'00 - Intl Workshop on the Implementation of Functional Languages, LNCS 2011, pages 53-70. Springer-Verlag, 2000.
18. R. Schröder and W. Kluge. Organizing Speculative Computations in Functional Systems. In IFL'00 - Intl Workshop on the Implementation of Functional Languages, LNCS 2011, pages 214-230. Springer-Verlag, 2001.
19. H. Søndergaard and P. Sestoft. Referential Transparency, Definiteness and Unfoldability. Acta Informatica, 27:505-517, 1990.
20. H. Søndergaard and P. Sestoft. Non-determinism in Functional Languages. Computer Journal, 35(5):514-523, 1992.
21. P. Trinder, K. Hammond, H.-W. Loidl, and S. Peyton Jones. Algorithm + Strategy = Parallelism. J. of Functional Programming, 8(1):23-60, January 1998.
22. P. Wadler. Comprehending Monads. Mathematical Structures in Computer Science, 2:461-493, 1992.