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

Performance of Cross-Bar Multiprocessor Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
9
0

Year Published

1983
1983
1999
1999

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 22 publications
(9 citation statements)
references
References 9 publications
0
9
0
Order By: Relevance
“…= 1 and Cs = 1 / 2, which is the coefficent of variation for the service time Sof the common memory: PE = 45.37 % and QPE = 35.80 % were obtained. This yields L = 0.91 % for a 1 % simulation error with 95 % confidence, and by equation (13), we obtain Ns -24,000.…”
Section: Simulation Experimentsmentioning
confidence: 73%
“…= 1 and Cs = 1 / 2, which is the coefficent of variation for the service time Sof the common memory: PE = 45.37 % and QPE = 35.80 % were obtained. This yields L = 0.91 % for a 1 % simulation error with 95 % confidence, and by equation (13), we obtain Ns -24,000.…”
Section: Simulation Experimentsmentioning
confidence: 73%
“…This leads to the use of a discrete Markov Chain approach [1]- [3] for modeling it. In the second policy, the rejected request is simply discarded [4]- [6]. Clearly, this strategy makes the modeling easy and usually suggests probabilistic approaches.…”
Section: Introductionmentioning
confidence: 99%
“…Some of these studies have resulted in simple expressions for the throughput of these systems. Several papers arc concerned with analyzing multiprocessor systems with non-uniform access probabilities without bus contention [13,14]. These studies are concerned with modeling local reference behavior.…”
Section: Introductionmentioning
confidence: 99%