The Community for Technology Leaders
Green Image
<p>A distributed scheme for dynamic partitioning is investigated. Distributed procedures to split a subsystem and to combine subsystems are presented. The correctness of each of these two procedures is shown, and the complexity is analyzed. The procedures are applicable to parallel computers that use interconnection networks, such as hypercube, omega, multistage cube, and extra-stage cube networks.</p>
Index TermsPASM; task allocation; parallel computation; distributed splitting process; speed-up oriented; resource fragments; distributed combining process; throughput oriented; distributed management scheme; partitionable parallel computers; dynamic partitioning; correctness; interconnection networks; hypercube; omega; multistage cube; extra-stage cube networks; computational complexity; multiprocessor interconnection networks; parallel architectures

H. Siegel and M. Jeng, "A Distributed Management Scheme for Partitionable Parallel Computers," in IEEE Transactions on Parallel & Distributed Systems, vol. 1, no. , pp. 120-126, 1990.
86 ms
(Ver 3.3 (11022016))