A new general method to compute virtual channels occupancy probabilities in wormhole networks

DOI10.1016/J.JCSS.2007.07.006zbMath1154.68341OpenAlexW2046601050MaRDI QIDQ941457

N. Alzeidi, Mohamed Ould-Khaoua, Ahmad Khonsari

Publication date: 1 September 2008

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2007.07.006

zbMATH Keywords

simulationnetworkswormhole switchingmulticomputersM/G/1 queuesperformance modelling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Real-time wormhole channels.
• Compressionless wormhole routing: an analysis for hypercube with virtual channels
• A performance model for Duato's fully adaptive routing algorithm in k-ary n-cubes
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• An accurate analytical model of adaptive wormhole routing in k-ary n-cubes interconnection networks

This page was built for publication: A new general method to compute virtual channels occupancy probabilities in wormhole networks