http://adage.gforge.inria.fr/ 2010-03-22T05:36:56+01:00 http://adage.gforge.inria.fr/ http://adage.gforge.inria.fr/lib/images/favicon.ico text/html 2009-05-14T10:57:28+01:00 Christian Perez http://adage.gforge.inria.fr/doku.php?id=plugin:ccm&rev=1242291448&do=diff This plugin is based the CORBA Component Model specification V3.0 of the OMG, described in the document 02-06-65. Moreover, it supports basic form of parallel component as described here. Current Support See this page for the supported feature of CCM. text/html 2009-04-20T15:11:53+01:00 Christian Perez http://adage.gforge.inria.fr/doku.php?id=doc:devel&rev=1240233113&do=diff Communicating with the daemon The adage daemon can support various communication protocols. Currently, two protocols have been implemented: the command line and a basic socket based protocols. Command line protocol This protocol is internal to ADAGE. It build the command to the adage daemon based on the arguments given on the command line. In particular, the daemon is ended when all commands have been executed. text/html 2009-04-20T14:00:05+01:00 Christian Perez http://adage.gforge.inria.fr/doku.php?id=start&rev=1240228805&do=diff News * 03/11/2008 : Adage 0.5 has been released ! Get it (and the needed/associated planners & plugins) from our Gforge download area. * 18/03/2008 : Adage 0.4 has been released ! * 18/12/2007 : Adage 0.3 has been released ! * 24/09/2007 : Adage 0.2 has been released ! text/html 2009-04-16T14:30:23+01:00 Christian Perez http://adage.gforge.inria.fr/doku.php?id=plugin:dhico&rev=1239885023&do=diff This plugin aims at deploying applications making use of dhico, an implementation of the DISCOGRID API, a kind of hierarchical MPI, developed within the French DISCOGRID ANR project. Limitation of this plugin The plugin currently only supports simple hierarchy, made of at most a socket group and 0 or more MPI groups. text/html 2009-04-15T17:38:57+01:00 Christian Perez http://adage.gforge.inria.fr/doku.php?id=planner:simple&rev=1239809937&do=diff Two basic planners -- round robin greedy and random -- have been implemented. They share a lot of code. Round robin greedy takes node in a round robin fashion but it sorts candidates nodes in a decreasing load order. The load is just the number of prog_group elements (of all pgs) already associated to this node.