DMCA
Latency Reduction in Multiple Multicasts via Hybrid Static-Dynamic Scheduling (1998)
BibTeX
@MISC{Surma98latencyreduction,
author = {David R. Surma and Edwin H.-M. Sha and Peter M. Kogge},
title = {Latency Reduction in Multiple Multicasts via Hybrid Static-Dynamic Scheduling},
year = {1998}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper presents a novel approach to reduce the communication costs incurred when performing multiple multicasts on wormhole k-ary n-cube multiprocessor systems. Both uni-cast and path-based implementations of multicasting incur communication costs due to the inherent message passing and contention for network resources. The start-up time dominates the transmission time when the data volume is small. However, in the presence of multiple multicasts when the data volume is very large, the communication delays due to message blocking and resource contention become very significant. Because of this, we present a hybrid static-dynamic technique to reduce the communication costs incurred when performing multiple multicasts on worm-hole routed direct networks. This technique requires a focus on ordering and routing information for the individual message transmissions. At compile time, each message is assigned a priority using the recently developed collision graph model. Then, ...
Keyphrases
multiple multicasts hybrid static-dynamic scheduling latency reduction data volume communication cost resource contention direct network collision graph model incur communication cost communication delay individual message transmission novel approach path-based implementation wormhole k-ary n-cube multiprocessor system hybrid static-dynamic technique transmission time compile time start-up time network resource inherent message passing
