Parallel Architectures and Their Efficient Use First Heinz Nixdorf Symposium, Paderborn, Germany, November 11-13, 1992. Proceedings / edited by Friedhelm Meyer auf der Heide, Burkhard Monien, Arnold L. Rosenberg.

Research in the field of parallel computer architectures and parallel algorithms has been very successful in recent years, and further progress isto be expected. On the other hand, the question of basic principles of the architecture of universal parallel computers and their realizations is still wi...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Meyer auf der Heide, Friedhelm (Editor), Monien, Burkhard (Editor), Rosenberg, Arnold L. (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1993.
Edition:1st ed. 1993.
Series:Lecture Notes in Computer Science, 678
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • A combining mechanism for parallel computers
  • A case for the PRAM as a standard programmer's model
  • Hashing strategies for simulating shared memory on distributed memory machines
  • Better parallel architectures via emulations
  • Relations between models of parallel abstract machines
  • Frontiers of parallel computing
  • Cost effectiveness of data flow machines and vector processors
  • The networks of the connection machine CM-5
  • Massively parallel computing: Data distribution and communication
  • A realizable efficient parallel architecture
  • Hardware support for collective communication operations
  • Programmable active memories: a performance assessment
  • The role of randomness in the design of interconnection networks
  • Chaos router: Finally, a practical adaptive router?
  • An experimental study of wormhole routing in parallel computers
  • Three non conventional paradigms of parallel computation
  • Scalable parallel computers and scalable parallel codes: From theory to practice
  • A framework for analyzing locality and portability issues in parallel computing
  • Optimal implementation of general divide- and-conquer on the hypercube and related networks
  • Parallel implementations of graph embeddings
  • On sorting by prefix reversals and the diameter of pancake networks.