The construction of a small communication library

In order to develop portable parallel software a. reasonable abstraction from parallel hardware is necessary. Over the last few years, such abstractions have become available in the form of communication libraries. In this paper we first look at the mapping of parallel programs onto networks and we show how this can be generalized into a small but powerful communication library. The focus of the discussion is on the derivation of the processes implementing the library. During the design, efficiency is a key issue. In particular, we pursue a low latency for communications by avoiding buffering as much as possible.

[1]  Jan A. Bergstra,et al.  Axiomatizing Probabilistic Processes: ACP with Generative Probabilities , 1995, Inf. Comput..

[2]  Bruce W. Watson.  An introduction to the FIRE engine : a C++ toolkit for finite automata and regular expressions , 1994 .

[3]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[4]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[5]  W. Ferrer,et al.  Abstract reduction and topology , 1993 .

[6]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[7]  Alain J. Martin,et al.  Design of Synchronization Algorithms , 1989 .

[8]  Corporate Inmos Limited.  Transputer Reference Manual , 1988 .

[9]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[10]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[11]  Peter A. J. Hilbers.  Processor Networks and Aspects of the Mapping Problem , 1991 .

[12]  Herman Geuvers,et al.  A short and flexible proof of Strong Normalization for the Calculus of Constructions , 1994, TYPES.

[13]  P. D. Moerland,et al.  Exercises in multiprogramming , 1993 .

[14]  Amir Pnueli,et al.  Verifying sequentially consistent memory , 1994 .

[15]  Jack Dongarra,et al.  Pvm 3 user's guide and reference manual , 1993 .

[16]  Message Passing Interface Forum.  MPI: A message - passing interface standard , 1994 .

[17]  Bruce W. Watson,et al.  The design and implementation of the FIRE engine : a C++ toolkit for finite automata and regular expressions , 1994 .

[18]  W. F. McColl,et al.  General purpose parallel computing , 1993 .

[19]  Gerard Zwaan,et al.  A taxonomy of keyword pattern matching algorithms , 1992 .

[20]  Jan L. A. van de Snepscheut,et al.  What Computing Is All About , 1993, Text and Monographs in Computer Science.

[21]  Erik Poll,et al.  Some categorical properties for a model for second order lambda calculus with subtyping , 1991 .

[22]  Gjpm Geert-Jan Houben.  Tutorial voor de ExSpect-bibliotheek voor "administratieve logistiek" , 1994 .

[23]  J. Zwiers,et al.  Assertional Data Reification Proofs: Survey and Perspective , 1991 .

[24]  Dieter Kratsch,et al.  Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph , 1995, Inf. Process. Lett..

[25]  van Km Kees Hee,et al.  Systems engineering : a formal approach. Part I. System concepts , 1993 .

[26]  C. W. A. M. van Overveld,et al.  Stars or Stripes: a comparative study of finite and transfinite techniques for surface modelling , 1994 .