Efficient collective data distribution in all-port wormhole-routed hypercubes, Hal. 792-801
D.F. Robinson; D. Judd P. K. McKinley, and B.H.C. Cheng;
Proceedings supercomputing'93 Portland, Oregon November 15-19
Lokasi : Perpustakaan Fakultas Ilmu Komputer
Tidak ada review pada koleksi ini: 40577
This paper addresses the problem of collection data distribution, specifically multcast, in wormhole-routed hypercubes. The system model allows a processor to send and receive data in all dimensions simulatancously. New theoretical rsults htat characterize contention among messages in to design new multicas routing algoritms. THe Algorithms are compared interms of the number of steps required in each, their measured execution times whe implemented on a relatively small-scale nCUBE-2, and their simulated execution times on larger hypercubes. The results indicate that significant perfomance inprovement is possible whe the multicast algorithm actively indentifies and uses multiple ports in paralle.