Dynamic bucket allocation algorithms for a load-balanced parallel hash join in the hypercube multicomputer system /
Abstract: "This paper proposes two dynamic bucket allocation algorithms to be used for parallel hash join on the shared-nothing, hypercube multicomputer system: The first algorithm modifies an existing centralized algorithm developed for the general shared-nothing multicomputer systems [9], to...
| 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-032. |
| Subjects: |
| Summary: | Abstract: "This paper proposes two dynamic bucket allocation algorithms to be used for parallel hash join on the shared-nothing, hypercube multicomputer system: The first algorithm modifies an existing centralized algorithm developed for the general shared-nothing multicomputer systems [9], to be suitable for the hypercube multicomputer system; in the second algorithm, every node participates in dynamic bucket allocation by exchanging subbucket distribution information with its cube neighbors in a fully distributed manner. Both of our algorithms effectively balance the loads of the node in the system. The distributed algorithm outperforms the centralized algorithm, since the former does not require broadcasting of balancing information. Compared to the well-known bucket spreading algorithms, the communication overhead of our algorithms is substantially low." |
|---|---|
| Item Description: | "December 1992." |
| Physical Description: | 22 leaves : illustrations ; 28 cm. |
| Bibliography: | Includes bibliographical references. |