Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-69384-0_33 | ICCS (1) |
Keywords | Field | DocType |
efficient algorithm,available resource,grid level allocation system,allocation module,qoscosgrid system,coallocation problem,new algorithm,large grid system,real-world requirement,classical graph,topology-aware coallocation,massive amount,graph matching,distributed application | Graph,Mathematical optimization,Computer science,Algorithm,Matching (graph theory),Grid system,Grid,Distributed computing | Conference |
Volume | ISSN | Citations |
5101 | 0302-9743 | 4 |
PageRank | References | Authors |
0.50 | 8 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Valentin Kravtsov | 1 | 76 | 5.24 |
| Martin Swain | 2 | 68 | 5.46 |
| Uri Dubin | 3 | 4 | 0.50 |
| Werner Dubitzky | 4 | 435 | 50.31 |
| Assaf Schuster | 5 | 2304 | 145.56 |