Pascal Bouvry Franciszek Seredynski and Farhad Arbab. Parallel and distributed evolutionary computation with manifold., September 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....a service provider (EXAMINE) 16] These two capabilities used in concert allow for scheduling a program with more confidence in execution time. Other coordination languages such as MANIFOLD are appropriate for this type of composition, but lack the EXAMINE and ESTIMATE primitives found in CLAM [17,18]. The current supported runtime system for CHAIMS is known CPAM (CHAIMS Protocol for Autonomous Megamodules) 19] The protocol removes the barriers imposed by different programming languages and distribution protocols, while providing support for the scheduling primitives in CLAM. Programs ....

F. Seredynski, P. Bouvry, and F. Arbab, "Parallel and distributed evolutionary computation with Manifold," In V. Malyshkin, editor, Proceedings of PaCT-97, volume 1277 of Lecture Notes in Computer Science, pages 94--108. Springer-Verlag, September 1997.

.... MANIFOLD has been successfully used in a number of applications, including in parallelization of a real life, heavy duty Computational Fluid Dynamics algorithm originally written in Fortran77 [8, 9, 18] and implementation of Loosely Coupled Genetic Algorithms on parallel and distributed platforms [31, 33, 32]. 3.2 BALI In MANIFOLD Although BALI solvers are black boxes and are heterogeneous, this does not cause any problems for MANIFOLD, because it integrates the solvers as external workers. Thus, communication and coordination can be defined among them in the same way as with normal MANIFOLDagents. ....

Seredynski, F., Bouvry, P., and Arbab, F. Parallel and distributed evolutionary computation with Manifold. In Proc. of Fourth International Conference on Parallel Computing Technologies (PaCT-97) (Yaroslavl, Russia, Sep. 1997), Lecture Notes in Computer Science, Springer Verlag. (to appear).

.... been used in a number of real applications, e.g. implementing parallel and distributed versions of a semi coarsened multi grid Euler solver algorithm[23, 24] modeling cooperative Information Systems[37, 38] coordination of Loosely Coupled Genetic Algorithms on parallel and distributed platforms[42, 43]; coordination of multiple solvers in a concurrent constraint programming system[11] and coordination of a distributed propositional theorem checker [25] Di#erences between MANIFOLD and its kernel Some of the features of MANIFOLD have been left out of the kernel language that is the subject of ....

Seredynski, F., Bouvry, P., and Arbab, F. Parallel and distributed evolutionary computation with Manifold. In Proceedings of PaCT-97 (September 1997), V. Malyshkin, Ed., vol. 1277 of Lecture Notes in Computer Science, Springer-Verlag, pp. 94--108.

.... MANIFOLD has been successfully used in a number of applications, including in parallelization of a real life, heavy duty Computational Fluid Dynamics algorithm originally written in Fortran77 [6, 7, 15] and implementation of LooselyCoupled Genetic Algorithms on parallel and distributed platforms [24, 26, 25]. 3.2 BALI In MANIFOLD Although BALI solvers are black boxes and are heterogeneous, this does not cause any problem for MANIFOLD: it integrates the solvers as external workers. Then, communication and coordination can be defined among them in the same way as with common agents. MANIFOLD can ....

Seredynski, F., Bouvry, P., and Arbab, F. Parallel and distributed evolutionary computation with Manifold. In Proc. of Fourth International Conference on Parallel Computing Technologies (PaCT-97) (Yaroslavl, Russia, Sep. 1997), LNCS, Springer Verlag. (to appear).

.... been used in a number of real applications, e.g. implementing parallel and distributed versions of a semi coarsened multi grid Euler solver algorithm[23,24] modeling cooperative Information Systems[37,38] coordination of Loosely Coupled Genetic Algorithms on parallel and distributed platforms [42,43]; coordination of multiple solvers in a concurrent constraint programming system[11] and coordination of a distributed propositional theorem checker [25] Differences between MANIFOLD and its kernel Some of the features of MANIFOLD have been left out of the kernel language that is the subject of ....

Seredynski, F., Bouvry, P., and Arbab, F. Parallel and distributed evolutionary computation with Manifold. In Proceedings of PaCT-97 (September 1997), V. Malyshkin, Ed., vol. 1277 of Lecture Notes in Computer Science, Springer-Verlag, pp. 94--108.

.... been used in a number of real applications, e.g. implementing parallel and distributed versions of a semi coarsened multi grid Euler solver algorithm[24,25] modeling cooperative Information Systems[37,38] coordination of Loosely Coupled Genetic Algorithms on parallel and distributed platforms[41]; coordination of multiple solvers in a concurrent constraint programming system[10] and coordination of a distributed propositional theorem checker [26] Differences between MANIFOLD and its kernel Some of the features of MANIFOLD have been left out of the kernel language that is the subject of ....

F. Seredynski, P. Bouvry, and F. Arbab. Parallel and distributed evolutionary computation with Manifold. In V. Malyshkin, editor, Proceedings of PaCT '97, volume 1277 of Lecture Notes in Computer Science, pages 94--108. SpringerVerlag, 1997.

.... MANIFOLD has been successfully used in a number of applications, including in parallelization of a real life, heavy duty Computational Fluid Dynamics algorithm originally written in Fortran77 [8, 9, 18] and implementation of LooselyCoupled Genetic Algorithms on parallel and distributed platforms [31, 33, 32]. 3.2 BALI In MANIFOLD Although BALI solvers are black boxes and are heterogeneous, this does not cause any problems for MANIFOLD, because it integrates the solvers as external workers. Thus, communication and coordination can be defined among them in the same way as with normal MANIFOLDagents. ....

Seredynski, F., Bouvry, P., and Arbab, F. Parallel and distributed evolutionary computation with Manifold. In Proc. of Fourth International Conference on Parallel Computing Technologies (PaCT-97) (Yaroslavl, Russia, Sep. 1997), Lecture Notes in Computer Science, Springer Verlag. (to appear).

....output ports of themselves connected to input ports of other agents, thus employing a certain form of limited broadcasting. This new model is referred to as Ideal Worker Ideal Manager (IWIM, 3] Although a direct realisation of IWIM in terms of a concrete coordination language does already exist ([5, 10]) we argue that the underlying principles can be applied to other similar models. We demonstrate our point by comparing our model with a state of the art coordination framework, namely the Linda type Shared Dataspace model, and we show how the functionality of the former can be embedded into the ....

....means of channels. Note also that not only Prod and Cons need not know anything about each other, but also Coord need not know about the actual functionality of the processes it coordinates. The IWIM model has already been implemented by means of a concrete coordination language, namely MANIFOLD ([3, 4, 5, 10]) however, as we have already said its principles apply to other coordination languages and the rest of this paper will illustrate this point. 3 Comparison with Shared Dataspace and IWIM Linda The notion of a conceptually shared dataspace via which concurrently executing agents exchange messages ....

F. Seredynski, P. Bouvry and F. Arbab, "Parallel and Distributed Evolutionary Computation with MANIFOLD", Fourth International Conference on Parallel Computing Technologies (PaCT-97) , Yaroslavl, Russia, 8-12 Sept., 1997, LNCS, Springer Verlag (these proceedings).

No context found.

Pascal Bouvry Franciszek Seredynski and Farhad Arbab. Parallel and distributed evolutionary computation with manifold., September 1997.

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