Novel strategies for cubic and noncubic allocation in hypercube multiprocessors /
Abstract: "A new approach for dynamic processor allocation in hypercube multiprocessors which supports a multi-user environment is proposed. A dynamic binary tree is used for processor allocation along with an array of free lists. Two algorithms are proposed based on this approach that are ca...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Book |
| Language: | English |
| Published: |
College Station, Tex. :
Texas A & M University, Computer Science Dept.,
[1993]
|
| Series: | Technical report (Texas A & M University. Computer Science Department) ;
93-023. |
| Subjects: |
| Summary: | Abstract: "A new approach for dynamic processor allocation in hypercube multiprocessors which supports a multi-user environment is proposed. A dynamic binary tree is used for processor allocation along with an array of free lists. Two algorithms are proposed based on this approach that are capable of handling cubic as well as non-cubic allocation efficiently. The time complexities for both allocation and deallocation are shown to be polynomial; orders of magnitude improvement over the existing exponential and even super-exponential algorithms. Unlike the existing strategies, the proposed strategies are best-fit strategies and do not excessively fragment the hypercube. Simulation results indicate that the proposed strategies outperform the existing ones in terms of parameters such as average delay in honoring a request, average allocation time and average deallocation time." |
|---|---|
| Physical Description: | 38 leaves : illustrations ; 28 cm. |
| Bibliography: | Includes bibliographical references. |