Coordination languages and their significance
Communications of the ACM
Logic for applications
Reusable coordinator modules for massively concurrent applications
Software—Practice & Experience
Coordination languages for parallel programming
Parallel Computing - Special issue on coordination languages for parallel programming
Using coordination to parallelize sparse-grid methods for 3-D CFD problems
Parallel Computing - Special issue on coordination languages for parallel programming
Reusable Coordinator Modules for Massively Concurrent Applications
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
The IWIM Model for Coordination of Concurrent Activities
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
The TOOLBUS Coordination Architecture
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
The propositional formula checker HeerHugo
The propositional formula checker HeerHugo
Coordination of massively concurrent activities
Coordination of massively concurrent activities
The Influence of Coordination on Program Structure
HICSS '97 Proceedings of the 30th Hawaii International Conference on System Sciences: Software Technology and Architecture - Volume 1
Hi-index | 0.00 |
In this paper we describe an experiment in which MANIFOLD is used to coordinate the interprocess communication in a parallelized proposition solver. MANIFOLD is very well suited for applications involving dynamic process creation and dynamically changing (ir)regular communication patterns among sets of independent concurrent cooperating processes. The idea in this case study is simple. The proposition solver consists of a fixed numbers of separate processing units which communicate with each other such that the output of one serves as the input for the other. Because one of the processing units performs a computation intensive job, we introduce a master/worker protocol to divide its computations. We show that this protocol implemented in MANIFOLD adds another hierarchic layer to the application but leaves the previous layers intact. This modularity of MANIFOLD offers the possibility to introduce concurrency step by step. We also verify the implementation of the proposition solver using a simple family of assertions and give some performance results.