Message-passing algorithms for a SIMD torus with coteries

Authors:
M. Herbordt;C. Weems;J. Corbett
Affiliations:
Department of Computer and Information Science, University of Massachusetts at Amherst, Amherst, Massachusetts;Department of Computer and Information Science, University of Massachusetts at Amherst, Amherst, Massachusetts;-
Venue:
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Year:
1990

Citing 9
Cited 0

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
Multicomputers: Message-Passing Concurrent Computers

Computer
Routing and sorting on mesh-connected arrays (extended abstract)

VLSI Algorithms and Architectures
Algorithmic Techniques for Computer Vision on a Fine-Grained Parallel Machine

IEEE Transactions on Pattern Analysis and Machine Intelligence
A 2n-2 step algorithm for routing in an nxn array with constant size queues

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Meshes with reconfigurable buses

Proceedings of the fifth MIT conference on Advanced research in VLSI
A unified approach to off-line permutation routing on parallel networks

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
An optimal routing algorithm for mesh-connected Parallel computers

Journal of the ACM (JACM)
Sorting on a mesh-connected parallel computer

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract