Feitelson, Dror G.

Job Scheduling Strategies for Parallel Processing IPPS '95 Workshop Santa Barbara, CA, USA, April 25, 1995 Proceedings / [electronic resource] : edited by Dror G. Feitelson, Larry Rudolph. - Berlin, Heidelberg : Springer Berlin Heidelberg, 1995. - VIII, 368 p. online resource. - Lecture Notes in Computer Science, 949 0302-9743 ; . - Lecture Notes in Computer Science, 949 .

Parallel job scheduling: Issues and approaches -- Scheduling on the Tera MTA -- A scalable multi-discipline, multiple-processor scheduling framework for IRIX -- Scheduling to reduce memory coherence overhead on coarse-grain multiprocessors -- Time Space Sharing Scheduling and architectural support -- Demand-based coscheduling of parallel jobs on multiprogrammed multiprocessors -- Multiprocessor scheduling for high-variability service time distributions -- The interaction between memory allocation and adaptive partitioning in message-passing multicomputers -- Analysis of non-work-conserving processor partitioning policies -- Loop-Level Process Control: An effective processor allocation policy for multiprogrammed shared-memory multiprocessors -- A microeconomic scheduler for parallel computers -- On the benefits and limitations of dynamic partitioning in parallel computer systems -- Intelligent fuzzy control to augment scheduling capabilities of network queuing systems -- Parallel processing on dynamic resources with CARMI -- Job scheduling under the Portable Batch System -- The ANL/IBM SP scheduling system -- Requirements of the Cornell Theory Center for resource management and process scheduling -- Job management requirements for nas parallel systems and clusters -- Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860.

This volume contains the papers selected after a very careful refereeing process for presentation during the Workshop on Job Scheduling Stategies for Parallel Processing, held in Santa Barbara, California, as a prelude to the IPPS '95 conference in April 1995. The 19 full papers presented demonstrate that parallel job scheduling takes on a crucial role as multi-user parallel supercomputers become more widespread. All aspects of job scheduling for parallel systems are covered, from the perspectives of academic research, industrial design of parallel systems, as well as user needs. Of particular interest, also for nonexpert readers, is the introductory paper "Parallel Job Scheduling: Issues and Approaches" by the volume editors.


10.1007/3-540-60153-8 doi

Computer science.
Operating systems (Computers).
Computer software.
Computer Science.
Operating Systems.
Programming Techniques.
Processor Architectures.
Algorithm Analysis and Problem Complexity.



Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha