Performance of real-time data scheduling heuristics under data replacement policies and access patterns in data grids

Authors:
Atakan Doğan
Affiliations:
Department of Electrical and Electronics Engineering, Anadolu University, Eskişehir, Turkey
Venue:
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
Year:
2006

Citing 5
Cited 1

A Mathematical Model and Scheduling Heuristics for Satisfying Prioritized Data Requests in an Oversubscribed Communication Network

IEEE Transactions on Parallel and Distributed Systems
Identifying Dynamic Replication Strategies for a High-Performance Data Grid

GRID '01 Proceedings of the Second International Workshop on Grid Computing
Simulation of Dynamic Data Replication Strategies in Data Grids

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
A path selection-based algorithm for real-time data staging in Grid applications

Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Concurrent Scheduling: Efficient Heuristics for Online Large-Scale Data Transfers in Distributed Real-Time Environments

IEEE Transactions on Parallel and Distributed Systems

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

Proceedings of the first international conference on Networks for grid applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A variety of real-time data scheduling heuristics were proposed for distributed, data intensive real-time applications running on a distributed computing system. The proposed heuristics are used to produce real-time data dissemination schedules for the applications' requests for the data stored on the machines in the system. However, how these real-time data scheduling heuristics will perform for different data replacement policies and data access patterns is a question left unanswered. Based on this motivation, in this study, the performance of the two real-time data scheduling heuristics, namely the Full Path Heuristic and the Extended Partial Path Heuristic, are evaluated under different data replacement policies and data access patterns. A detailed set of simulation studies are presented to reveal how these algorithms are affected by the changes in the data replacement policy and data access pattern as well as the other system parameters of interest.