Estimation of optimum size of hypercube for a given parallel algorithm /
Abstract: "In an ideal situation, with increase in the number of processors in a machine, the execution time should decrease proportionally. But in reality with increase in the number of processors, the time to communicate intermediate computed results also increases. For every algorithm, bey...
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
College Station, Tex. :
Texas A & M University, Computer Science Dept.,
[1992]
|
| Series: | Technical report (Texas A & M University. Computer Science Department) ;
92-023. |
| Subjects: |
Cushing: Texas A&M (Does not check out)
| Call Number: |
QA76 .C656 92-023 |
|
|---|---|---|
| Call Number | Status | Get It |
| QA76 .C656 92-023 | Available | |