How to write parallel programs: a first course
How to write parallel programs: a first course
Coloured Petri Nets: a high level language for system design and analysis
APN 90 Proceedings on Advances in Petri nets 1990
Program transformations for static process networks
ACM SIGPLAN Notices - Workshop on languages, compilers and run-time environments for distributed memory multiprocessors
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
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Functional Programming and Parallel Graph Rewriting
Functional Programming and Parallel Graph Rewriting
How to Find Invariants for Coloured Petri Nets
Proceedings on Mathematical Foundations of Computer Science
Parallel Programming Using Skeleton Functions
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
Elements of General Net Theory
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Coordinating Functional Processes Using Petri Nets
IFL '96 Selected Papers from the 8th International Workshop on Implementation of Functional Languages
Tools for Monitoring, Debugging, and Programming in PVM
EuroPVM '96 Proceedings of the Third European PVM Conference on Parallel Virtual Machine
A Language for Concurrent Processing based on Petri Nets
Architektur von Rechensystemen, Arbeitsteilige Systemarchitekturen: Konzepte, Lösungen, Anwendungen, Trends - Vorträge der 14. ITG/GI-Fachtagung ARCS '97
Algorithm + strategy = parallelism
Journal of Functional Programming
Hi-index | 0.00 |
This paper is on process coordination language K2 which is based on a variant of high-level Petri nets. It strictly separates the specification of processes and their communication structures from (functional) specifications of the computations to be performed by the processes. The purpose of this separation is to facilitate both correct program construction and formal reasoning about essential safety and liveness properties. More specifically, the paper presents and analyzes performance measurements obtained from a K2 implementation based on the message passing system PVM. Two simple K2 benchmark programs are to determine the overhead inflicted by the K2 runtime system relative to a direct PVM implementation of the same programs. A third benchmark program, the implementation of a relaxation algorithm for the solution of PDEs, is to investigate the efficiency of distributing some given workload on a multiprocessor system by recursively expanding process (sub-)structures. The measurements show that coarse-grain K2 programs are only marginally slower than their PVM counterparts, and that good scalability of recursive programs can be achieved on multiple computing sites.