Simulating computer systems: techniques and tools
Simulating computer systems: techniques and tools
A comprehensive analytical model for wormhole routing in multicomputer systems
Journal of Parallel and Distributed Computing
Probability, stochastic processes, and queueing theory: the mathematics of computer performance modeling
Performance Analysis of Finite-Buffered Asynchronous Multistage Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Computer Networks and ISDN Systems
Route packets, not wires: on-chip inteconnection networks
Proceedings of the 38th annual Design Automation Conference
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Modeling of interconnection subsystems for massively parallel computers
Performance Evaluation
Computer Systems Performance Evaluation and Prediction
Computer Systems Performance Evaluation and Prediction
Principles and Practices of Interconnection Networks
Principles and Practices of Interconnection Networks
Editorial: Performance modeling and evaluation of high-performance parallel and distributed systems
Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
Prediction of communication delay in torus networks under multiple time-scale correlated traffic
Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
On the Performance of Routing Algorithms in Wormhole-Switched Multicomputer Networks
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Analytical modelling of networks in multicomputer systems under bursty and batch arrival traffic
The Journal of Supercomputing
Static timing analysis for modeling QoS in networks-on-chip
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Owing to its simple router design and insensitivity to the message distance, wormhole switching has been employed not only in networks for contemporary multicomputers but also, in networks for clusters of workstations, and more recently in networks for systems-on-chips. Although analytical performance models for wormhole-switched networks have been widely reported in the literature, most of these models have assumed no (or negligible) buffers at a given router in order to ease the derivation of the model. In this paper, we propose a new simple and yet accurate model to capture the effects of finite buffers on the performance of wormhole-switched networks. Simulation experiments demonstrate the validity of the suggested model under various operating conditions.