document: Pipelined broadcast with enhanced wormhole routers This paper proposes a pipelined broadcast that broadcasts a message of size m in O -LRB- m + n-1 -RRB- time in an n-dimensional hypercube . It is based on the replication tree , which is derived from reachable sets . It has greatly improved performance compared to Ho-Kao 's -LRB- 1995 -RRB- algorithm with the time of O -LRB- m -LSB- n/log -LRB- n +1 -RRB- -RSB- -RRB- . The communication in the broadcast uses an all-port wormhole router with message replication capability . This paper includes the algorithm together with performance comparisons to previous schemes in a practical implementation
doc_bio_tags: B I O B I I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O B I O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O B O O O O O O O O
extractive_keyphrases: enhanced wormhole routers replication tree reachable sets performance message replication capability pipelined broadcast
abstractive_keyphrases: message broadcast n-dimensional hypercube communication complexity all-port wormhole router intermediate reception