direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments


Mapping Algorithms Optimizing the Overall Manhattan Distance for pre-occupied Cluster Computers in SLA-based Grid environments
Zitatschlüssel linnert2014a
Autor Barry Linnert and Jörg Schneider and Lars-Olof Burchard
Buchtitel 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2014)
Jahr 2014
Ort Chicago
Monat 5
Verlag IEEE CS Press
Wie herausgegeben accepted
Zusammenfassung Grid applications are more and more widely used nowadays. One of the major challenges is to provide a reliable and predictable platform for computations of various kinds. In order to overcome this challenge, Grid management systems such as the virtual resource manager (VRM) implement scheduling and mapping algorithms at level of the local management systems with support for resource reservation in advance. In this paper, we examine three different mapping algorithms for supercomputers and cluster systems with respect to execution time and the achieveable performance regarding important metrics such as overall Manhattan distance and achievable utilization. The results show the importance of carefully implementing scheduling and mapping algorithms in Grid environments.
Download Bibtex Eintrag

Zusatzinformationen / Extras


Schnellnavigation zur Seite über Nummerneingabe


Jörg Schneider