[1991] Proceedings. The Fifth International Parallel Processing Symposium
DOI: 10.1109/ipps.1991.153820
|View full text |Cite
|
Sign up to set email alerts
|

Packed exponential connections-a hierarchy of 2-D meshes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 17 publications
(11 citation statements)
references
References 5 publications
0
11
0
Order By: Relevance
“…PEC [5] is a relative new interconnection network for augmenting a nearest-neighbor mesh with longer distance connections. Each node of a 2-D PEC network requires a constant of eight connections, where the extra four lines connect nodes 2 h , called level h connection, distance away along the (N,W,S,E) direction of an ordinary 2-D mesh.…”
Section: Resultsmentioning
confidence: 99%
See 4 more Smart Citations
“…PEC [5] is a relative new interconnection network for augmenting a nearest-neighbor mesh with longer distance connections. Each node of a 2-D PEC network requires a constant of eight connections, where the extra four lines connect nodes 2 h , called level h connection, distance away along the (N,W,S,E) direction of an ordinary 2-D mesh.…”
Section: Resultsmentioning
confidence: 99%
“…PEC network is a new interconnection network that solves the problems of scale and connectivity by augmenting a two dimensional mesh with additional long connections [5]. It has very promising characteristics for supporting large scale MIMD parallel processing.…”
Section: Packed Exponential Connections Networkmentioning
confidence: 99%
See 3 more Smart Citations