Abstract
In this paper we propose the use of the PPH as a base for an offline schedule method to detect unsatisfiable requests in a staging system. This property allows a reduction in the overhead of transferring data-items with deadlines in a real-time environment, through paths rearrangement. The EPP heuristic allows early detection of eventually, non-satisfied, requests based on their urgencies. Early detection and dropping of these requests also reduces the latencies of the satisfied requests. We show analytically and experimentally that the performance of the EPP heuristic is at least equivalent to the previous PPH proposed for data-staging problem in real-time environments.
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.T., Beck, N., Siegel, H.J., Jurczyk, M.: A Mathematical Model and Scheduling Heuristics for Satisfying Prioritized Data Requests in an Oversubscribed Communication Network. IEEE Trans. Parallel and Distributed Systems 11(9) (2000)
Jones, P.C., Lowe, T.J., Muller, G., Xu, N., Ye, Y., Zydiak, J.L.: Specially Structured Uncapacitated Facility Location Problem. Operation Research 43(4), 661–669 (1995)
Pinedo, M.: Scheduling Theory, Algorithms and Systems. Prentice Hall, Englewood Cliffs (1995)
Lee, J., Tierney, B., Johnston, W.: Data Intensive Distributed Computing: A medical Application Example. Proceedings of the IEEE Supercomputing (1997)
Allcock, B., Foster, I., Nefedova, V., Chervenak, A., Deelman, E., Kesselman, C., Lee, J., Sim, A., Shshani, A., Drach, B., Williams, D.: High Performance Remote Access to Climate Simulation Data: A Challenge Problem for Data Grid Technologies. Argonne National Laboratory (2001)
Shirdhar, B., Dharma, S., Agrawal, P.: Scheduled Pipelined Communication in Distributed Memory Multiprocessors for Real-time Applications. In: The 18th Annual International Symposium on Computer Architecture, pp. 222–231 (1991)
Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)
Eltayeb, M., Doğan, A., Özgiiner, F.: Concurrent Scheduling for Real-time Staging in Oversubscribed networks. In: The 16th International Conference on Parallel and Distributed Computing Systems (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eltayeb, M., Doğan, A., Özgüner, F. (2003). Extended Partial Path Heuristic for Real-Time Staging in Oversubscribed Networks. In: Yazıcı, A., Şener, C. (eds) Computer and Information Sciences - ISCIS 2003. ISCIS 2003. Lecture Notes in Computer Science, vol 2869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39737-3_117
Download citation
DOI: https://doi.org/10.1007/978-3-540-39737-3_117
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20409-1
Online ISBN: 978-3-540-39737-3
eBook Packages: Springer Book Archive