Abstract

Message-passing systems are typically used to achieve high-performance parallel computing. In this paper we examine how advanced concurrent programming can be achieved using existing message-passing systems. In particular, we look at Reppy's extension to Hoare's basic CSP model, called higher-order concurrency, where communication events (such as send, receive and non-deterministic choice) are first-class just like normal program variables (e.g., integers), that is, they can be created at run-time, assigned to variables, and passed to and returned from functions. This allows the construction of high-level concurrent features without explicit support for them in the model itself. We see how first-class events can be implemented in PVM, showing that it forms the base of a powerful concurrent-programming language. We also provide garbage-collection of processes, which simplifies selective communication and dealing with end-cases. The implementation promotes more widespread use of the flex...

Citations