1982
DOI: 10.1109/tc.1982.1675944
|View full text |Cite
|
Sign up to set email alerts
|

Routing Schemes for the Augmented Data Manipulator Network in an MIMD System

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
26
0

Year Published

1982
1982
2014
2014

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 70 publications
(26 citation statements)
references
References 18 publications
0
26
0
Order By: Relevance
“…The routing tag defined can only specify strictly dominant paths. Given a source address S and a routing tag T = tntn_1...to, the value of the destination address D is calculated as [12]: t D = S + (-I) n(tn_12n-1 + ... + t020) mod N.…”
Section: Summary Of Previous Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…The routing tag defined can only specify strictly dominant paths. Given a source address S and a routing tag T = tntn_1...to, the value of the destination address D is calculated as [12]: t D = S + (-I) n(tn_12n-1 + ... + t020) mod N.…”
Section: Summary Of Previous Resultsmentioning
confidence: 99%
“…Then T' is equivalent to T [12]. This allows conversion from a strictly positive dominant tag to a strictly negative dominant tag, and vice versa.…”
Section: Summary Of Previous Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…The switch elements at each stage are interconnected by the PM2'(Plus-Minus 21) interconnection method [6] [4]. The P-th switch element on the left of the i-th stage is interconnected to the switch element on the right of the i-th stage by the following relation:.…”
Section: Gamma and Igamma Networkmentioning
confidence: 99%