Benutzer: Gast  Login
Originaltitel:
Efficient Algorithms for On-Line Scheduling and Load Distribution in Parallel Systems 
Jahr:
1999 
Dokumenttyp:
Dissertation 
Institution:
Fakultät für Informatik 
Betreuer:
Mayr, Ernst W. (Prof.Dr.) 
Gutachter:
Zenger, Christoph (Prof. Dr.); Woeginger, Gerhard J. (Prof.Dr.) 
Format:
Text 
Sprache:
en 
Fachgebiet:
DAT Datenverarbeitung, Informatik 
Stichworte:
on-line; algorithm; scheduling; parallel job; task; makespan; UET; hypercube; array; mesh; load-balancing; bisector; bisection; partitioning; upper bound; lower bound; weighted tree; distributed finite element simulation; recursive substructuring; domain decomposition; average-case; martingale; concentration 
Schlagworte (SWD):
Parallelverarbeitung; Scheduling 
TU-Systematik:
DAT 216d 
Kurzfassung:
The efficient operation of parallel computing systems requires the best possible use of the resources that a system provides. In order to achieve an effective utilization of a parallel machine a smart coordination of the resource demands of all currently operating applications is necessary. Dynamic resource management is particularly essential for the parallel solution of irregular problems that arise frequently, for example, during numerical simulations. On-line scheduling and load distribution...    »
 
Übersetzte Kurzfassung:
[Abstract nur auf Englisch verfügbar.] The efficient operation of parallel computing systems requires the best possible use of the resources that a system provides. In order to achieve an effective utilization of a parallel machine a smart coordination of the resource demands of all currently operating applications is necessary. Dynamic resource management is particularly essential for the parallel solution of irregular problems that arise frequently, for example, during numerical simulations. O...    »
 
Veröffentlichung:
Universitätsbibliothek der TU München 
Mündliche Prüfung:
09.09.1999 
Dateigröße:
3195915 bytes 
Seiten:
194 
Letzte Änderung:
26.06.2007