A conflict sense routing protocol and its performance for hypercubes

Emmanouel A. Varvarigos; Dimitri P. Bertsekas

doi:10.1109/12.506425

A conflict sense routing protocol and its performance for hypercubes

Emmanouel A. Varvarigos, Dimitri P. Bertsekas

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

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.

Original language	English (US)
Pages (from-to)	693-703
Number of pages	11
Journal	IEEE Transactions on Computers
Volume	45
Issue number	6
DOIs	https://doi.org/10.1109/12.506425
State	Published - 1996
Externally published	Yes

Keywords

Hypercubes
Packet and circuit switching
Random one-to-one communications
Throughput

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computational Theory and Mathematics

Access to Document

10.1109/12.506425

Cite this

@article{76c04bb921cc486eae64fc78f176320b,

title = "A conflict sense routing protocol and its performance for hypercubes",

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.",

keywords = "Hypercubes, Packet and circuit switching, Random one-to-one communications, Throughput",

author = "Varvarigos, {Emmanouel A.} and Bertsekas, {Dimitri P.}",

note = "Funding Information: The authors would like to gratefully thank the (anonymous) reviewers for their helpful suggestions. Research supported by NSF under Grants NSF-DDM-8903385 and NSF-RIA-08930554, and by the ARO under Grants DAAL03-86-K-0171 and DAAL03-92-G-0309.",

year = "1996",

doi = "10.1109/12.506425",

language = "English (US)",

volume = "45",

pages = "693--703",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

publisher = "IEEE Computer Society",

number = "6",

}

TY - JOUR

T1 - A conflict sense routing protocol and its performance for hypercubes

AU - Varvarigos, Emmanouel A.

AU - Bertsekas, Dimitri P.

N1 - Funding Information: The authors would like to gratefully thank the (anonymous) reviewers for their helpful suggestions. Research supported by NSF under Grants NSF-DDM-8903385 and NSF-RIA-08930554, and by the ARO under Grants DAAL03-86-K-0171 and DAAL03-92-G-0309.

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

KW - Hypercubes

KW - Packet and circuit switching

KW - Random one-to-one communications

KW - Throughput

UR - http://www.scopus.com/inward/record.url?scp=0030169171&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030169171&partnerID=8YFLogxK

U2 - 10.1109/12.506425

DO - 10.1109/12.506425

M3 - Article

AN - SCOPUS:0030169171

SN - 0018-9340

VL - 45

SP - 693

EP - 703

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 6

ER -

A conflict sense routing protocol and its performance for hypercubes

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this