A path selection-based algorithm for real-time data staging in Grid applications

Eltayeb M., Dogan A., Ozguner F.

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, vol.65, no.11, pp.1318-1328, 2005 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 65 Issue: 11
  • Publication Date: 2005
  • Doi Number: 10.1016/j.jpdc.2005.05.027
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.1318-1328
  • Keywords: data-intensive and real-time applications, data staging, data scheduling, blocking analysis, concurrency in scheduling
  • Anadolu University Affiliated: No


Efficient data scheduling is becoming an important issue in distributed real-time applications that produce huge data sets. The Grid environment on which these applications may run seeks to harness the geographically distributed resources for the applications. Scheduling components should account for real-time measures of the applications and reduce communication overhead due to enormous data size experienced, especially in dissemination applications. In this study, we consider the data staging scheme to provide the dissemination of large-scale data sets for the distributed real-time applications. We propose a new path selection-based algorithm for optimizing a criterion that reflects the general satisfiability of the system. The algorithm adopts a blocking-time analysis method combined with a simple heuristic to explore the most likely regions of a search space. Two heuristics are provided for the algorithm to explore these regions of the search space. Simulation results show that the proposed algorithm together with either of the heuristic has higher performance compared to other algorithms in the literature. We also show by simulation that a new optimization criterion we proposed in this study is successful in improving the performance of the individual applications. (c) 2005 Elsevier Inc. All rights reserved.