A Fast and Efficient Algorithm for Topology-Aware Coallocation

Authors:
Valentin Kravtsov;Martin Swain;Uri Dubin;Werner Dubitzky;Assaf Schuster
Affiliations:
Technion-Israel Institute of Technology, Technion City, Haifa, Israel 32000;University of Ulster, Coleraine, Northern Ireland, UK BT52 1SA;Technion-Israel Institute of Technology, Technion City, Haifa, Israel 32000;University of Ulster, Coleraine, Northern Ireland, UK BT52 1SA;Technion-Israel Institute of Technology, Technion City, Haifa, Israel 32000
Venue:
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Year:
2008

Citing 9
Cited 3

A Graduated Assignment Algorithm for Graph Matching

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
Bayesian Graph Edit Distance

IEEE Transactions on Pattern Analysis and Machine Intelligence
Introduction to Algorithms

Introduction to Algorithms
Using Graph Search Techniques for Contextual Colour Retrieval

Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Improved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Graph Matching: A Fast Algorithm and Its Evaluation

ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2
The Representation and Matching of Pictorial Structures

IEEE Transactions on Computers

MPI Applications on Grids: A Topology Aware Approach

Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
A scheduling framework for large-scale, parallel, and topology-aware applications

Journal of Parallel and Distributed Computing
QCG-OMPI: MPI applications on grids

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modern distributed applications require coallocation of massive amounts of resources. Grid level allocation systems must efficiently decide where these applications can be executed. To this end, the resource requests are described as labeled graphs, which must be matched with equivalent labeled graphs of available resources. The coallocation problem described in the paper has real-world requirements and inputs that differ from those of a classical graph matching problem. We propose a new algorithm to solve the coallocation problem. The algorithm is especially tailored for medium to large grid systems, and is currently being integrated into the QosCosGrid system's allocation module.