1990
DOI: 10.1049/ip-e.1990.0006
|View full text |Cite
|
Sign up to set email alerts
|

Traffic routing algorithm for serial superchip system customisation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

1993
1993
2022
2022

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 12 publications
(7 citation statements)
references
References 1 publication
0
7
0
Order By: Relevance
“…The times of simulations for Chao i , i∈ [1,10] and n∈ [3,70] are shown in figure 3 (the average values of time by 10 000 simulations for each n). In the figures below, Chao i is denoted as C-i for i = 1, 2,...…”
Section: Conditions For the Simulationmentioning
confidence: 99%
“…The times of simulations for Chao i , i∈ [1,10] and n∈ [3,70] are shown in figure 3 (the average values of time by 10 000 simulations for each n). In the figures below, Chao i is denoted as C-i for i = 1, 2,...…”
Section: Conditions For the Simulationmentioning
confidence: 99%
“…The matrix T defines a uniform traffic matrix if all its elements are equal [3]. In order to use a large-scale computer simulation we need a type of uniform matrices T with the following properties:…”
Section: A Model Of Uniform Trafficmentioning
confidence: 99%
“…The randomly incoming traffic in crossbar switch must be effectively controlled and scheduled. The problem for calculating of non-conflict schedule is NP-complete [3] and many algorithms which solve the problem partially are suggested.…”
Section: Introductionmentioning
confidence: 99%
“…This is obtained by means of a conflict-free schedule calculated by the control block of the switch node (Scheduler -figure 1) [1,2]. From a mathematical point of view, the calculation of this schedule is an NP-hard task [3]. The existing approaches partly solve the problem by using different formal apparatus [4].…”
Section: Introductionmentioning
confidence: 99%