Job Scheduling Strategies for Parallel Processing

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

  • Dror G. Feitelson
  • Larry Rudolph
Conference proceedings JSSPP 1999

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

Table of contents

  1. Front Matter
    Pages I-VI
  2. Jochen Krallmann, Uwe Schwiegelshohn, Ramin Yahyapour
    Pages 17-42
  3. David Talby, Dror G. Feitelson, Adi Raveh
    Pages 43-66
  4. Steve J. Chapin, Walfredo Cirne, Dror G. Feitelson, James Patton Jones, Scott T. Leutenegger, Uwe Schwiegelshohn et al.
    Pages 67-90
  5. Kuniyasu Suzaki, David Walsh
    Pages 111-128
  6. B. B. Zhou, R. P. Brent, C. W. Johnson, D. Walsh
    Pages 129-143
  7. Hubertus Franke, José E. Moreira, Pratap Pattnaik
    Pages 144-161
  8. Steve J. Chapin, Dimitrios Katramatos, John Karpovich, Andrew S. Grimshaw
    Pages 162-178
  9. Jörn Gehring, Thomas Preiss
    Pages 179-201
  10. Kostadis Roussos, Nawaf Bitar, Robert English
    Pages 220-235
  11. Back Matter
    Pages 237-237

About these proceedings


Distributed Resources Computing Job Scheduling Linux Load Balancing Multi-User Distributed Systems Parallel Architectures Parallel Processing Scheduling Workstation Clusters algorithm algorithms

Editors and affiliations

  • Dror G. Feitelson
    • 1
  • Larry Rudolph
    • 2
  1. 1.Institute of Computer ScienceThe Hebrew University of JerusalemJerusalemIsrael
  2. 2.Laboratory for Computer ScienceMITCambridgeUSA

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1999
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-66676-9
  • Online ISBN 978-3-540-47954-3
  • Series Print ISSN 0302-9743
  • Buy this book on publisher's site
Industry Sectors