Reusable coordinator modules for massively concurrent applications

Arbab, Farhad; Blom, Corrien; Burger, F. J.; Everaars, C.T.H.

doi:10.1002/(sici)1097-024x(199807)28:7<703::aid-spe173>3.0.co;2-j

Cited by 19 publications

(12 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The same MANIFOLD modules developed for one application may be used in other parallel applications with the same or similar cooperation protocol, regardless of the fact that the two applications may perform completely different computations (the sparse-grid and semi-sparse-grid application use the same protocol manifold; see also [12] for this notion of reusability). Another important advantage of MANIFOLD is that it makes no distinction (from the language point of view) between distributed and parallel environments; the same MANIFOLD code can run in both, as we show in our 'toy' application in Section 2.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic process composition and communication patterns in irregularly structured applications

Everaars

Arbab

Koren

2000

Concurrency: Pract. Exper.

Self Cite

View full text Add to dashboard Cite

SUMMARYIn this paper we describe one experiment in which a new co-ordination language, called MANIFOLD, is used to restructure an existing sequential Fortran 77 code from computational fluid dynamics (CFD), into a parallel application. MANIFOLD is a co-ordination language developed at CWI (Centrum voor Wiskunde en Informatica) in the Netherlands. It is very well suited for applications involving dynamic process creation and dynamically changing (ir)regular communication patterns among sets of independent concurrent cooperating processes. With a simple but generic master/worker protocol, written in the MANIFOLD language, we are able to reuse the existing code without rethinking or rewriting it. The performance evaluation of a standard 3D CFD problem shows that MANIFOLD performs very well.

show abstract

Section: Discussionmentioning

confidence: 99%

“…One important advantage is that it results in a clear separation between the modules responsible for computation (the workers) and the modules responsible for co-ordination (the managers). This strengthens the modularity and enhances the reusability of both types of modules (see [1,9,12]). …”

Section: The Manifold Co-ordination Languagementioning

confidence: 90%

Dynamic process composition and communication patterns in irregularly structured applications

Everaars

Arbab

Koren

2000

Concurrency: Pract. Exper.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The notion of component in σπ is similar to that of Manifold's, and makes it possible for to acquire and replace the implementation of a component at run-time, possibly from some independent vendor over the net [6]. This notion supports the same kind of pluggability as obtained in the Java language [16] by separating interfaces from classes.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

A coordination language for mobile components

Arbab

Bonsangue

Boer

2000

Proceedings of the 2000 ACM Symposium on Applied Computing - Volume 1

View full text Add to dashboard Cite

In this paper we present the σπ coordination language, a core language for specifying dynamic networks of components. The language is inspired by the Manifold coordination language and by the π-calculus. The main concepts of the language are components, classes, objects and channels. A program in σπ consists of a number of components, where each component is a collection of classes separable from its original context and re-usable in any other context. An object is an instance of a class that executes in parallel with the other objects active in the system. The σπ language differs from other models of object-oriented systems mainly in its treatment of communication and mobility: communication is anonymous via synchronous or asynchronous channels, while mobility is obtained by moving channels in the virtual space of linked objects. Thus, a channel is a transferable capability of communication, and objects are mobile in the sense that their communication possibilities may change during a computation. The language σπ itself does not impose exogenous coordination, meaning that the coordination primitives affecting each object can be executed within the computation of the object itself. However, only simple restrictions on the class-definitions of a σπ program suffice to enforce a separation between computation and coordination. Interaction typically occurs anonymously and under the full control of the objects involved. This make it easier to deal with Internet application where security policies must be enforced in view of the possibilities of attacks.

show abstract

“…Therefore, it is irrelevant what it coordinates. Our M UQE manifold can just as happily orchestrate the cooperation of any pair of processes that have the same input/output and event behavior as UQE and WORKER do, regardless of what computation they perform (see also [ABBE96] for this phenomena).…”

Section: Restructuring the Uqe Transformationmentioning

confidence: 99%

Coordination of a Parallel Proposition Solver

Everaars

Lisser

1999

Coordinatio Languages and Models

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Reusable coordinator modules for massively concurrent applications

Cited by 19 publications

References 13 publications

Dynamic process composition and communication patterns in irregularly structured applications

Dynamic process composition and communication patterns in irregularly structured applications

A coordination language for mobile components

Coordination of a Parallel Proposition Solver

Contact Info

Product

Resources

About