Arbab F, Blom CL, Burger FJ, Everaars CTH. Reusable coordinator modules for massively concurrent applications. Software: Pract. Exp. 1998; 28(7):703--735. Extended version.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of both. Thus we see that c heap and Arachne support only lossless fifo channels, whereas stm o ers random access data channels for more sophisticated subsampling. Third, interaction languages and (especially) coordination languages can facilitate re use of (parts of) designs in di erent products [1, 28]. Design for re use may lead to a higher design cost for lead products, but derivative products should be cheaper to design [12] low high system using a protocol abstraction of protocol (increasing services) cost of designing a Fig. 1. Services versus cost of designing. In Figure 1 we ....

F. Arbab, C. L. Blom, F. J. Burger, and C. T. H. Everaars. Reusable coordinator modules for massively concurrent applications. Software Practice and Experience, 28(7):703-735, 1998.

....A. Papadopoulos 9 executing halt. Preemption of Main from its begin state causes the breaking of the stream connections; the processes involved in the network will then detect the breaking of their incoming streams and will also terminate. More information on MANIFOLD can be found in [3,4,5,15]; note that MANIFOLD has already been implemented on top of PVM and has been successfully ported to a number of platforms including Sun, Silicon Graphics and IBM SP1, SP2 and RS 6000. 3 Modelling Activities in Distributed and Parallel Systems Using MANIFOLD The purpose of this section is to ....

F. Arbab, C. L. Blom, F. J. Burger and C. T. H. Everaars, "Reusable Coordinator Modules for Massively Concurrent Applications", Europar'96, Lyon, France, 27-29 Aug. 1996, LNCS 1123, Springer Verlag, pp. 664-677. [Extended version will appear as invited paper in a special issue of Theoretical Computer Science.]

....independently and is observed (if at all) by the other processes according to each observer s own sense of priorities. In this section we have deliberately presented MANIFOLD from the point of view of its underlying model (namely IWIM) More information on the actual language can be found in [4,5,6,23] and in the introduction of this special issue. We will also have the opportunity to present a number of features that the language supports while describing the examples in the main part of this paper. The purpose of the next two sections is to present a number of techniques which model a variety ....

F. Arbab, C. L. Blom, F. J. Burger and C. T. H. Everaars, "Reusable Coordinator Modules for Massively Concurrent Applications", Europar'96, Lyon, France, 27-29 Aug., 1996, LNCS 1123, Springer Verlag, pp. 664-677.

....process. The heart of the problem with respect to the existence of simple, yet reliable cost estimation at compile time is the choice of parallel programming model. By tradition, parallel programming models are focused on engineerability, exemplified by recent developments in coordination models [3, 8, 13]. Another focal point is expressiveness, i.e. the ability to express the inherent parallelism within the algorithm to the ultimate, which, for instance, has motivated recent extensions to the data parallel programming model [7, 12, 19] Less emphasis is usually put on what we like to call ....

....to expressiveness and performance analyzability. As mentioned in the introduction, many coordination models do not impose any restrictions with regard to expressiveness, such as the message oriented models (e.g. MPI [23] and related models aimed towards optimal engineerability (e.g. Manifold [3]) As mentioned in the rationale in Section 2, the problems due to the NSP synchronization structure that is possible as well as the low level at which scheduling non determinism is provided, effectively rule out symbolic cost estimation. On the other hand, synchronization restrictions as, e.g. ....

F. Arbab, C.L. Blom, F.J. Burger and C.T.H. Everaars, "Reusable coordinator modules for massively concurrent applications," in Proc. Europar'96 Vol. I, LNCS 1123, Lyon, Aug. 1996, pp. 664--677.

No context found.

Arbab F, Blom CL, Burger FJ, Everaars CTH. Reusable coordinator modules for massively concurrent applications. Software: Pract. Exp. 1998; 28(7):703--735. Extended version.

....and to interconnect and coordinate them for a particular application run. In the rest of this paper we describe the most notable elements of this executive program, using excerpts of the MANIFOLD source code. Since an introduction to MANIFOLD is presented elsewhere (see, e.g. reference [2]) only some additional language elements will be informally explained in this paper. The remainder of this paper is organized as follows. First, we give an overview of the executive program HYMAN describing the layout of the process table, how this table is constructed, and how it is used during ....

F. Arbab, C.L. Blom, F.J. Burger, and C.T.H. Everaars. Reusable coordinator modules for massively concurrent applications. Software: Practice and Experience, 28(7):703--735, June 1998. Extended version.

....advantages. One important advantage is that it results in a clear separation between the modules responsible for computation (the workers) and the modules responsible for coordination (the managers) This strengthens the modularity and enhances the re usability of both types of modules (see [20, 19, 21]) A MANIFOLD application consists of a (potentially very large) number of processes that run as threads bundled up (automatically or under user control) in one or more operating system level processes (called task instances in MANIFOLD) The di#erent task instances in a MANIFOLD application can ....

F. Arbab, C.L. Blom, F.J. Burger, and C.T.H. Everaars. Reusable coordinator modules for massively concurrent applications. Software: Practice and Experience, 28(7):703--735, June 1998. Extended version.

....these highly reusable generic manifolds are called manners. MANIFOLD has been successfully ported to a number of platforms including IBM SP1 SP2, Solaris 5.2, SGI 5.3 6.3 and Linux. Furthermore, it has been used with many conventional programming languages including C, C and Fortran ([7]) Recently it has been extended with real time capabilities ( 54] Its underlying coordination model IWIM ( 6] which is in fact independent of the actual language, has been shown to be applicable to other coordination models and frameworks ( 55, 56] 47 4. Comparison In the previous section ....

F. Arbab, C. L. Blom, F. J. Burger and C. T. H. Everaars, "Reusable Coordinator Modules for Massively Concurrent Applications", Europar'96, Lyon, France, 27--29 Aug., 1996, LNCS 1123, Springer Verlag, pp. 664--677.

....## in that, contrary to the # calculus, they do not involve the notion of a state. 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. The ## language is very similar to the verification modeling language Promela, used in SPIN, a tool for analyzing the logical consistency of distributed systems, ....

F. Arbab, C.L. Blom, F.J. Burger, and C.T.H. Everaars. Reusable coordinator modules for massively concurrent applications. Software: Practice and Experience 28:7, 1998, pp. 703-735.

.... of reusable pure coordination modules in MANIFOLD is demonstrated, e.g. by using (the object code of) the same MANIFOLD coordinator program that was developed for a parallel distributed bucket sort algorithm, to perform function evaluation and numerical optimisation using domain decomposition ([4, 11]) MANIFOLD possesses the following characteristics: Processes. A process is a black box with well defined ports of connection through which it exchanges units of information with the rest of the world. A process can be either a manager (coordinator) process or a worker. A manager process is ....

....note that MANIFOLD has already been implemented on top of PVM and has been successfully ported to a number of platforms including Sun, Silicon Graphics, Linux, and IBM AIX, SP1 and SP2. The language has been used successfully for, among others, coordinating parallel and distributed applications ([4, 11, 23, 25]) modelling activities in information systems ( 22] and expressing real time behaviour ( 15, 21, 3 Basic Concepts of the Configuration Paradigm and Relationship with Coordination The basic principles of configuration programming have been summarised in [13] as follows: i) The ....

F. Arbab, C. L. Blom, F. J. Burger and C. T. H. Everaars, "Reusable Coordinator Modules for Massively Concurrent Applications", Software: Practice and Experience 28 (7), 1998, pp. 703-735.

.... of reusable pure coordination modules in MANIFOLD is demonstrated, e.g. by using (the object code of) the same MANIFOLD coordinator program that was developed for a parallel distributed bucket sort algorithm, to perform function evaluation and numerical optimization using domain decomposition[7, 8, 22]. The MANIFOLD system runs on multiple platforms and consists of a compiler, a run time system library, a number of utility programs, and libraries of builtin and predefined processes of general interest. Presently, it runs on IBM RS6000 AIX, IBM SP1 2, Solaris, Linux, Cray YMP, and SGI IRIX. A ....

....p.out, q .in) str(s2:BK, q .out, p.in) end (#p, ftp) prc(r :Ftp, #) start(r) str(s3:BK, p.out, r .in) str(s4:BK, r .out, p.in) end Note that the process Server never ends. As our second example, we consider a simplified version of the real MANIFOLD program called ProtocolX in reference [8]. This program was originally developed to coordinate a dynamic data flow network of atomic processes to perform a distributed bucket sort. The separation of concerns principle of MANIFOLD implies that the actual computation (i.e. sorting) coordinated by this program is a completely irrelevant ....

[Article contains additional citation context not shown here]

Arbab, F., Blom, C., Burger, F., and Everaars, C. Reusable coordinator modules for massively concurrent applications. Software: Practice and Experience 28, 7 (June 1998), 703--735. Extended version.

.... of reusable pure coordination modules in MANIFOLD is demonstrated, e.g. by using (the object code of) the same MANIFOLD coordinator program that was developed for a parallel distributed bucket sort algorithm, to perform function evaluation and numerical optimization using domain decomposition[7, 8, 22]. The MANIFOLD system runs on multiple platforms and consists of a compiler, a run time system library, a number of utility programs, and libraries of builtin and predefined processes of general interest. Presently, it runs on IBM RS6000 AIX, IBM SP1 2, Solaris, Linux, Cray YMP, and SGI IRIX. A ....

Arbab, F., Blom, C., Burger, F., and Everaars, C. Reusable coordinator modules for massively concurrent applications. In Proceedings of Euro-Par '96 (August 1996), L. Bouge, P. Fraigniaud, A. Mignotte, and Y. Robert, Eds., vol. 1123 of Lecture Notes in Computer Science, Springer-Verlag, pp. 664--677.

....case a master worker model) 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) 6. Some Experiments In this section we describe a family of test assertions and show how we transform them into a family of closed quantified propositions. We also give the general format of these propositions, verify them, and give some performance results. 6.1 The Test ....

F. Arbab, C.L. Blom, F.J. Burger, and C.T.H. Everaars. Reusable coordinator modules for massively concurrent applications. In L. Bouge, P. Fraigniaud, A. Mignotte, and Y. Robert, editors, Proceedings of Euro-Par '96, volume 1123 of Lecture Notes in Computer Science, pages 664--677. Springer-Verlag, August 1996.

.... It is likely that some of such ideal managers, individually or collectively, can be used in other applications, coordinating very different worker processes, producing very different results; as long as their cooperation follows the same protocol, the same coordinator processes can be used (see [5] for more details and a concrete example) Modularity and re usability of the coordinator processes also enhance the re usability of the resulting software. ffl The IWIM pseudo code is easier to adapt to new requirements than the TSR pseudo code. The Targeted Send in the TSR pseudo code creates ....

....spite of its name, Eval knows nothing about evaluating functions What Eval embodies is, not any computation, but only a protocol that describes how instances of two process definitions (e.g. 4. Domain Decomposition 13 AtomicEval and Merger in our case) should communicate with each other (see [5] for a detailed treatment of this phenomenon) A logical consequence of this clear separation of coordination and computation concerns into distinct modules is that we can use this same protocol for a completely different pair of process definitions than AtomicEval and Merger. In fact, this same ....

[Article contains additional citation context not shown here]

F. Arbab, C.L. Blom, F.J. Burger, and C.T.H. Everaars. Reusable coordinator modules for massively concurrent applications. In Euro-Par '96, Lecture Notes in Computer Science. Springer-Verlag, August 1996.

.... of reusable pure coordination modules in MANIFOLD is demonstrated, e.g. by using (the object code of) the same MANIFOLD coordinator program that was developed for a parallel distributed bucket sort algorithm, to perform function evaluation and numerical optimization using domain decomposition[7,8,22]. The MANIFOLD system runs on multiple platforms and consists of a compiler, a run time system library, a number of utility programs, and libraries of builtin and predefined processes of general interest. Presently, it runs on IBM RS6000 AIX, IBM SP1 2, Solaris, Linux, Cray YMP, and SGI IRIX. A ....

....p:out; q :in) str(s2:BK; q :out; p:in) end (p ; ftp) prc(r :Ftp; start(r) str(s3:BK; p:out; r :in) str(s4:BK; r :out; p:in) end Note that the process Server never ends. As our second example, we consider a simplified version of the real MANIFOLD program called ProtocolX in reference [8]. This program was originally developed to coordinate a dynamic data flow network of atomic processes to perform a distributed bucket sort. The separation of concerns principle of MANIFOLD implies that the actual computation (i.e. sorting) coordinated by this program is a completely irrelevant ....

[Article contains additional citation context not shown here]

Arbab, F., Blom, C., Burger, F., and Everaars, C. Reusable coordinator modules for massively concurrent applications. Software: Practice and Experience 28, 7 (June 1998), 703--735. Extended version.

.... of reusable pure coordination modules in MANIFOLD is demonstrated, e.g. by using (the object code of) the same MANIFOLD coordinator program that was developed for a parallel distributed bucket sort algorithm, to perform function evaluation and numerical optimization using domain decomposition[7,8,22]. The MANIFOLD system runs on multiple platforms and consists of a compiler, a run time system library, a number of utility programs, and libraries of builtin and predefined processes of general interest. Presently, it runs on IBM RS6000 AIX, IBM SP1 2, Solaris, Linux, Cray YMP, and SGI IRIX. A ....

Arbab, F., Blom, C., Burger, F., and Everaars, C. Reusable coordinator modules for massively concurrent applications. In Proceedings of Euro-Par '96 (August 1996), L. Bouge, P. Fraigniaud, A. Mignotte, and Y. Robert, Eds., vol. 1123 of Lecture Notes in Computer Science, SpringerVerlag, pp. 664--677.

.... between computation modules (the master and the slave manifolds) and coordination modules (ProtocolMS) MANIFOLD, which is a pure coordination language that encourages this separation in computation and communication concerns, is a perfect language to implement such protocol libraries [4, 5]. Note that this way of working with a protocol library is completely analogous to the use of e.g. the qsort routine of the standard C library. This routine performs a quick sort algorithm on an array of any data type, and has a parameter which defines the sorting order. The user is free to ....

.... 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 different computations (the sparse grid and semi sparse grid application use the same protocol manifold, see also [5] for this notion of re usability) The performance evaluation of our test problem shows that MANIFOLD performs very well. ....

F. Arbab, C.L. Blom, F.J. Burger and C.T.H. Everaars, Reusable coordinator modules for massively concurrent applications, in: L. Bouge, P. Fraigniaud, A. Mignotte and Y. Robert, eds., Proceedings of Euro-Par '96, Lecture Notes in Computer Science, 1123 (Springer, Berlin, 1996) 664--677.

.... It is likely that some of such ideal managers, individually or collectively, can be used in other applications, coordinating very different worker processes, producing very different results; as long as their cooperation follows the same protocol, the same coordinator processes can be used (see [5] for more details and a concrete example) Modularity and re usability of the coordinator processes also enhance the re usability of the resulting software. ffl The IWIM pseudo code is easier to adapt to new requirements than the TSR pseudo code. The Targeted Send in the TSR pseudo code creates ....

....developed for one application can often be used in other parallel distributed applications with the same or similar cooperation protocol, regardless of the fact that the two applications may perform entirely different computations. A concrete example of this notion of re usability is discussed in [5]. The usefulness of the IWIM model and, in particular, the MANIFOLD language in these and other applications ( 8] 6] has been very encouraging. The plumbing paradigm inherent in IWIM makes it easy to compose and recompose a MANIFOLD application and adapt it to new requirements. To enhance the ....

F. Arbab, C.L. Blom, F.J. Burger, and C.T.H. Everaars. Reusable coordinator modules for massively concurrent applications. In Euro-Par '96, Lecture Notes in Computer Science. Springer-Verlag, August 1996.

....developed for one application can often be used in other parallel distributed applications with the same or similar cooperation protocol, regardless of the fact that the two applications may perform entirely different computations. A concrete example of this notion of re usability is discussed in [4]. The usefulness of the IWIM model and, in particular, the MANIFOLD language in these and other applications has been very encouraging. The plumbing paradigm inherent in IWIM makes it easy to compose and recompose a MANIFOLD application and adapt it to new requirements. To enhance the ....

F. Arbab, C.L. Blom, F.J. Burger, and C.T.H. Everaars. Reusable coordinator modules for massively concurrent applications. In submitted to Euro-Par '96, August 1996.

....these highly reusable generic manifolds are called manners. MANIFOLD has been successfully ported to a number of platforms including IBM SP1 SP2, Solaris 5.2, SGI 5.3 6.3 and Linux. Furthermore, it has been used with many conventional programming languages including C, C and Fortran ([7]) Recently it has been extended with real time capabilities ( 54] Its underlying coordination model IWIM ( 6] which is in fact independent of the actual language, has been shown to be applicable to other coordination models and frameworks ( 55,56] 4. Comparison In the previous section we ....

F. Arbab, C. L. Blom, F. J. Burger and C. T. H. Everaars, "Reusable Coordinator Modules for Massively Concurrent Applications", Europar'96, Lyon, France, 27-29 Aug., 1996, LNCS 1123, Springer Verlag, pp. 664-677.

.... its underlying model leads to separate pure computation and pure coordination modules, with only weak dependencies on their environment[2, 3] This significantly enhances the modularity of a MANIFOLD application and leads to increased re usability of both coordination as well as computation modules[7], and makes it an effective tool for restructuring of existing (sequential) software to run on parallel and or distributed platforms[8] The rest of this document is organized as follows. The basic concepts of MANIFOLD are described in x2. The MANIFOLD language constructs are described in x3 ....

F. Arbab, C. L. Blom, F. J. Burger, and C. T. H. Everaars, "Reusable coordinator modules for massively concurrent applications," in Proceedings of Euro-Par '96 (L. Bouge, P. Fraigniaud, A. Mignotte, and Y. Robert, eds.), vol. 1123 of Lecture Notes in Computer Science, pp. 664--677, Springer-Verlag, August 1996.

.... of reusable pure coordination modules in MANIFOLD is demonstrated, e.g. by using (the object code of) the same MANIFOLD coordinator program that was developed for a parallel distributed bucket sort algorithm, to perform function evaluation and numerical optimization using domain decomposition[7,23]. The MANIFOLD system runs on multiple platforms and consists of a compiler, a run time system library, a number of utility programs, and libraries of builtin and predefined processes of general interest. Presently, it runs on IBM RS6000 AIX, IBM SP1 2, Solaris, Linux, Cray YMP, and SGI IRIX. A ....

....q :in) str(s2:BK; q :out; p:in) end (p ; ftp req) prc(r :Ftp; start(r) str(s3:BK; p:out; r :in) str(s4:BK; r :out; p:in) end Note that the process Server never ends. As our second example, we consider a simplified version of the real MANIFOLD program called ProtocolX in reference [7]. This program was originally developed to coordinate a dynamic data flow network of atomic processes to perform a distributed bucket sort. The separation of concerns principle of MANIFOLD implies that the actual computation (i.e. sorting) coordinated by this program is a completely irrelevant ....

[Article contains additional citation context not shown here]

F. Arbab, C.L. Blom, F.J. Burger, and C.T.H. Everaars. Reusable coordinator modules for massively concurrent applications. Software: Practice and Experience, 28(7):703--735, 1998. Extended version.

....Instead, we point out that the majority of approaches encountered so far in using coordination languages as vehicles for developing such coordination frameworks are data driven and we show the benefits of using instead a control driven approach. 3 THE COORDINATION LANGUAGE MANIFOLD MANIFOLD ([4,5]) is a coordination language which, as opposed to the Linda family of coordination models described in the previous section, is control (rather than data ) driven, and is a realisation of a new type of coordination models, namely the Ideal Worker Ideal Manager (IWIM) one ( 3] MANIFOLD is by no ....

F. Arbab, C. L. Blom, F. J. Burger and C. T. H. Everaars, `Reusable Coordinator Modules for Massively Concurrent Applications', Europar'96, Lyon, France, 27-29 Aug. 1996, LNCS 1123, Springer Verlag, pp. 664-677.

.... separation between computation modules (the master and the worker manifolds) and coordination modules (ProtocolMW) MANIFOLD, as a pure coordination language that encourages this separation of computation and communication concerns, is a perfect language for implementing such protocol libraries [4, 5]. Note that this way of working with a protocol library is completely analogous to the use of, e.g. the qsort routine of the standard C library. This routine performs a quick sort algorithm on an array of any data type, and has a parameter which defines the sorting order. The user is free to ....

.... 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 different computations (the sparse grid and semi sparse grid applications use the same protocol manifold, see also [5] for this notion of re usability) The performance evaluation of our test problem shows that MANIFOLD performs very well. Acknowledgment The authors want to thank Farhad Arbab for his suggestions to improve this paper. ....

F. Arbab, C.L. Blom, F.J. Burger and C.T.H. Everaars, Reusable coordinator modules for massively concurrent applications, in: L. Bouge, P. Fraigniaud, A. Mignotte and Y. Robert, eds., Proceedings of Euro-Par '96, Lecture Notes in Computer Science, 1123 (Springer, Berlin, 1996) 664--677.

No context found.

F. Arbab, C. L. Blom, F. J. Burger, and C. T. H. Everaars. Reusable coordinator modules for massively concurrent applications. Software Practice and Experience, 28(7):703--735, 1998.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC