Partitioning on the banyan-hypercube networks

Abstract

Partitioning strategies, as well as data structures for partitioning, are proposed and studied. Simulation results of internal, external, and total fragmentations for uniform and exponential distributions of request sizes are presented and discussed. The buddy system strategy of partitioning the hypercube is also simulated for comparison purposes. It is shown that the banyan-hypercube (BH) exhibits a better internal fragmentation than the hypercube, and for large request sizes the total fragmentation of the two networks is comparable. It is also shown that the internal fragmentation in BH decreases as the number of levels of BH increases.<>