Hierarchical Scheduling in Parallel and Cluster Systems

2003
ISBN: 978-0-306-47761-4
Verlag: Springer US

Buch, Englisch, 251 Seiten, HC runder Rücken kaschiert, Format (B × H): 160 mm x 241 mm, Gewicht: 1260 g

Reihe: Series in Computer Science

Multiple processor systems are an important class of parallel systems. Over the years, several architectures have been proposed to build such systems to satisfy the requirements of high performance computing. These architectures span a wide variety of system types. At the low end of the spectrum, we can build a small, shared-memory parallel system with tens of processors. These systems typically use a bus to interconnect the processors and memory. Such systems, for example, are becoming commonplace in high-performance graph­ ics workstations. These systems are called uniform memory access (UMA) multiprocessors because they provide uniform access of memory to all pro­ cessors. These systems provide a single address space, which is preferred by programmers. This architecture, however, cannot be extended even to medium systems with hundreds of processors due to bus bandwidth limitations. To scale systems to medium range i. e., to hundreds of processors, non-bus interconnection networks have been proposed. These systems, for example, use a multistage dynamic interconnection network. Such systems also provide global, shared memory like the UMA systems. However, they introduce local and remote memories, which lead to non-uniform memory access (NUMA) architecture. Distributed-memory architecture is used for systems with thousands of pro­ cessors. These systems differ from the shared-memory architectures in that there is no globally accessible shared memory. Instead, they use message pass­ ing to facilitate communication among the processors. As a result, they do not provide single address space.

Zielgruppe

Research

Autoren/Hrsg.

Dandamudi, Sivarama

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Funktionale, Logische, Parallele und Visuelle Programmierung
• Mathematik | Informatik EDV | Informatik Technische Informatik Hochleistungsrechnen, Supercomputer
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik EDV | Informatik Technische Informatik Systemverwaltung & Management
• Mathematik | Informatik EDV | Informatik Technische Informatik Externe Speicher & Peripheriegeräte
• Mathematik | Informatik EDV | Informatik Daten / Datenbanken Automatische Datenerfassung, Datenanalyse
• Mathematik | Informatik EDV | Informatik Betriebssysteme Windows Betriebssysteme

Inhaltsverzeichnis

I: Background.- 1. Introduction.- 2. Parallel and Cluster Systems.- 3. Parallel Job Scheduling.- II: Hierarchical Task Queue Organization.- 4. Hierarchical Task Queue Organization.- 5. Performance of Scheduling Policies.- 6. Performance with Synchronization Workloads.- III: Hierarchical Scheduling Policies.- 7. Scheduling in Shared-Memory Multiprocessors.- 8. Scheduling in Distributed-Memory Multicomputers.- 9. Scheduling in Cluster Systems.- IV: Epilog.- 10. Conclusions.- References.