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

• Basis of parallel speculative execution
  Paul Feautrier
  Lecture Notes in Computer Science 1300, 1997, pp. 3-14
• Unifying theories for parallel programming
  Tony Hoare, Jifeng He
  Lecture Notes in Computer Science 1300, 1997, pp. 15-30
• Automatic parallelization of irregular and pointer-based computations: Perspectives from logic and constraint programming
  Manuel Hermenegildo
  Lecture Notes in Computer Science 1300, 1997, pp. 31-45
• Static and dynamic data management
  Friedhelm Meyer auf der Heide, Berthold Vöcking
  Lecture Notes in Computer Science 1300, 1997, pp. 46-56
• Iterative algorithms on high performance architectures
  Ulrich Rüde
  Lecture Notes in Computer Science 1300, 1997, pp. 57-71
• A performance tuning approach for shared-memory multiprocessors
  Per Stenström, Jonas Skeppstedt
  Lecture Notes in Computer Science 1300, 1997, pp. 72-83
• Workshop 01: Support tools and environment
  Allen D. Malony, Bernard Tourancheau
  Lecture Notes in Computer Science 1300, 1997, pp. 87-88
• Nova visualization for optimization of data-parallel programs
  Clinton L. Jeffery, Sandra G. Dykes, Xiaodong Zhang, Guillermo H. Gonzalez, Jason L. Peacock
  Lecture Notes in Computer Science 1300, 1997, pp. 89-93
• On correcting the intrusion of tracing non-deterministic programs by software
  Florian Teodorescu, Jacques Chassin de Kergommeaux
  Lecture Notes in Computer Science 1300, 1997, pp. 94-101
• Using control and data flow analysis for race evaluation
  Dieter Kranzlmüller, Siegfried Grabner, Jens Volkert
  Lecture Notes in Computer Science 1300, 1997, pp. 102-109
• Client server computing on message passing systems: Experiences with PVM-RPC
  A.T. Krantz, V.S. Sunderam
  Lecture Notes in Computer Science 1300, 1997, pp. 110-117
• Exdasy - A user-fiendly and extendable data distribution system
  Rainer Ch. Koppler, Gerhard Kurka, Jens J. Volkert
  Lecture Notes in Computer Science 1300, 1997, pp. 118-127
• Interconnecting multiple heterogeneous parallel application components
  Pedro D. Medeiros, José C. Cunha
  Lecture Notes in Computer Science 1300, 1997, pp. 128-139
• EDPEPPS: An integrated graphical toolset for the design and performance evaluation of portable parallel software
  T. Delaitre, P. Vekariya, R. Bigeard, G.R. Justo, S.C. Winter, M.J. Zemerly
  Lecture Notes in Computer Science 1300, 1997, pp. 140-149
• Load balancing based on process migration for MPI
  Georg Stellner, Jörg Trinitis
  Lecture Notes in Computer Science 1300, 1997, pp. 150-157
• A processors management system for PVM
  Jose Aguilar, Tania Jimenez
  Lecture Notes in Computer Science 1300, 1997, pp. 158-161
• A full program control flow representation for real programs
  He Zhu, Ian Watson
  Lecture Notes in Computer Science 1300, 1997, pp. 162-165
• Workshop 02: Routing and communication in interconnection networks
  Ernst Mayr, Chita Das
  Lecture Notes in Computer Science 1300, 1997, pp. 169-170
• Efficient total-exchange in wormhole-routed toroidal cubes
  Fabrizio Petrini, Marco Vanneschi
  Lecture Notes in Computer Science 1300, 1997, pp. 171-175
• An analysis of deflection-based wormhole routing with virtual channels
  Emmanouel A. Varvarigos, Jonathan P. Lang
  Lecture Notes in Computer Science 1300, 1997, pp. 176-187
• Wormhole deadlock prediction
  Miriam di Ianni
  Lecture Notes in Computer Science 1300, 1997, pp. 188-195
• Broadcast and associative oprations on fat-trees
  G. Bilardi, B. Codenotti, G. del Corso, C. Pinotti, G. Resta
  Lecture Notes in Computer Science 1300, 1997, pp. 196-207
• On the fault-tolerance of fat-trees
  Sotiris Nikoletseas, Grammati Pantziou, Panagiotis Psycharis, Paul Spirakis
  Lecture Notes in Computer Science 1300, 1997, pp. 208-217
• Minimal routing in the triangular grid and in a family of related tori
  Dominique Désérable
  Lecture Notes in Computer Science 1300, 1997, pp. 218-225
• Embedding complete k-ary trees into 2-dimensional meshes and tori
  Jan Trdlic̑ka, Pavel Tvrdík
  Lecture Notes in Computer Science 1300, 1997, pp. 226-233