The 16th Annual International Symposium on Computer Architecture
DOI: 10.1109/isca.1989.714549
|View full text |Cite
|
Sign up to set email alerts
|

High Performance Communications In Processor Networks

Abstract: In order to provide an arbitrary and fully dynamic connectivity in a network of processors, transport mechanisms must be implemented, which provide the propagation of data from processor to processor, based on addresses contained within a packet of data. Such data transport mechanisms must satisfy a number of requirementsdeadlock and livelock freedom, good hot-spot performance, high throughput and low latency. This paper proposes a solution to these problems, which allows deadlock free, adaptive, high throughp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
25
0

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 50 publications
(25 citation statements)
references
References 7 publications
0
25
0
Order By: Relevance
“…Until now, there are plenty of research papers proposed solution for this question [23], [24], [25], [26]. Each physical channel has two virtual channels, low virtual channel (VC 0 ) and high virtual channel (VC 1 ).…”
Section: A Deadlock-free Routing In 1-d Torusmentioning
confidence: 99%
“…Until now, there are plenty of research papers proposed solution for this question [23], [24], [25], [26]. Each physical channel has two virtual channels, low virtual channel (VC 0 ) and high virtual channel (VC 1 ).…”
Section: A Deadlock-free Routing In 1-d Torusmentioning
confidence: 99%
“…The turn model [8] provides a systematic approach to develop partial adaptive routing algorithms. Fully adaptive routing algorithms use virtual networks to avoid deadlock [10,17]. A virtual network is a subset of channels used to route packets toward a set of destinations.…”
Section: Related Workmentioning
confidence: 99%
“…How to prevent deadlock in ring networks? Until now, there are plenty of research papers propose solutions for this question [13,[22][23][24][25]. Generally, they can be classified into two classes: (1) adopt injection limitation to eliminate cyclic dependencies, (2) prevent deadlock by splitting each physical channel into two virtual channels, low virtual channel (VC 0 ) and high virtual channel (VC 1 ) as shown in Fig.…”
Section: Introductionmentioning
confidence: 99%