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=1162

• Towards convergence in job schedulers for parallel supercomputers
  Dror G. Feitelson, Larry Rudolph
  Lecture Notes in Computer Science 1162, 1996, pp. 1-26
• Workload evolution on the Cornell Theory Center IBM SP2
  Steven Hotovy
  Lecture Notes in Computer Science 1162, 1996, pp. 27-40
• The EASY - LoadLeveler API project
  Joseph Skovira, Waiman Chan, Honbo Zhou, David Lifka
  Lecture Notes in Computer Science 1162, 1996, pp. 41-47
• A batch scheduler for the Intel Paragon with a non-contiguous node allocation algorithm
  Michael Wan, Reagan Moore, George Kremenek, Ken Steube
  Lecture Notes in Computer Science 1162, 1996, pp. 48-64
• Architecture-independent request-scheduling with tight waiting-time estimations
  Jörn Gehring, Friedhelm Ramme
  Lecture Notes in Computer Science 1162, 1996, pp. 65-88
• Packing schemes for gang scheduling
  Dror G. Feitelson
  Lecture Notes in Computer Science 1162, 1996, pp. 89-110
• A gang scheduling design for multiprogrammed parallel computing environments
  Fang Wang, Hubertus Franke, Marios Papaefthymiou, Pratap Pattnaik, Larry Rudolph, Mark S. Squillante
  Lecture Notes in Computer Science 1162, 1996, pp. 111-125
• Implementation of gang-scheduling on workstation cluster
  Atsushi Hori, Hiroshi Tezuka, Yutaka Ishikawa, Noriyuki Soda, Hiroki Konaka, Munenori Maeda
  Lecture Notes in Computer Science 1162, 1996, pp. 126-139
• Managing checkpoints for parallel programs
  Jim Pruyne, Miron Livny
  Lecture Notes in Computer Science 1162, 1996, pp. 140-154
• Using runtime measured workload characteristics in parallel processor scheduling
  Thu D. Nguyen, Raj Vaswani, John Zahorjan
  Lecture Notes in Computer Science 1162, 1996, pp. 155-174
• Parallel application characterization for multiprocessor scheduling policy design
  Thu D. Nguyen, Raj Vaswani, John Zahorjan
  Lecture Notes in Computer Science 1162, 1996, pp. 175-199
• Dynamic vs. static quantum-based parallel processor allocation
  Su-Hui Chiang, Mary K. Vernon
  Lecture Notes in Computer Science 1162, 1996, pp. 200-223
• Dynamic versus adaptive processor allocation policies for message passing parallel computers: An empirical comparison
  Jitendra D. Padhye, Lawrence Dowdy
  Lecture Notes in Computer Science 1162, 1996, pp. 224-243
• Dynamic partitioning in different distributed-memory environments
  Nayeem Islam, Andreas Prodromidis, Mark S. Squillante
  Lecture Notes in Computer Science 1162, 1996, pp. 244-270
• Locality-information-based scheduling in shared-memory multiprocessors
  Frank Bellosa
  Lecture Notes in Computer Science 1162, 1996, pp. 271-289