Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Job Scheduling Strategies for Parallel Processing

IPPS/SPDP'98 Workshop, Orlando, Florida, USA, March 30, 1998 Proceedings

  • Conference proceedings
  • © 1998

Overview

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 1459)

Included in the following conference series:

Conference proceedings info: JSSPP 1998.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

About this book

This book constitutes the thoroughly refereed post-workshop proceedings of the 4th International Workshop on Job Scheduling Strategies for Parallel Processing held during IPPS/SPDP'98, in Orlando, Florida, USA, in March 1998. The 13 revised full papers presented have gone through an iterated reviewing process and give a report on the state of the art in the area.

Keywords

Table of contents (13 papers)

  1. Front Matter

    Download chapter PDF

  2. Metrics and benchmarking for parallel job scheduling

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

  3. A comparative study of real workload traces and synthetic workload models for parallel job scheduling

    • Virginia Lo, Jens Mache, Kurt Windisch
    Pages 25-46

  4. Lachesis: A job scheduler for the cray T3E

    • Allen B. Downey
    Pages 47-61

  5. A resource management architecture for metacomputing systems

    • Karl Czajkowski, Ian Foster, Nick Karonis, Carl Kesselman, Stuart Martin, Warren Smith et al.
    Pages 62-82

  6. Implementing the combination of time sharing and space sharing on AP/Linux

    • Kuniyasu Suzaki, David Walsh
    Pages 83-97

  7. Job scheduling scheme for pure space sharing among rigid jobs

    • Kento Aida, Hironori Kasahara, Seinosuke Narita
    Pages 98-121

  8. Predicting application run times using historical information

    • Warren Smith, Ian Foster, Valerie Taylor
    Pages 122-142

  9. Job scheduling strategies for networks of workstations

    • B. B. Zhou, R. P. Brent, D. Walsh, K. Suzaki
    Pages 143-157

  10. Probabilistic loop scheduling considering communication overhead

    • Sissades Tongsima, Chantana Chantrapornchai, Edwin H. -M. Sha
    Pages 158-179

  11. Improving first-come-first-serve job scheduling by gang scheduling

    • Uwe Schwiegeishohn, Ramin Yahyapour
    Pages 180-198

  12. Expanding symmetric multiprocessor capability through gang scheduling

    • Morris A. Jette
    Pages 199-216

  13. Overhead analysis of preemptive gang scheduling

    • Atsushi Hori, Hiroshi Tezuka, Yutaka Ishikawa
    Pages 217-230

  14. Dynamic coscheduling on workstation clusters

    • Patrick G. Sobalvarro, Scott Pakin, William E. Weihl, Andrew A. Chien
    Pages 231-256
Back to top

Other volumes

  1. Job Scheduling Strategies for Parallel Processing

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation