Track Order   | Customer Support   | Request Book   |
International Order
Hierarchical Scheduling In Parallel And Cluster Systems 2003 Edition at Meripustak

Hierarchical Scheduling In Parallel And Cluster Systems 2003 Edition

Books from same Author: Sivarama Dandamudi

Books from same Publisher: Springer

Related Category: Author List / Publisher List

  • Retail Price: ₹ 16630/- [ 0.00% off ]

    Seller Price: ₹ 16630

Sold By: T K Pandey      Click for Bulk Order

Offer 1: Get ₹ 111 extra discount on minimum ₹ 500 [Use Code: Bharat]

Offer 2: Get 0.00 % + Flat ₹ 100 discount on shopping of ₹ 1500 [Use Code: IND100]

Offer 3: Get 0.00 % + Flat ₹ 300 discount on shopping of ₹ 5000 [Use Code: MPSTK300]

Free Shipping (for orders above ₹ 499) *T&C apply.

In Stock

Free Shipping Available


Click for International Orders
  • Provide Fastest Delivery
  • 100% Original Guaranteed
    • General Information  
    Author(s)Sivarama Dandamudi
    PublisherSpringer
    ISBN9780306477614
    Pages251
    BindingHardback
    LanguageEnglish
    Publish YearJune 2003

    Description

    Springer Hierarchical Scheduling In Parallel And Cluster Systems 2003 Edition by Sivarama Dandamudi

    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. Table of contents : 1. Introduction. 2. Parallel and Cluster Systems. 3. Parallel Job Scheduling. 4. Hierarchical Task Queue Organization. 5. Performance of Scheduling Policies. 6. Performance with Synchronization Workloads. 7. Scheduling in Shared-Memory Multiprocessors. 8. Scheduling in Distributed-Memory Multiprocessors. 9. Scheduling in Cluster Systems. 10. Conclusions.