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

• The new age of supercomputing
  J. Rattner
  Lecture Notes in Computer Science 487, 1991, pp. 1-6
• The next generation transputers and beyond
  D. May
  Lecture Notes in Computer Science 487, 1991, pp. 7-22
• A distributed implementation of shared virtual memory with strong and weak coherence
  W.K. Giloi, C. Hastedt, F. Schön, W. Schröder-Preikschat
  Lecture Notes in Computer Science 487, 1991, pp. 23-31
• Store coherency in a parallel distributed-memory machine
  L. Borrmann, P. Istavrinos
  Lecture Notes in Computer Science 487, 1991, pp. 32-41
• Using a weak coherency model for a parallel Lisp
  C. Hammer, T. Henties
  Lecture Notes in Computer Science 487, 1991, pp. 42-51
• Flexible user-definable memory coherence scheme in distributed shared memory of GALAXY
  P.K. Sinha, H. Ashihara, K. Shimizu, M. Maekawa
  Lecture Notes in Computer Science 487, 1991, pp. 52-61
• Parallelization of multigrid programs in SUPERB
  M. Gerndt
  Lecture Notes in Computer Science 487, 1991, pp. 62-72
• Mapping graphs onto a partially reconfigurable architecture
  P. Chrétienne, F. Lamour
  Lecture Notes in Computer Science 487, 1991, pp. 73-79
• SIMPLE: A performance evaluation tool environment for parallel and distributed systems
  B. Mohr
  Lecture Notes in Computer Science 487, 1991, pp. 80-89
• Interleaving partitions of systolic algorithms for programming distributed memory multiprocessors
  A. Fernández, J.M. Llabería, J.J. Navarro, M. Valero-García
  Lecture Notes in Computer Science 487, 1991, pp. 90-99
• Partial ordering of synchronization events for distributed debugging in tightly-coupled multiprocessor systems
  G.J.W. van Dijk, A.J. van der Wal
  Lecture Notes in Computer Science 487, 1991, pp. 100-109
• A development environment for distributed systems
  S. Chaumette, M.C. Counilh
  Lecture Notes in Computer Science 487, 1991, pp. 110-119
• Monitor-supported analysis of a communication system for transputer-networks
  C.-W. Oehlrich, P. Metzger, A. Quick
  Lecture Notes in Computer Science 487, 1991, pp. 120-129
• An integrated environment for programming distributed memory multiprocessors
  T. Bemmerl, A. Bode
  Lecture Notes in Computer Science 487, 1991, pp. 130-142
• Optimal multinode broadcast on a mesh connected graph with reduced bufferization
  A. Touzene, B. Plateau
  Lecture Notes in Computer Science 487, 1991, pp. 143-152
• Adaptive irregular multiple grids on a distributed memory multiprocessor
  J. de Keyser, D. Roose
  Lecture Notes in Computer Science 487, 1991, pp. 153-162
• An object-oriented interface for parallel programming of loosely-coupled multiprocessor systems
  T. Ungerer, L. Bic
  Lecture Notes in Computer Science 487, 1991, pp. 163-172
• On automatic loop data-mapping for distributed-memory multiprocessors
  J. Torres, E. Ayguadé, J. Labarta, J.M. Llabería, M. Valero
  Lecture Notes in Computer Science 487, 1991, pp. 173-182
• Efficient and scalable logical busses for message-passing interconnection networks
  H. Scheidig, M.F. Schneider, R. Spurk
  Lecture Notes in Computer Science 487, 1991, pp. 183-192
• Performance benefits from locally adaptive interval routing in dynamically switched interconnection networks
  H. Hofestädt, A. Klein, E. Reyzl
  Lecture Notes in Computer Science 487, 1991, pp. 193-202
• An optimal structure that accomodates both a ring and a binary tree
  Xiaohong Xie, Youmei Ge
  Lecture Notes in Computer Science 487, 1991, pp. 203-212
• A scalable communication processor design supporting systolic communication
  H. Corporaal, J.G.E. Olk
  Lecture Notes in Computer Science 487, 1991, pp. 213-223
• Simulation facility of distributed memory system with ``mad postman'' communication network
  V.S. Getov, C.R. Jesshope
  Lecture Notes in Computer Science 487, 1991, pp. 224-233
• On the design of deadlock-free adaptive routing algorithms for multicomputers: Theoretical aspects
  J. Duato
  Lecture Notes in Computer Science 487, 1991, pp. 234-243
• Parallelization of Lee's routing algorithm on a hypercube multicomputer
  T.M. Kurç, C. Aykanat, F. Erçal
  Lecture Notes in Computer Science 487, 1991, pp. 244-253