Distributed resources reservation algorithm for GRID networks

Authors:
Matviy Il'yashenko
Affiliations:
Zaporozhye National Technical University, Computer systems and Networks department, Zaporozhye, Ukraine
Venue:
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Year:
2007

Citing 4
Cited 0

Application-level scheduling on distributed heterogeneous networks

Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
A Metacomputer Architecture Based on Cooperative Resource Management

HPCN Europe '97 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Performance Evaluation of the VF Graph Matching Algorithm

ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
G-RSVPM: A Grid Resource Reservation Model

SKG '05 Proceedings of the First International Conference on Semantics, Knowledge and Grid

Quantified Score

Hi-index	0.00

Visualization

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.