On shortest path routing in single stage shuffle-exchange networks

Authors:
Sunil Kim;Alexander V. Veidenbaum
Affiliations:
Center for Supercomputing R & D, University of Illinois, 1308 W. Main St, Urbana, IL;Department of EECS, University of Illinois, 851 S. Morgan St, Chicago, IL
Venue:
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Year:
1995

Citing 4
Cited 4

Memory access buffering in multiprocessors

ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
A Unified theory of interconnection network structure

Theoretical Computer Science
Generalized de Bruijn digraphs

Networks
Design and Analysis of Even-Sized Binary Shuffle-Exchange Networks for Multiprocessors

IEEE Transactions on Parallel and Distributed Systems

On Interaction between Interconnection Network Design and Latency Hiding Techniques in Multiprocessors

The Journal of Supercomputing
The absolute center of a network: Dedicated to the memory of Jonathan Halpern 1940–1981

Networks
A reconfigurable optical/electrical interconnect architecture for large-scale clusters and datacenters

Proceedings of the 9th conference on Computing Frontiers
A reconfigurable, regular-topology cluster/datacenter network using commodity optical switches

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract