Greedy partitioning strategy for banyan-hypercube networks

The authors have developed a partitioning strategy (FP) for banyan-hypercubes (BHs) networks, similar to the best fit strategy of memory allocation. They design and study a greedy partitioning (GP) strategy for BHs which to some extent resembles the first fit strategy of memory allocation. They simulated both FP and GP strategies. The simulation results show that the two strategies yield the same system performance. However, the FP strategy runs faster than the GP strategy and is preferable for practical considerations