ALGORITHM FOR OPTIMAL RESERVATION OF DISTRIBUTED COMPUTING RESOURCES BASED ON THE CRITERION OF EFFICIENT USE OF COMPUTING NODES
DOI:
https://doi.org/10.15588/1607-3274-2007-2-13Abstract
This paper presents algorithm for optimal distributed resources reservation, that allow to find reservation areas according to minimal amount of used computational nodes optimization criteria and maximal productivity usage of equipped computational nodes criteria. Paper contains detailed algorithm description, including set of preliminary conditions that reduce computational complexity of enumerating part of algorithm.
References
I. Foster, A. Roy, and V. Sander. A quality of service architecture that combines resource reservation and application adaptation // Proceedings of the 8th International Workshop on Quality of Service (IWQOS). – Pittsburgh, PA. – June 2000. – P. 181–188.
Sander V. A Metacomputer Architecture Based on Cooperative Resource Man-agement // Proceedings of High Performance Computing and Networking Europe 1997 (HPCN 1997). – Wien. – April (1997). – P. 28–30.
F. Berman, R. Wolski, S. Figueira, J. Schopf, and G. Shao. Application level scheduling on distributed heterogeneous networks. // Proceedings of Supercomputing – 1996. – P. 39.
Zeng Wandan, Chang Guiran, Zhang Dengke, Zheng Xiuying. G-RSVPM: A Grid Resource Reservation Model // First International Conference on Semantics, Knowledge and Grid (SKG'05). – Guilin Guanxi, China – 2005. – P. 79.
L. P. Cordella, P. Foggia, C. Sansone, M. Vento. Performance evaluation of the VF Graph Matching Algoritmh // Proc. of the 10th ICIAP, IEEE Com-puter Society Press. – 1999. – P. 1172–1177.
Bunke H., Vento M. Benchmarking of graph matching algorithms. // Proceedings of the 2nd Workshop on Graphbased Representations. – Haindorf. – 1999. – P. 109–114.
Cordella L. P., Foggia P., Sansone C., Vento M. An improved algorithm for matching large graphs. // Proc. of the 3rd IAPR TC-15 Workshop on Graph-based Representations in Pattern Recognition. – Italy. – 2001. – P. 149–159.
P. Foggia, C. Sansone, M. Vento. A performance comparison of five algorithms for graph isomorphism. // Proc. of Il'yashenko M. B. Razrabotka i issledovaniye parallel'nogo algoritma proverki graf-podgraf izomorfizma. // Radioelektronika. Informatika. Upravleniye. – 2006. – № 1. – S. 63–69.
Pinchuk V. P. Tablichnyye invarianty na grafakh i ikh primeneniye // Kibernetika i sistemnyy analiz. – 2001. – № 4. – S. 33–45.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2014 М. B. Ilyashenko
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Creative Commons Licensing Notifications in the Copyright Notices
The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.
The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.
The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.
Authors who publish with this journal agree to the following terms:
-
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
-
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
-
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
