Efficient data consolidation in grid networks and performance analysis

P. Kokkinos, K. Christodoulopoulos, E. Varvarigos

Research output: Contribution to journalArticleResearchpeer-review

3 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)182-194
Number of pages13
JournalFuture Generation Computer Systems
Issue number2
Publication statusPublished - Feb 2011
Externally publishedYes


  • Data migration
  • Grids
  • Routing
  • Task scheduling

Cite this