A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Adaptive Virtual Cut-Through as a Viable Routing Method
1998
Journal of Parallel and Distributed Computing
Adaptive virtual cut-through is considered as a viable alternative to wormhole switching for fast and hardware-efficient interprocessor communication in multicomputers. Computer simulations are used to show that our implementation of a minimal-path fully-adaptive virtual cut-through algorithm outperforms both deterministic and adaptive wormhole switching methods under both uniform random message distributions and clustered distributions such as the matrix transpose. A hardware-efficient
doi:10.1006/jpdc.1998.1466
fatcat:kna74qb66fecvohloatq3xajue