Francisco Prieto-Castrillo, Antonio Astillero, Elena Rey-Espada, María Botón-Fernández, María Arsuaga-Ríos
International Journal of Complex Systems in Science, Volume 1, Issue 2, Interlude, 2011
pp. 89-95, ISSN: 2174-6036
Preliminary results for application workflow deployments over a simplified GRID with a complex, non-trivial communications network topology and a homogeneous computing capacity are addressed. Application workflows are modeled as Directed Acyclic Graphs (DAG) where communication costs are assumed to depend on the underlying network hopcount. A simple DAG model is implemented to deduce the applications’s overall makespan over a minimal GRID consisting on schedulers and computing resources uniformly deployed over the network.
The obtained network topology is built from an exhaustive set of active measurements on the Spanish e-Science GRID infrastructure. This results into a power-law degree distribution with a characteristic exponent of α = 2.87. Optimization criteria suggest that lower hierarchization schemes, where the distinction between scheduling and computing nodes vanishes, are preferable to the existing design.