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

• Parallel job scheduling: Issues and approaches
  Dror G. Feitelson, Larry Rudolph
  Lecture Notes in Computer Science 949, 1995, pp. 1-18
• Scheduling on the Tera MTA
  Gail Alverson, Simon Kahan, Richard Korry, Cathy McCann, Burton Smith
  Lecture Notes in Computer Science 949, 1995, pp. 19-44
• A scalable multi-discipline, multiple-processor scheduling framework for IRIX
  James M. Barton, Nawaf Bitar
  Lecture Notes in Computer Science 949, 1995, pp. 45-69
• Scheduling to reduce memory coherence overhead on coarse-grain multiprocessors
  Christopher Connelly, Carla Schlatter Ellis
  Lecture Notes in Computer Science 949, 1995, pp. 70-91
• Time space sharing scheduling and architectural support
  Atsushi Hori, Takashi Yokota, Yutaka Ishikawa, Shuichi Sakai, Hiroki Konaka, Munenori Maeda, Takashi Tomokiyo, Jörg Nolte, Hiroshi Matsuoka, Kazuaki Okamoto, Hideo Hirono
  Lecture Notes in Computer Science 949, 1995, pp. 92-105
• Demand-based coscheduling of parallel jobs on multiprogrammed multiprocessors
  Patrick G. Sobalvarro, William E. Weihl
  Lecture Notes in Computer Science 949, 1995, pp. 106-126
• Multiprocessor scheduling for high-variability service time distributions
  Eric W. Parsons, Kenneth C. Sevcik
  Lecture Notes in Computer Science 949, 1995, pp. 127-145
• The interaction between memory allocation and adaptive partitioning in message-passing multicomputers
  Sanjeev K. Setia
  Lecture Notes in Computer Science 949, 1995, pp. 146-164
• Analysis of non-work-conserving processor partitioning policies
  E. Rosti, E. Smirni, G. Serazzi, L.W. Dowdy
  Lecture Notes in Computer Science 949, 1995, pp. 165-181
• Loop-level process control: An effective processor allocation policy for multiprogrammed shared-memory multiprocessors
  Kelvin K. Yue, David J. Lilja
  Lecture Notes in Computer Science 949, 1995, pp. 182-199
• A microeconomic scheduler for parallel computers
  Ion Stoica, Hussein Abdel-Wahab, Alex Pothen
  Lecture Notes in Computer Science 949, 1995, pp. 200-218
• On the benefits and limitations of dynamic partitioning in parallel computer systems
  Mark S. Squillante
  Lecture Notes in Computer Science 949, 1995, pp. 219-238
• Intelligent fuzzy control to augment scheduling capabilities of network queuing systems
  Oscar Kipersztok, James C. Patterson
  Lecture Notes in Computer Science 949, 1995, pp. 239-258
• Parallel processing on dynamic resources with CARMI
  Jim Pruyne, Miron Livny
  Lecture Notes in Computer Science 949, 1995, pp. 259-278
• Job scheduling under the portable batch system
  Robert L. Henderson
  Lecture Notes in Computer Science 949, 1995, pp. 279-294
• The ANL/IBM SP scheduling system
  David A. Lifka
  Lecture Notes in Computer Science 949, 1995, pp. 295-303
• Requirements of the Cornell Theory Center for resource management and process scheduling
  Marcy E. Rosenkrantz, David J. Schneider, Roslyn Leibensperger, Melinda Shore, John Zollweg
  Lecture Notes in Computer Science 949, 1995, pp. 304-318
• Job management requirements for NAS parallel systems and clusters
  William Saphir, Leigh Ann Tanner, Bernard Traversat
  Lecture Notes in Computer Science 949, 1995, pp. 319-336
• Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860
  Dror G. Feitelson, Bill Nitzberg
  Lecture Notes in Computer Science 949, 1995, pp. 337-360