research unit 1
 

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit Aigaion.nl.SourceForge.hetLogo

Publication

Type of publication:Article
Entered by:
TitleEfficient data consolidation in grid networks and performance analysis
Bibtex cite IDRACTI-RU1-2011-8
Journal Future Generation Computer Systems
Year published 2011
Month February
Volume 27
Number 2
Pages 182-194
DOI 10.1016/j.future.2010.08.005
Keywords Grids,Task scheduling,Data migration,Routing
Abstract
We examine a task scheduling and data migration problem for grid networks, which we refer to as the Data Consolidation (DC) problem. DC arises when a task concurrently requests multiple pieces of data, possibly scattered throughout the grid network, that have to be present at a selected site before the taskĘs execution starts. In such a case, the scheduler and the data manager must select (i) the data replicas to be used, (ii) the site where these data will be gathered for the task to be executed, and (iii) the routing paths to be followed; this is assuming that the selected datasets are transferred concurrently to the execution site. The algorithms or policies for selecting the data replicas, the data consolidating site and the corresponding paths comprise a Data Consolidation scheme. We propose and experimentally evaluate several DC schemes of polynomial number of operations that attempt to estimate the cost of the concurrent data transfers, to avoid congestion that may appear due to these transfers and to provide fault tolerance. Our simulation results strengthen our belief that DC is an important problem that needs to be addressed in the design of data grids, and can lead, if performed efficiently, to significant benefits in terms of task delay, network load and other performance parameters.
Authors
Kokkinos, Panagiotis
Christodoulopoulos, Konstantinos
Varvarigos, Emmanouel
Topics
Top
BibTeXBibTeX
RISRIS
Attachments
efficient data.pdf (main file)
 
Publication ID828