Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=1459

• Metrics and benchmarking for parallel job scheduling
  Dror G. Feitelson, Larry Rudolph
  Lecture Notes in Computer Science 1459, 1998, pp. 1-24
• A comparative study of real workload traces and synthetic workload models for parallel job scheduling
  Virginia Lo, Jens Mache, Kurt Windisch
  Lecture Notes in Computer Science 1459, 1998, pp. 25-46
• Lachesis: A job scheduler for the Cray T3E
  Allen B. Downey
  Lecture Notes in Computer Science 1459, 1998, pp. 47-61
• A resource management architecture for metacomputing systems
  Karl Czajkowski, Ian Foster, Nick Karonis, Carl Kesselman, Stuart Martin, Warren Smith, Steven Tuecke
  Lecture Notes in Computer Science 1459, 1998, pp. 62-82
• Implementing the combination of time sharing and space sharing on AP/Linux
  Kuniyasu Suzaki, David Walsh
  Lecture Notes in Computer Science 1459, 1998, pp. 83-97
• Job scheduling scheme for pure space sharing among rigid jobs
  Kento Aida, Hironori Kasahara, Seinosuke Narita
  Lecture Notes in Computer Science 1459, 1998, pp. 98-121
• Predicting application run times using historical information
  Warren Smith, Ian Foster, Valerie Taylor
  Lecture Notes in Computer Science 1459, 1998, pp. 122-142
• Job scheduling strategies for networks of workstations
  B.B. Zhou, R.P. Brent, D. Walsh, K. Suzaki
  Lecture Notes in Computer Science 1459, 1998, pp. 143-157
• Probabilistic loop scheduling considering communication overhead
  Sissades Tongsima, Chantana Chantrapornchai, Edwin H.-M. Sha
  Lecture Notes in Computer Science 1459, 1998, pp. 158-179
• Improving first-come-first-serve job scheduling by gang scheduling
  Uwe Schwiegelshohn, Ramin Yahyapour
  Lecture Notes in Computer Science 1459, 1998, pp. 180-198
• Expanding symmetric multiprocessor capability through gang scheduling
  Morris A. Jette
  Lecture Notes in Computer Science 1459, 1998, pp. 199-216
• Overhead analysis of preemptive gang scheduling
  Atsushi Hori, Hiroshi Tezuka, Yutaka Ishikawa
  Lecture Notes in Computer Science 1459, 1998, pp. 217-230
• Dynamic coscheduling on workstation clusters
  Patrick G. Sobalvarro, Scott Pakin, William E. Weihl, Andrew A. Chien
  Lecture Notes in Computer Science 1459, 1998, pp. 231-256