A Conflict Sense Routing Protocol and Its Performance for Hypercubes

Authors:
Emmanouel A. Varvarigos;Dimitri P. Bertsekas
Affiliations:
Univ. of California, Santa Barbara;Massachusetts Institute of Technology, Cambridge
Venue:
IEEE Transactions on Computers
Year:
1996

Citing 6
Cited 1

Data networks

Data networks
Sharp approximation models of adaptive routing in mesh networks (preliminary report)

Proc. of the international seminar on Teletraffic analysis and computer performance evaluation
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
Network and processor architecture for message-driven computers

VLSI and parallel computation
Deflection routing in certain regular networks

Deflection routing in certain regular networks
Static and dynamic communication in parallel computing

Static and dynamic communication in parallel computing

Performance of hypercube routing schemes with or without buffering

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	14.98

Visualization

Abstract

We propose a new switching format for multiprocessor networks, which we call Conflict Sense Routing Protocol. This switching format is a hybrid of packet and circuit switching, and combines advantages of both. We initially present the protocol in a way applicable to a general topology. We then present an implementation of this protocol for a hypercube computer and a particular routing algorithm. We also analyze the steady-state throughput of the hypercube implementation for random node-to-node communications.