Communicating sequential processes
Communicating sequential processes
Designing efficient algorithms for parallel computers
Designing efficient algorithms for parallel computers
Memory coherence in shared virtual memory systems
ACM Transactions on Computer Systems (TOCS)
Using MPI: portable parallel programming with the message-passing interface
Using MPI: portable parallel programming with the message-passing interface
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
Interacting processes: a multiparty approach to coordinated distributed programming
Interacting processes: a multiparty approach to coordinated distributed programming
Pthreads programming
Models and languages for parallel computation
ACM Computing Surveys (CSUR)
Communication and Concurrency
Concurrent Programming in Java: Design Principles and Patterns
Concurrent Programming in Java: Design Principles and Patterns
Laboratories for Parallel Computing
Laboratories for Parallel Computing
The Compositional C++ Language Definition
The Compositional C++ Language Definition
Hi-index | 0.00 |
In this paper, we argue that interacting processes (IP) with multiparty interactions are an ideal model for parallel programming. The IP model with multiparty interactions was originally proposed by N. Francez and I. R. Forman [1] for distributed programming of reactive applications. We analyze the IP model and provide the new insights into it from the parallel programming perspective. We show through parallel program examples in IP that the suitability of the IP model for parallel programming lies in its programmability, high degree of parallelism and support for modular programming. We believe that IP is a good candidate for the mainstream programming model for the both parallel and distributed computing in the future.