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

• Scheduling for parallel supercomputing: A historical perspective of achievable utilization
  James Patton Jones, Bill Nitzberg
  Lecture Notes in Computer Science 1659, 1999, pp. 1-16
• On the design and evaluation of job scheduling algorithms
  Jochen Krallmann, Uwe Schwiegelshohn, Ramin Yahyapour
  Lecture Notes in Computer Science 1659, 1999, pp. 17-42
• Comparing logs and models of parallel workloads using the co-plot method
  David Talby, Dror G. Feitelson, Adi Raveh
  Lecture Notes in Computer Science 1659, 1999, pp. 43-66
• Benchmarks and standards for the evaluation of parallel job schedulers
  Steve J. Chapin, Walfredo Cirne, Dror G. Feitelson, James Patton Jones, Scott T. Leutenegger, Uwe Schwiegelshohn, Warren Smith, David Talby
  Lecture Notes in Computer Science 1659, 1999, pp. 67-90
• The effect of correlating quantum allocation and job size for gang scheduling
  Gaurav Chare, Scott T. Leutenegger
  Lecture Notes in Computer Science 1659, 1999, pp. 91-110
• Scheduling on AP/Linux for fine and coarse grain parallel processes
  Kuniyasu Suzaki, David Walsh
  Lecture Notes in Computer Science 1659, 1999, pp. 111-128
• Job re-packing for enhancing the performance of gang scheduling
  B.B. Zhou, R.P. Brent, C.W. Johnson, D. Walsh
  Lecture Notes in Computer Science 1659, 1999, pp. 129-143
• Process tracking for parallel job control
  Hubertus Franke, José E. Moreira, Pratap Pattnaik
  Lecture Notes in Computer Science 1659, 1999, pp. 144-161
• The legion resource management system
  Steve J. Chapin, Dimitrios Katramatos, John Karpovich, Andrew S. Grimshaw
  Lecture Notes in Computer Science 1659, 1999, pp. 162-178
• Scheduling a metacomputer with uncooperative sub-schedulers
  Jörn Gehring, Thomas Preiss
  Lecture Notes in Computer Science 1659, 1999, pp. 179-201
• Using run-time predictions to estimate queue wait times and improve scheduler performance
  Warren Smith, Valerie Taylor, Ian Foster
  Lecture Notes in Computer Science 1659, 1999, pp. 202-219
• Deterministic batch scheduling without static partitioning
  Kostadis Roussos, Nawaf Bitar, Robert English
  Lecture Notes in Computer Science 1659, 1999, pp. 220-235