.png){kind=icon}
Return
Bound performance models of heterogeneous parallel processing systems
.png){kind=icon}
PRE
AI
DOI：10.1109/71.730531.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Systems of heterogeneous parallel processing are studied such as arising in parallel programs executed on distributed systems. A lower and an upper bound model are suggested to obtain secure lower and upper bounds on the performance of these systems. The bounding models are solved by using a matrix-geometric algorithmic approach. Formal proofs of the bounds are provided along with error bounds on the accuracy of the bounds. These error bounds in turn are reduced to simple computational expressions. Numerical results are included. The results are of interest for application to arbitrary fork-join models with parallel heterogeneous processors and synchronization.
Keywords:
parallel systems
queuing networks
system performance evaluation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSavePerceptual decisions based on previously learned information are independent of dopaminergic tone
OAAI
OAAIShareSave
View more