1990
DOI: 10.1016/0196-6774(90)90012-4
|View full text |Cite
|
Sign up to set email alerts
|

Sorting on a ring of processors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
5
0

Year Published

1992
1992
1998
1998

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 3 publications
0
5
0
Order By: Relevance
“…On the other hand, they show that if the nodes can hold six packets at a time, then 1 1 sorting can be performed in wnÂ2x+1 steps [205].…”
Section: Mesk-like Networkmentioning
confidence: 98%
“…On the other hand, they show that if the nodes can hold six packets at a time, then 1 1 sorting can be performed in wnÂ2x+1 steps [205].…”
Section: Mesk-like Networkmentioning
confidence: 98%
“…We focus on the ring architecture, which is an important network in both theory and practice. From a theoretical perspective, the ring is a basic network structure, and much work has been done on developing and analyzing algorithms for it [5,7,16,22,24,30,31]. In practice the ring is either the basis of or an essential component of many parallel and distributed architectures [20,28,32,33].…”
mentioning
confidence: 99%
“…The ring is an important network in both theory and practice. From a theoretical perspective, the ring is a basic network structure and much work has been done developing and analyzing algorithms for it ASW88, HP89, Lei91,MS90]. From a practical perspective, the ring is either the foundation of or a component of many parallel architectures Hut88, Rot92, Tel94].…”
Section: Preliminariesmentioning
confidence: 99%