Job Scheduling Strategies for Parallel Processing IPPS '96 Workshop, Honolulu, Hawaii, April 16, 1996. Proceedings / edited by Dror G. Feitelson, Larry Rudolph.

This book constitutes the strictly refereed post-workshop proceedings of the International Workshop on Job Scheduling Strategies for Parallel Processing, held in conjunction with IPPS '96 symposium in Honolulu, Hawaii, in April 1996. The book presents 15 thoroughly revised full papers accepted...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Feitelson, Dror G. (Editor), Rudolph, Larry (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1996.
Edition:1st ed. 1996.
Series:Lecture Notes in Computer Science, 1162
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • Toward convergence in job schedulers for parallel supercomputers
  • Workload evolution on the Cornell Theory Center IBM SP2
  • The EASY — LoadLeveler API project
  • A batch scheduler for the Intel Paragon with a non-contiguous node allocation algorithm
  • Architecture-independent request-scheduling with tight waiting-time estimations
  • Packing schemes for gang scheduling
  • A gang scheduling design for multiprogrammed parallel computing environments
  • Implementation of gang-scheduling on workstation cluster
  • Managing checkpoints for parallel programs
  • Using runtime measured workload characteristics in parallel processor scheduling
  • Parallel application characterization for multiprocessor scheduling policy design
  • Dynamic vs. static quantum-based parallel processor allocation
  • Dynamic versus adaptive processor allocation policies for message passing parallel computers: An empirical comparison
  • Dynamic partitioning in different distributed-memory environments
  • Locality-information-based scheduling in shared-memory multiprocessors.