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

Authors:
Mohammed Eltayeb;Atakan Doğan;Füsun Özgüner
Affiliations:
Department of Electrical Engineering, The Ohio State University, 2015 Neil Avenue, Columbus, OH 43210, USA;Department of Electrical and Electronics Engineering, Anadolu University, 26470 Eskişehir, Turkey;Department of Electrical Engineering, The Ohio State University, 2015 Neil Avenue, Columbus, OH 43210, USA
Venue:
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Year:
2005

Citing 9
Cited 2

Path selection for message passing in a circuit-switched multicomputer

Journal of Parallel and Distributed Computing
A Mathematical Model and Scheduling Heuristics for Satisfying Prioritized Data Requests in an Oversubscribed Communication Network

IEEE Transactions on Parallel and Distributed Systems
High-performance remote access to climate simulation data: a challenge problem for data grid technologies

Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Distributed computing research issues in grid computing

ACM SIGACT News
Identifying Dynamic Replication Strategies for a High-Performance Data Grid

GRID '01 Proceedings of the Second International Workshop on Grid Computing
Data Intensive Distributed Computing; A Medical Application Example

HPCN Europe '99 Proceedings of the 7th International Conference on High-Performance Computing and Networking
A Distributed Vision Network for Industrial Packaging Inspection

HPCN Europe '99 Proceedings of the 7th International Conference on High-Performance Computing and Networking
Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications

HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Simulation of Dynamic Data Replication Strategies in Data Grids

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing

Performance of file replication policies for real-time file access in data grids

Proceedings of the first international conference on Networks for grid applications
Performance of real-time data scheduling heuristics under data replacement policies and access patterns in data grids

ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.