Abstract
New distributed resources reservation algorithm for GRID presented. Set of preliminary conditions based on wave expansion of graphs, that reduce complexity of combinatorial part of algorithm proposed. Algorithm allows to handle any set of additional limits and reserved resources types in addition to processors productivity and networks connections bandwidths. Method for splitting high-dimensional problems into several problems of smaller size for large networks proposed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Foster, I., Roy, A., Sander, V.: A quality of service architecture that combines resource reservation and application adaptation. In: Proceedings of the 8th International Workshop on Quality of Service (IWQOS), Pittsburgh, pp. 181–188 (June 2000)
Sander, V.: A Metacomputer Architecture Based on Cooperative Resource Management. In: Proceedings of High Performance Computing and Networking Europe 1997 (HPCN 1997), Wien, April 28 - 30 (1997)
Berman, F., Wolski, R., Figueira, S., Schopf, J., Shao, G.: Application level scheduling on distributed heterogeneous networks. In: Proceedings of Supercomputing 1996 (1996)
Wandan, Z., Guiran, C., Dengke, Z., Xiuying, Z.: G-RSVPM: A Grid Resource Reservation Model, skg. In: First International Conference on Semantics, Knowledge and Grid (SKG 2005), p. 79 (2005)
Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: Performance evaluation of the VF Graph Matching Algoritmh. In: Proc. of the 10th ICIAP, pp. 1172–1177. IEEE Computer Society Press, Los Alamitos (1999)
Bunke, H., Vento, M.: Benchmarking of graph matching algorithms. In: Proceedings of the 2nd Workshop on Graph-based Representations, Haindorf, pp. 109–114 (1999)
Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: An improved algorithm for matching large graphs. In: Proceedings of the 3rd IAPR-TC-15 International Workshop on Graph-based Representations, Italy, pp. 149–159 (2001)
Foggia, P., Sansone, C., Vento, M.: A performance comparison of five algorithms for graph isomorphism. In: Proceedings of the 3rd IAPR-TC15 Workshop on Graph based Representation (GbR 2001), Italy (2001)
Il’yashenko, M.: Parallel subgraph isomorphism algorithm development and research. Radio electronics, Informatics, Management 1, 39–63 (2006)
Pinchuk, V.P.: Based on Wave Expansion System of the Invariants for Simple Graphs. - Summ. of Accept. Com. of Intern. Conf. In: Applied Modelling & Simulation AMS 1993, Ukraine, Lviv, september 30–october 2 (1993)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Il’yashenko, M. (2008). Distributed Resources Reservation Algorithm for GRID Networks. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2007. Lecture Notes in Computer Science, vol 4967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68111-3_98
Download citation
DOI: https://doi.org/10.1007/978-3-540-68111-3_98
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68105-2
Online ISBN: 978-3-540-68111-3
eBook Packages: Computer ScienceComputer Science (R0)