Comparison of Multiplexing Schemes for Wormhole-Routed Networks

this paper we compare the performance of time and demand multiplexing using a simulation based approach. We show that demand multiplexing consistently outperforms time multiplexing--the improvement in message latency varies from 20% to 100% for representative traffic patterns and for a variety of routing algorithms on a mesh architecture. 1 Introductio