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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Theys, M.D., Tan, M., Beck, N., Siegel, H.J., Jurczyk, M.: A Mathematical Model and Scheduling Heuristic for Satisfying Prioritized Data Requests in an Oversubscribed Communication Network. IEEE Transactions on Parallel and Distributed Systems 11, 969–988 (2000)
Eltayeb, M., Doğan, A., Özgüner, F.: Concurrent Scheduling: Efficient Heuristics for Online Large-Scale Data Transfers in Distributed Real-Time Environments. IEEE Transactions on Parallel and Distributed Computing 17, 1348–1359 (2006)
Eltayeb, M., Doğan, A., Özgüner, F.: A Path Selection-Based Algorithm for Real-time Data Staging in Grid Applications. Journal of Parallel and Distributed Computing 65, 1318–1328 (2005)
Chervenak, A., Foster, I., Kesselman, C., Salisbury, C., Tuecke, S.: The Data Grid: Towards an Architecture for the Distributed Management and Analysis of Large Scientific Datasets. Journal of Network and Computer Applications 23, 187–200 (2000)
Ranganathan, K., Foster, I.: Simulation Studies of Computation and Data Scheduling Algorithms for Data Grids. Journal of Grid Computing 1, 63–74 (2003)
Camaron, D.G., Millar, A.P., Nicholson, C., Schiaffino, R.C., Zini, F., Stockinger, K.: Analysis of Scheduling and Replica Optimisation Strategies for Data Grids using OptorSim. Journal of Grid Computing 2, 57–69 (2004)
Camaron, D.G., Millar, A.P., Nicholson, C., Schiaffino, R.C., Zini, F., Stockinger, K.: Optorsim: A Simulation Tool for Scheduling and Replica Optimization in Data Grids. International Journal of High Performance Computing Applications 17, 403–416 (2003)
Ranganathan, K., Foster, I.: Identifying Dynamic Replication Strategies for a High-Performance Data Grid. In: Lee, C.A. (ed.) GRID 2001. LNCS, vol. 2242, pp. 75–86. Springer, Heidelberg (2001)
Lamehamedi, H., Shentu, Z., Szymanski, B., Deelman, E.: Simulation of Dynamic Data Replication Strategies in Data Grids. In: Heterogeneous Computing Workshop, p. 100b (2003)
GridPP Collaboration: GridPP: Development of the UK Computing Grid for Particle Physics. Journal of Physics G: Nuclear and Particle Physics, 32(1-20) (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Doğan, A. (2006). Performance of Real-Time Data Scheduling Heuristics Under Data Replacement Policies and Access Patterns in Data Grids. In: Guo, M., Yang, L.T., Di Martino, B., Zima, H.P., Dongarra, J., Tang, F. (eds) Parallel and Distributed Processing and Applications. ISPA 2006. Lecture Notes in Computer Science, vol 4330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11946441_79
Download citation
DOI: https://doi.org/10.1007/11946441_79
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68067-3
Online ISBN: 978-3-540-68070-3
eBook Packages: Computer ScienceComputer Science (R0)