2008
DOI: 10.1007/978-3-540-69384-0_33
|View full text |Cite
|
Sign up to set email alerts
|

A Fast and Efficient Algorithm for Topology-Aware Coallocation

Abstract: 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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2017
2017

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…QCG-OMPI features the necessary additions to the MPI language to present the topology chosen by the QosCosGrid metascheduler [30] to the application.…”
Section: Topology Adaptation Mechanismmentioning
confidence: 99%
“…QCG-OMPI features the necessary additions to the MPI language to present the topology chosen by the QosCosGrid metascheduler [30] to the application.…”
Section: Topology Adaptation Mechanismmentioning
confidence: 99%