Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 1996

Job Scheduling Strategies for Parallel Processing

IPPS '96 Workshop, Honolulu, Hawaii, April 16, 1996. Proceedings

Editors:

  1. Dror G. Feitelson
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Larry Rudolph
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1162)

Conference series link(s): JSSPP: Workshop on Job Scheduling Strategies for Parallel Processing

Conference proceedings info: JSSPP 1996.

Sections

Buy it now

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (15 papers)

  1. Front Matter

    PDF

  2. Toward convergence in job schedulers for parallel supercomputers

    • Dror G. Feitelson, Larry Rudolph
    Pages 1-26

  4. The EASY — LoadLeveler API project

    • Joseph Skovira, Waiman Chan, Honbo Zhou, David Lifka
    Pages 41-47

  5. A batch scheduler for the Intel Paragon with a non-contiguous node allocation algorithm

    • Michael Wan, Reagan Moore, George Kremenek, Ken Steube
    Pages 48-64

  7. Packing schemes for gang scheduling

    • Dror G. Feitelson
    Pages 89-110

  8. A gang scheduling design for multiprogrammed parallel computing environments

    • Fang Wang, Hubertus Franke, Marios Papaefthymiou, Pratap Pattnaik, Larry Rudolph, Mark S. Squillante
    Pages 111-125

  9. Implementation of gang-scheduling on workstation cluster

    • Atsushi Hori, Hiroshi Tezuka, Yutaka Ishikawa, Noriyuki Soda, Hiroki Konaka, Munenori Maeda
    Pages 126-139

  10. Managing checkpoints for parallel programs

    • Jim Pruyne, Miron Livny
    Pages 140-154

  11. Using runtime measured workload characteristics in parallel processor scheduling

    • Thu D. Nguyen, Raj Vaswani, John Zahorjan
    Pages 155-174

  12. Parallel application characterization for multiprocessor scheduling policy design

    • Thu D. Nguyen, Raj Vaswani, John Zahorjan
    Pages 175-199

  13. Dynamic vs. static quantum-based parallel processor allocation

    • Su-Hui Chiang, Mary K. Vernon
    Pages 200-223

  15. Dynamic partitioning in different distributed-memory environments

    • Nayeem Islam, Andreas Prodromidis, Mark S. Squillante
    Pages 244-270

  17. Back Matter

    PDF
Back to top

Other Volumes

  1. Job Scheduling Strategies for Parallel Processing

Back to top

About this book

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 for inclusion on the basis of the reports of at least five program committee members. The volume is a highly competent contribution to advancing the state-of-the-art in the area of job scheduling for parallel supercomputers. Among the topics addressed are job scheduler, workload evolution, gang scheduling, multiprocessor scheduling, parallel processor allocation, and distributed memory environments.
Back to top

Keywords

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Search

Navigation