A distributed subcube management strategy for hypercube multiprocessor systems /
Abstract: "In this paper, we present a distributed subcube management strategy for multiple instruction multiple data (MIMD) type hypercube multiprocessor systems. In our strategy, processors coordinate with each other for allocating and deallocating subcubes through interprocessor communicati...
| 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-007. |
| Subjects: |
| Summary: | Abstract: "In this paper, we present a distributed subcube management strategy for multiple instruction multiple data (MIMD) type hypercube multiprocessor systems. In our strategy, processors coordinate with each other for allocating and deallocating subcubes through interprocessor communication. Concurrent subcube allocation/deallocation activities are ordered by a synchronized-broadcast mechanism based on the framework of lattices of hypercubes. Information about free subcubes is defined by a new data structure, called the Subcube Identification Table (SIT), to be distributed between idle processors for distributed allocation of free subcubes. It is shown that both the best-fit and first-fit subcube allocation strategies can be easily incorporated into our scheme. The time complexities of our deallocation and allcoation [sic] algorithms are estimated as O(M*n) and O(n²), respectively, where M is the number of busy subcubes, and n the dimension of the hypercube computer, assuming that all messages are transmitted sequentially." |
|---|---|
| Item Description: | "April 1992." |
| Physical Description: | 30 leaves : illustrations ; 28 cm. |
| Bibliography: | Includes bibliographical references. |