The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (1990 vol.1)
pp: 120-126
ABSTRACT
<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 TERMS
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
CITATION
M. Jeng, "A Distributed Management Scheme for Partitionable Parallel Computers", IEEE Transactions on Parallel & Distributed Systems, vol.1, no. 1, pp. 120-126, January 1990, doi:10.1109/71.80130
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool