Skip to main content
SpringerLink
Log in

Job Scheduling Strategies for Parallel Processing

IPPS/SPDP'99 Workshop, JSSPP'99, San Juan, Puerto Rico, April 16, 1999, Proceedings

  • Conference proceedings
  • © 1999

Overview

Editors:
  1. Dror G. Feitelson

    1. Institute of Computer Science, The Hebrew University of Jerusalem, Jerusalem, Israel

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Larry Rudolph

    1. Laboratory for Computer Science, MIT, Cambridge, USA

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

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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

Table of contents (12 papers)

  1. Front Matter

    Pages I-VI
    Download chapter PDF

  2. Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization

    • James Patton Jones, Bill Nitzberg
    Pages 1-16

  3. On the Design and Evaluation of Job Scheduling Algorithms

    • Jochen Krallmann, Uwe Schwiegelshohn, Ramin Yahyapour
    Pages 17-42

  4. Comparing Logs and Models of Parallel Workloads Using the Co-plot Method

    • David Talby, Dror G. Feitelson, Adi Raveh
    Pages 43-66

  5. Benchmarks and Standards for the Evaluation of Parallel Job Schedulers

    • Steve J. Chapin, Walfredo Cirne, Dror G. Feitelson, James Patton Jones, Scott T. Leutenegger, Uwe Schwiegelshohn et al.
    Pages 67-90

  6. The Effect of Correlating Quantum Allocation and Job Size for Gang Scheduling

    • Gaurav Ghare, Scott T. Leutenegger
    Pages 91-110

  7. Scheduling on AP/Linux for Fine and Coarse Grain Parallel Processes

    • Kuniyasu Suzaki, David Walsh
    Pages 111-128

  8. Job Re-packing for Enhancing the Performance of Gang Scheduling

    • B. B. Zhou, R. P. Brent, C. W. Johnson, D. Walsh
    Pages 129-143

  9. Process Tracking for Parallel Job Control

    • Hubertus Franke, José E. Moreira, Pratap Pattnaik
    Pages 144-161

  10. The Legion Resource Management System

    • Steve J. Chapin, Dimitrios Katramatos, John Karpovich, Andrew S. Grimshaw
    Pages 162-178

  11. Scheduling a Metacomputer with Uncooperative Sub-schedulers

    • Jörn Gehring, Thomas Preiss
    Pages 179-201

  12. Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance

    • Warren Smith, Valerie Taylor, Ian Foster
    Pages 202-219

  13. Deterministic Batch Scheduling without Static Partitioning

    • Kostadis Roussos, Nawaf Bitar, Robert English
    Pages 220-235

  14. Back Matter

    Pages 237-237
    Download chapter PDF
Back to top

Keywords

Editors and Affiliations

  • Institute of Computer Science, The Hebrew University of Jerusalem, Jerusalem, Israel

    Dror G. Feitelson

  • Laboratory for Computer Science, MIT, Cambridge, USA

    Larry Rudolph

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation