Structured analysis—formal design, using stream and object oriented formal specifications
Conference proceedings on Formal methods in software development
Program transformations for static process networks
ACM SIGPLAN Notices - Workshop on languages, compilers and run-time environments for distributed memory multiprocessors
A compiler approach to scalable concurrent-program design
ACM Transactions on Programming Languages and Systems (TOPLAS)
Strictness optimization for graph reduction machines (why id might not be strict)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compositional parallel programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Models and languages for parallel computation
ACM Computing Surveys (CSUR)
An elementary language construct for parallel programming
ACM SIGPLAN Notices
Coordinating functional processes with Haskell#
Proceedings of the 2002 ACM symposium on Applied computing
Comparing Parallel Functional Languages: Programming and Performance
Higher-Order and Symbolic Computation
Parallel and Distributed Haskells
Journal of Functional Programming
Pipelined functional tree accesses and updates: scheduling, synchronization, caching and coherence
Journal of Functional Programming
Algorithm + strategy = parallelism
Journal of Functional Programming
A competitive algorithm for managing sharing in the distributed execution of functional programs
Journal of Functional Programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel functional programming in Eden
Journal of Functional Programming
Analyzing the influence of mixed evaluation on the performance of Eden skeletons
Parallel Computing - Algorithmic skeletons
A Debugger for Parallel Haskell Dialects
ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
To be or not to be ...lazy (In a Parallel Context)
Electronic Notes in Theoretical Computer Science (ENTCS)
Paper: Divide-and-Conquer and parallel graph reduction
Parallel Computing
Translating Haskell# programs into Petri nets
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
A survey of algorithmic skeleton frameworks: high-level structured parallel programming enablers
Software—Practice & Experience - Focus on Selected PhD Literature Reviews in the Practical Aspects of Software Technology
Integrating multithreading into the spineless tagless G-machine
FP'95 Proceedings of the 1995 international conference on Functional Programming
Hi-index | 0.00 |
From the Publisher:Recent progress in VLSI provides massive parallelism but general purpose parallel computers remain elusive due to limited communications performance. This book proposes a new high level approach to programming that addresses the pragmatic issue of how a computation is distributed across a machine. The book's approach is based on functional programming and has significant advantages over existing comparable approaches, extending the domain of functional programming to include computer architectures in which communication costs are not negligible. It looks at how high-level functional programming languages can be used to specify, reason about, and implement parallel programs for a variety of multiprocessor systems, but in particular a class of loosely coupled multiprocessors whose operation can be described by a process network In these networks the nodes correspond to processes and the arcs to communications channels. A simple language called Caliban is described in which the functional program text is augmented with a declarative description of how processes are partitioned and mapped onto a network of processing elements. The notation gains expressive power by allowing these annotations to be generated by predicates defined in the functional language. Thus, common communications structures have simple and concise definitions as "network forming operators." The main objective of these annotations is to provide an abstract description of the process network specified by the program so that an efficient mapping of processes to processors can be carried out by the compiler. Paul H. J. Kelly is Research Assistant in the Department of Computing at ImperialCollege, London Functional Programming for LooselyCoupled Multiprocessors is included in the series Research Monographs in Parallel and Distributed Computing, copublished with Pitman Publishing.