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

• Optimal topology for distributed shared memory multiprocessors: Hypercubes again?
  José Duato, M.P. Malumbres
  Lecture Notes in Computer Science 1123, 1996, pp. 205-212
• A pattern-associative router for interconnection network adaptive algorithms
  Daniel G. Rice, José G. Delgado-Frias, Douglas H. Summerville
  Lecture Notes in Computer Science 1123, 1996, pp. 213-217
• On stack-graph OPS-based lightwave networks
  H. Bourdin, A. Ferreira, K. Marcus
  Lecture Notes in Computer Science 1123, 1996, pp. 218-221
• A general method for efficient embeddings of graphs into optimal hypercubes
  Volker Heun, Ernst W. Mayr
  Lecture Notes in Computer Science 1123, 1996, pp. 222-233
• The size complexity of strictly non-blocking fixed ratio concentrators with constant depth
  H.K. Dai
  Lecture Notes in Computer Science 1123, 1996, pp. 234-242
• Bandwidth and cutwidth of the mesh of d-ary trees
  Dominique Barth
  Lecture Notes in Computer Science 1123, 1996, pp. 243-246
• Variable-dilation embeddings of hypercubes into star graphs: Performance metrics, mapping functions, and routing
  Marcelo Moraes de Azevedo, Nader Bagherzadeh, Shahram Latifi
  Lecture Notes in Computer Science 1123, 1996, pp. 247-252
• Overlapping communication and computation in hypercubes
  Luis Díaz de Cerio, Miguel Valero-García, Antonio González
  Lecture Notes in Computer Science 1123, 1996, pp. 253-257
• Efficient delay routing
  Miriam di Ianni
  Lecture Notes in Computer Science 1123, 1996, pp. 258-269
• Multipacket hot-potato routing on processor arrays
  Christos Kaklamanis, Danny Krizanc
  Lecture Notes in Computer Science 1123, 1996, pp. 270-277
• A necessary and sufficient condition for proper routing in Omega-Omega network
  Myung-Kyun Kim, Hyunsoo Yoon, Seung-Ryoul Maeng
  Lecture Notes in Computer Science 1123, 1996, pp. 278-282
• Rubik routing permutations on graphs
  Charles Delorme, Petrisor Panaite
  Lecture Notes in Computer Science 1123, 1996, pp. 283-286
• The effect of flow control and routing adaptivity on priority-driven traffic in multiprocessor networks
  Shobana Balakrishnan, Füsun Özgüner
  Lecture Notes in Computer Science 1123, 1996, pp. 287-298
• Routing on networks of optical crossbars
  Friedhelm Meyer auf der Heide, Klaus Schröder, Frank Schwarze
  Lecture Notes in Computer Science 1123, 1996, pp. 299-306
• Latency and bandwidth requirements of massively parallel programs: FFT as a case study
  Fabrizio Petrini, Marco Vanneschi
  Lecture Notes in Computer Science 1123, 1996, pp. 307-312
• Induced broadcasting algorithms in iterated line digraphs
  Jean-Claude Bermond, Xavier Muñoz, Alberto Marchetti-Spaccamela
  Lecture Notes in Computer Science 1123, 1996, pp. 313-324
• Lower bounds on broadcasting time of de Bruijn networks
  Stéphane Perennes
  Lecture Notes in Computer Science 1123, 1996, pp. 325-332
• Gossip in trees under line-communication mode
  Christian Laforest
  Lecture Notes in Computer Science 1123, 1996, pp. 333-340
• Total exchange in Cayley networks
  Vassilios V. Dimakopoulos, Nikitas J. Dimopoulos
  Lecture Notes in Computer Science 1123, 1996, pp. 341-346
• Leaf communications in complete trees
  Vassilios V. Dimakopoulos, Nikitas J. Dimopoulos
  Lecture Notes in Computer Science 1123, 1996, pp. 347-352
• A gossip algorithm for bus networks with buses of limited length
  Satoshi Fujita, Christian Laforest, Stephane Perennes
  Lecture Notes in Computer Science 1123, 1996, pp. 353-360
• Worm-hole gossiping on meshes
  Ben H.H. Juurlink, P.S. Rao, Jop F. Sibeyn
  Lecture Notes in Computer Science 1123, 1996, pp. 361-369
• Circuit-switched gossiping in 3-dimensional torus networks
  Olivier Delmas, Stephane Perennes
  Lecture Notes in Computer Science 1123, 1996, pp. 370-373
• Automatic parallelization and high performance compilers
  Christian Lengauer
  Lecture Notes in Computer Science 1123, 1996, pp. 377-378
• On the optimality of Allen and Kennedy's algorithm for parallelism extraction in nested loops
  Alain Darte, Frédéric Vivien
  Lecture Notes in Computer Science 1123, 1996, pp. 379-388