Abstract
Efficient data scheduling in Grid environments is becoming a seemingly important issue for distributed real-time applications that produce and process huge datasets. Thus, in this paper, we consider the data scheduling problem so as to provide reliable dissemination of large-scale datasets 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 (LCSP or SLCP). The simulation results show that our algorithm outperforms the algorithms existing in the literature.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Meliones, A., Baltas, D., Kammenos, P., Spinnler, K., Kuleschow, A., Vardangalos, G., Lambadaris, P.: A Distributed Vision Network for Industrial Packaging Inspection. In: High Performance Computing and Networking, pp. 1303–1307 (1999)
Thomas, A., Rodd, M., Holt, J., Neill, C.: Real-Time Industrial Visual Inspection: A Review. Journal of Real-Time Imaging, 139–158 (1995)
Lee, J., Tierney, B., Johnston, W.: Data Intensive Distributed Computing: A Medical Application Example. In: High Performance Computing and Networking Conference (1999)
Shukla, S.B., Agrawal, D.P.: Scheduling Pipelined Communication in Distributed Memory Multiprocessors for Real-time Applications. In: Annual International Symposium on Computer Architecture, pp. 222–231 (1991)
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 Transaction on Parallel and Distributed Systems 11(9), 969–988 (2000)
Eltayeb, M.: Do an, A., Özgüner, F.: Concurrent Scheduling for Real-time Staging in Oversubscribed Networks. In: The 16th International Conference on Parallel and Distributed Computing Systems (2003)
Eltayeb, M., Doan, A., Özgüner, F.: Extended Partial Path Heuristic for Real-time Staging in Oversubscribed Networks. In: The 18th International Symposium on Computer and Information Sciences (2003)
Lamehamedi, H., Shentu, Z., Szymanski, B. K., Deelman, E.: Simulation of Dynamic Data Replication Strategies in Data Grids. In: The Int’l Parallel and Distributed Processing Symposium (2003)
Ranganathan, K., Foster, I.: Decoupling Computation and Data Scheduling in Distributed Data Intensive Applications. In: The 11th Int’l Symposium for High Performance Distributed Computing (2002)
Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)
Eltayeb, M., Doan, A., Özgüner, F.: A Data Scheduling Algorithm for Autonomous Distributed Real-Time Applications in Grid Computing. In: Int’l Conf. on Parallel Processing (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eltayeb, M., Doğan, A., Özgüner, F. (2004). A Path Selection Based Algorithm for Maximizing Self-satisfiability of Requests in Real-Time Grid Applications. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds) Euro-Par 2004 Parallel Processing. Euro-Par 2004. Lecture Notes in Computer Science, vol 3149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27866-5_61
Download citation
DOI: https://doi.org/10.1007/978-3-540-27866-5_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22924-7
Online ISBN: 978-3-540-27866-5
eBook Packages: Springer Book Archive