Analysis of Pipelined Circuit Switching in Cube Networks (Research Note)

Authors:
Geyong Min;Mohamed Ould-Khaoua
Affiliations:
-;-
Venue:
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Year:
2000

Citing 5
Cited 1

A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks

IEEE Transactions on Parallel and Distributed Systems
A Performance Model for Duato's Fully Adaptive Routing Algorithm in k$k$-Ary n$n$-Cubes

IEEE Transactions on Computers
Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach
Virtual-Channel Flow Control

IEEE Transactions on Parallel and Distributed Systems
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems

Performance Analysis of Wormhole-Switched k-Ary n-Cubes with Bursty Traffic

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes the first analytical model of pipelined circuit switching (PCS) in cube networks. The model uses a Markov chain to analyse the backtracking actions of the header flit during the path set-up phase in PCS. One of the main features of the present model is its ability to capture the effects of using virtual channels. The validity of the model is demonstrated by comparing analytical results to those obtained through simulation experiments.