Skip to main content
SpringerLink
Log in

Job Scheduling Strategies for Parallel Processing

IPDPS 2000 Workshop, JSSPP 2000, Cancun, Mexico, May 1, 2000 Proceedings

  • Conference proceedings
  • © 2000

Overview

Editors:
  1. Dror G. Feitelson

    1. The Hebrew University School of Computer Science and Engineering, Jerusalem, Israel

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Larry Rudolph

    1. Massachusetts Institute of Technology Laboratory for Computer Science, 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 1911)

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. Effect of Job Size Characteristics on Job Scheduling Performance

    • Kento Aida
    Pages 1-17

  3. Improving Parallel Job Scheduling Using Runtime Measurements

    • Fabricio Alves Barbosa da Silva, Isaac D. Scherson
    Pages 18-38

  4. Valuation of Ultra-scale Computing Systems

    • Larry Rudolph, Paul H. Smith
    Pages 39-55

  5. System Utilization Benchmark on the Cray T3E and IBM SP

    • Adrian Wong, Leonid Oliker, William Kramer, Teresa Kaltz, David Bailey
    Pages 56-67

  6. A Critique of ESP

    • Dror G. Feitelson
    Pages 68-73

  7. Resource Allocation Schemes for Gang Scheduling

    • Bing Bing Zhou, David Walsh, Richard P. Brent
    Pages 74-86

  8. A Tool to Schedule Parallel Applications on Multiprocessors: The NANOS CPU Manager

    • Xavier Martorell, Julita Corbalán, Dimitrios S. Nikolopoulos, Nacho Navarro, Eleftherios D. Polychronopoulos, Theodore S. et al.
    Pages 87-112

  9. Time-Sharing Parallel Jobs in the Presence of Multiple Resource Requirements

    • Fabrizio Petrini, Wu-chun Feng
    Pages 113-136

  10. The Performance Impact of Advance Reservation Meta-scheduling

    • Quinn Snell, Mark Clement, David Jackson, Chad Gregory
    Pages 137-153

  11. The Influence of the Structure and Sizes of Jobs on the Performance of Co-allocation

    • Anca I.D. Bucur, Dick H.J. Epema
    Pages 154-173

  12. Load Balancing for Minimizing Execution Time of a Target Job on a Network of Heterogeneous Workstations

    • S.-Y. Lee, C.-H. Cho
    Pages 174-186

  13. Adaptive Selection of Partition Size for Supercomputer Requests

    • Walfredo Cirne, Francine Berman
    Pages 187-207

  14. Back Matter

    Pages 209-210
    Download chapter PDF
Back to top

Keywords

Editors and Affiliations

  • The Hebrew University School of Computer Science and Engineering, Jerusalem, Israel

    Dror G. Feitelson

  • Massachusetts Institute of Technology Laboratory for Computer Science, Cambridge, USA

    Larry Rudolph

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation