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

• Set associative cache behavior optimization
  Ramón Doallo, Basilio B. Fraguela, Emilio L. Zapata
  Lecture Notes in Computer Science 1685, 1999, pp. 229-238
• A performance study of modern Web server applications
  Ramesh Radhakrishnan, Lizy Kurian John
  Lecture Notes in Computer Science 1685, 1999, pp. 239-247
• An evaluation of high performance Fortran compilers using the HPFBench benchmark suite
  Guohua Jin, Y. Charlie Hu
  Lecture Notes in Computer Science 1685, 1999, pp. 248-257
• Performance evaluation of object oriented middleware
  László Böszörményi, Andreas Wickner, Harald Wolf
  Lecture Notes in Computer Science 1685, 1999, pp. 258-261
• PopSPY: A PowerPC instrumentation tool for multiprocessor simulation
  C. Limousin, A. Vartanian, J-L. Béchennec
  Lecture Notes in Computer Science 1685, 1999, pp. 262-265
• Performance evaluation and benchmarking of native signal processing
  Deependra Talla, Lizy Kurian John
  Lecture Notes in Computer Science 1685, 1999, pp. 266-270
• A polynomial-time branching procedure for the multiprocessor scheduling problem
  Ricardo C. Corrêa, Afonso Ferreira
  Lecture Notes in Computer Science 1685, 1999, pp. 272-279
• Optimal and alternating-direction load balancing schemes
  Robert Elsässer, Andreas Frommer, Burkhard Monien, Robert Preis
  Lecture Notes in Computer Science 1685, 1999, pp. 280-290
• Process mapping given by processor and network dynamic load prediction
  Jean-Marie Garcia, David Gauchard, Thierry Monteil, Olivier Brun
  Lecture Notes in Computer Science 1685, 1999, pp. 291-294
• Ordering unsymmetric matrices into bordered block diagonal form for parallel processing
  Y.F. Hu, K.C.F. Maguire, R.J. Blake
  Lecture Notes in Computer Science 1685, 1999, pp. 295-302
• Dynamic load balancing for ocean circulation model with adaptive meshing
  Eric Blayo, Laurent Debreu, Grégory Mounié, Denis Trystram
  Lecture Notes in Computer Science 1685, 1999, pp. 303-312
• DRAMA: A library for parallel dynamic load balancing of finite element applications
  Bart Maerten, Dirk Roose, Achim Basermann, Jochen Fingberg, Guy Lonsdale
  Lecture Notes in Computer Science 1685, 1999, pp. 313-316
• Job scheduling in a multi-layer vision system
  M. Fikret Ercan, Ceyda Oğuz, Yu-Fai Fung
  Lecture Notes in Computer Science 1685, 1999, pp. 317-321
• A new algorithm for multi-objective graph partitioning
  Kirk Schloegel, George Karypis, Vipin Kumar
  Lecture Notes in Computer Science 1685, 1999, pp. 322-331
• Scheduling iterative programs onto LogP-machine
  Welf Löwe, Wolf Zimmermann
  Lecture Notes in Computer Science 1685, 1999, pp. 332-339
• Scheduling arbitrary task graphs on LogP machines
  Cristina Boeres, Aline Nascimento, Vinod E.F. Rebello
  Lecture Notes in Computer Science 1685, 1999, pp. 340-349
• Scheduling with communication delays and on-line disturbances
  Aziz Moukrim, Eric Sanlaville, Frédéric Guinand
  Lecture Notes in Computer Science 1685, 1999, pp. 350-357
• Scheduling user-level threads on distributed shared-memory multiprocessors
  Eleftherios D. Polychronopoulos, Theodore S. Papatheodorou
  Lecture Notes in Computer Science 1685, 1999, pp. 358-368
• Using duplication for the multiprocessor scheduling problem with hierarchical communications
  Evripidis Rodolphe Giroudeau Bampis, Jean-Claude König
  Lecture Notes in Computer Science 1685, 1999, pp. 369-372
• Storage mapping optimization for parallel programs
  Albert Cohen, Vincent Lefebvre
  Lecture Notes in Computer Science 1685, 1999, pp. 375-382
• Array SSA for explicitly parallel programs
  Jean-François Collard
  Lecture Notes in Computer Science 1685, 1999, pp. 383-390
• Parallel data-flow analysis of explicitly parallel programs
  Jens Knoop
  Lecture Notes in Computer Science 1685, 1999, pp. 391-400
• Localization of data transfer in processor arrays
  Dirk Fimmel, Renate Merker
  Lecture Notes in Computer Science 1685, 1999, pp. 401-408
• Scheduling structured systems
  Jason B. Crop, Doran K. Wilde
  Lecture Notes in Computer Science 1685, 1999, pp. 409-412
• Compiling data parallel tasks for coordinated execution
  Erwin Laure, Matthew Haines, Piyush Mehrotra, Hans Zima
  Lecture Notes in Computer Science 1685, 1999, pp. 413-417