Lavoisier S.A.S.
14 rue de Provigny
94236 Cachan cedex
FRANCE

Heures d'ouverture 08h30-12h30/13h30-17h30
Tél.: +33 (0)1 47 40 67 00
Fax: +33 (0)1 47 40 67 02


Url canonique : www.lavoisier.fr/livre/autre/hierarchical-scheduling-in-parallel-and-cluster-systems/dandamudi/descriptif_1238383
Url courte ou permalien : www.lavoisier.fr/livre/notice.asp?ouvrage=1238383

Hierarchical Scheduling in Parallel and Cluster Systems, Softcover reprint of the original 1st ed. 2003 Series in Computer Science Series

Langue : Anglais

Auteur :

Couverture de l’ouvrage Hierarchical Scheduling in Parallel and Cluster Systems
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.
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.

Date de parution :

Ouvrage de 251 p.

15.5x23.5 cm

Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).

158,24 €

Ajouter au panier

Date de parution :

Ouvrage de 130 p.

22.9x15.2 cm

Sous réserve de disponibilité chez l'éditeur.

Prix indicatif 163,47 €

Ajouter au panier