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 YEAR=2002

• Multi-periodic process networks: Prototyping and verifying stream-processing systems
  Albert Cohen, Daniela Genius, Abdesselem Kortebi, Zbigniew Chamski, Mark Duranton, Paul Feautrier
  Lecture Notes in Computer Science 2400, 2002, pp. 137-146
• Performance modeling and interpretive simulation of PIM architectures and applications
  Zachary K. Baker, Viktor K. Prasanna
  Lecture Notes in Computer Science 2400, 2002, pp. 157-161
• Extended overhead analysis for OpenMP
  Michael K. Bane, Graham D. Riley
  Lecture Notes in Computer Science 2400, 2002, pp. 162-166
• CATCH - A call-graph based automatic tool for capture of hardware performance metrics for MPI and OpenMP applications
  Liuz DeRose, Felix Wolf
  Lecture Notes in Computer Science 2400, 2002, pp. 167-176
• SIP: Performance tuning through source code interdependence
  Erik Berg, Erik Hagersten
  Lecture Notes in Computer Science 2400, 2002, pp. 177-186
• Scheduling and load balancing
  Maciej Drozdowski, Ioannis Milis, Larry Rudolph, Dennis Trystram
  Lecture Notes in Computer Science 2400, 2002, pp. 187-188
• Optimal scheduling algorithms for communication constrained parallel processing
  D. Turgay Altilar, Yakup Paker
  Lecture Notes in Computer Science 2400, 2002, pp. 197-206
• Non-approximability results for the hierarchical communication problem with a bounded number of clusters
  Eric Angel, Evripidis Bampis, Rodolphe Giroudeau
  Lecture Notes in Computer Science 2400, 2002, pp. 217-224
• Tiling and memory reuse for sequences of nested loops
  Youcef Bouchebaba, Fabien Coelho
  Lecture Notes in Computer Science 2400, 2002, pp. 255-264
• Reuse distance-based cache hint selection
  Kristof Beyls, Eric H. D'Hollander
  Lecture Notes in Computer Science 2400, 2002, pp. 265-274
• Towards detection of coarse-grain loop-level parallelism in irregular computations
  Manuel Arenaz, Juan Touriño, Ramón Doallo
  Lecture Notes in Computer Science 2400, 2002, pp. 289-298
• On the equivalence of two systems of affine recurrence equations
  Denis Barthou, Paul Feautrier, Xavier Redon
  Lecture Notes in Computer Science 2400, 2002, pp. 309-313
• Towards high-level specification, synthesis, and virtualization of programmable logic designs
  Olivier Diessel, Usama Malik, Keith So
  Lecture Notes in Computer Science 2400, 2002, pp. 314-317
• Retrieval of multispectral satellite imagery on cluster architectures
  T. Bretschneider, O. Kao
  Lecture Notes in Computer Science 2400, 2002, pp. 342-345
• A delayed-initiation risk-free multiversion temporally correct algorithm
  Azzedine Boukerche, Terry Tuck
  Lecture Notes in Computer Science 2400, 2002, pp. 385-390
• Optimization of fire propagation model inputs: A grand challenge application on metacomputers
  Baker Abdalhaq, Ana Cortés, Tomás Margalef, Emilio Luque
  Lecture Notes in Computer Science 2400, 2002, pp. 447-451
• Independent hashing as confidence mechanism for value predictors in microprocessors
  Veerle Desmet, Bart Goeman, Koen De Bosschere
  Lecture Notes in Computer Science 2400, 2002, pp. 458-467
• Runtime association of software prefetch control to memory access instructions
  Chi-Hung Chi, JunLi Yuan
  Lecture Notes in Computer Science 2400, 2002, pp. 486-489
• A self-stabilizing token-based k-out-of-l exclusion algorithm
  Ajoy K. Datta, Rachid Hadid, Vincent Villain
  Lecture Notes in Computer Science 2400, 2002, pp. 553-562
• A fault-tolerant sequencer for timed asynchronous systems
  Roberto Baldoni, Carlo Marchetti, Sara Tucci Piergiovanni
  Lecture Notes in Computer Science 2400, 2002, pp. 578-588
• Improving reactivity to I/O events in multithreaded environments using a uniform, Sheduler-Centric API
  Luc Bougé, Vincent Danjean, Raymond Namyst
  Lecture Notes in Computer Science 2400, 2002, pp. 605-614
• Double-scan: Introducing and implementing a new data-parallel skeleton
  Holger Bischof, Sergei Gorlatch
  Lecture Notes in Computer Science 2400, 2002, pp. 640-647
• New parallel (rank-revealing) QR factorization algorithms
  Rudnai Dias da Cunha, Dulcenéia Becker, James Carlton Patterson
  Lecture Notes in Computer Science 2400, 2002, pp. 677-686
• Solving large sparse Lyapunov equations on parallel computers
  José M. Badía, Peter Benner, Rafael Mayo, Enrique S. Quintana-Ortí
  Lecture Notes in Computer Science 2400, 2002, pp. 687-690
• Sources of parallel inefficiency for incompressible CFD simulations
  Sven H.M. Buijssen, Stefan Turek
  Lecture Notes in Computer Science 2400, 2002, pp. 701-704