Parallel algorithms for hypercube allocation /
Abstract: "Parallel algorithms of the hypercube allocation strategies are considered in this paper. Although the sequential algorithms of various hypercube allocation strategies are easier to implement, their worst case time complexities exponentially increase as the dimension of the hypercub...
| Main Author: | |
|---|---|
| Other Authors: | |
| 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-025. |
| Subjects: |
Cushing: Texas A&M (Does not check out)
| Call Number: |
QA76 .C656 92-025 |
|
|---|---|---|
| Call Number | Status | Get It |
| QA76 .C656 92-025 | Available | |