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 [1]	Hilfe

Suche: Series=LNCS AND Volume=1900

• Impact of PE mapping on Cray T3E message-passing performance
  Eduardo Huedo, Manuel Prieto, Ignacio M. Llorente, Francisco Tirado
  Lecture Notes in Computer Science 1900, 2000, pp. 199-207
• Performance prediction of an NAS benchmark program with ChronosMix environment
  Julien Bourgeois, François Spies
  Lecture Notes in Computer Science 1900, 2000, pp. 208-216
• A hierarchical approach to irregular problems
  Fabrizio Baiardi, Primo Becuzzi, Sarah Chiti, Paolo Mori, Laura Ricci
  Lecture Notes in Computer Science 1900, 2000, pp. 218-222
• Load scheduling with profile information
  Götz Lindenmaier, Kathryn S. McKinley, Olivier Temam
  Lecture Notes in Computer Science 1900, 2000, pp. 223-233
• Neighbourhood preserving load balancing: A self-organizing approach
  Attila Gürsoy, Murat Atun
  Lecture Notes in Computer Science 1900, 2000, pp. 234-241
• The impact of migration on parallel job scheduling for distributed systems
  Yanyong Zhang, Hubertus Franke, Jose E. Moreira, Anand Sivasubramaniam
  Lecture Notes in Computer Science 1900, 2000, pp. 242-251
• Memory management techniques for gang scheduling
  William Leinberger, George Karypis, Vipin Kumar
  Lecture Notes in Computer Science 1900, 2000, pp. 252-261
• Exploiting knowledge of temporal behaviour in parallel programs for improving distributed mapping
  Concepció Roig, Ana Ripoll, Miquel A. Senar, Fernando Guirado, Emilio Luque
  Lecture Notes in Computer Science 1900, 2000, pp. 262-271
• Preemptive task scheduling for distributed systems
  Andrei Rădulescu, Arjan J.C. van Gemund
  Lecture Notes in Computer Science 1900, 2000, pp. 272-276
• Towards optimal load balancing topologies
  Thomas Decker, Burkhard Monien, Robert Preis
  Lecture Notes in Computer Science 1900, 2000, pp. 277-287
• Scheduling trees with large communication delays on two identical processors
  Foto Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis
  Lecture Notes in Computer Science 1900, 2000, pp. 288-295
• Parallel multilevel algorithms for multi-constraint graph partitioning
  Kirk Schloegel, George Karypis, Vipin Kumar
  Lecture Notes in Computer Science 1900, 2000, pp. 296-310
• Experiments with scheduling divisible tasks in clusters of workstations
  Maciej Drozdowski, Paweƚ Wolniewicz
  Lecture Notes in Computer Science 1900, 2000, pp. 311-319
• Optimal mapping of pipeline algorithms
  Daniel González, Francisco Almeida, Luz Marina Moreno, Casiano Rodríguez
  Lecture Notes in Computer Science 1900, 2000, pp. 320-324
• Dynamic load balancing for parallel adaptive multigrid solvers with algorithmic skeletons
  Thomas Richert
  Lecture Notes in Computer Science 1900, 2000, pp. 325-328
• Improving the sparse parallelization using semantical information at compile-time
  Gerardo Bandera, Emilio L. Zapata
  Lecture Notes in Computer Science 1900, 2000, pp. 331-339
• Automatic parallelization of sparse matrix computations: A static analysis
  Roxane Adle, Marc Aiguier, Franck Delaplace
  Lecture Notes in Computer Science 1900, 2000, pp. 340-348
• Automatic SIMD parallelization of embedded applications based on pattern recognition
  Rashindra Manniesing, Ireneusz Karkowski, Henk Corporaal
  Lecture Notes in Computer Science 1900, 2000, pp. 349-356
• Temporary arrays for distribution of loops with control dependences
  Alain Darte, Georges-André Silberc
  Lecture Notes in Computer Science 1900, 2000, pp. 357-367
• Automatic generation of block-recursive codes
  Nawaaz Ahmed, Kekshav Pingali
  Lecture Notes in Computer Science 1900, 2000, pp. 368-378
• Left-looking to right-looking and vice versa: An application of fractal symbolic analysis to linear algebra code restructuring
  Nikolay Mateev, Vijay Menon, Keshav Pingali
  Lecture Notes in Computer Science 1900, 2000, pp. 379-388
• Identifying and validating irregular mutual exclusion synchronization in explicitly parallel programs
  Diego Novillo, Ronald C. Unrau, Jonathan Schaeffer
  Lecture Notes in Computer Science 1900, 2000, pp. 389-394
• Exact distributed invalidation
  Rupert W. Ford, Michael F.P. O'Boyle, Elena A. Stöhr
  Lecture Notes in Computer Science 1900, 2000, pp. 395-404
• Scheduling the computations of a loop nest with respect to a given mapping
  Alain Darte, Claude Diderich, Marc Gengler, Frédéric Vivien
  Lecture Notes in Computer Science 1900, 2000, pp. 405-414
• Volume driven data distribution for NUMA-machines
  Felix Heine, Adrian Slowik
  Lecture Notes in Computer Science 1900, 2000, pp. 415-424