1. Heinz Nixdorf Symposium 1992: Paderborn, Germany

Friedhelm Meyer auf der Heide, Burkhard Monien, Arnold L. Rosenberg (Eds.): Parallel Architectures and Their Efficient Use, First Heinz Nixdorf Symposium, Paderborn, Germany, November 11-13, 1992, Proceedings. Lecture Notes in Computer Science 678 Springer 1993, ISBN 3-540-56731-3

Parallel Computation Models and Simulations

Leslie G. Valiant:
A Combining Mechanism for Parallel Computers. 1-10
Uzi Vishkin:
A Case for the PRAM As a Standard Programmer's Model. 11-19
Friedhelm Meyer auf der Heide:
Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines. 20-29
Arnold L. Rosenberg:
Better Parallel Architectures via Emulations. 30-36
Michel Cosnard, Pascal Koiran:
Relations between Models of Parallel Abstract Machines. 37-46
Franco P. Preparata:
Frontiers of Parallel Computing. 47

Arno Formella, Werner Massonne, Wolfgang J. Paul:
Cost Effectiveness of Data Flow Machines and Vector Processors. 48-65
Charles E. Leiserson:
The Networks of the Connection Machine CM-5. 66-67
S. Lennart Johnsson:
Massively Parallel Computing: Data Distribution and Communication. 68-92
Burkhard Monien, Reinhard Lüling, Falk Langhammer:
A Realizable Efficient Parallel Architecture. 93-109
Larry Rudolph:
Hardware Support for Collective Communication Operations. 110-118
Patrice Bertin, Didier Roncin, Jean Vuillemin:
Programmable Active Memories: A Performance Assessment. 119-130

Frank Thomson Leighton, Bruce M. Maggs:
The Role of Randomness in the Design of Interconnection Networks. 131-145
Lawrence Snyder:
Chaos Router: Finally, a Practical Adaptive Router? 146-155
Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal:
An Experimental Study of Wormhole Routing in Parallel Computers. 156-165
Fabrizio Luccio, Linda Pagli, Geppino Pucci:
Three non Conventional Paradigms of Parallel Computation. 166-175
Marc Snir:
Scalable Parallel Computers and Scalable Parallel Codes: From Theory to Practice. 176-184

Abhiram G. Ranade:
A Framework for Analyzing Locality and Portability Issues in Parallel Computing. 185-194
Ernst W. Mayr, Ralph Werchner:
Optimal Implementation of General Divide-and-Conquer on the Hypercube and Related Networks. 195-206
Fred S. Annexstein:
Parallel Implementations of Graph Embeddings. 207-217
Mohammad Hossain Heydari, Ivan Hal Sudborough:
On Sorting by Prefix Reversals and the Diameter of Pancake Networks. 218-227

Last update Fri May 25 08:29:38 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page