Partitioning on the banyan-hypercube networks

Author

Bellaachia, Abdelghani ; Youssef, Abdou

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., George Washington Univ., Washington, DC, USA

fYear

1990

fDate

8-10 Oct 1990

Firstpage

343

Lastpage

351

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

Keywords

data structures; hypercube networks; banyan-hypercube; banyan-hypercube networks; buddy system strategy; data structures; hypercube; internal fragmentation; partitioning; request sizes; Computational modeling; Computer science; Concurrent computing; Data structures; Exponential distribution; Hypercubes; Multiprocessor interconnection networks; Parallel machines; Resource management; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Frontiers of Massively Parallel Computation, 1990. Proceedings., 3rd Symposium on the

Conference_Location

College Park, MD

Print_ISBN

0-8186-2053-6

Type

conf

DOI

10.1109/FMPC.1990.89480

Filename

89480