Skip Navigation

The Computer Journal 1990 33(4):323-329; doi:10.1093/comjnl/33.4.323
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Pan, Y.
Right arrow Articles by Melhem, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Short Circuits in Buffered Multi-stage Interconnection Networks

Y. Pan * and R. Melhem *

Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260, USA

A new switching method, called short-circuit switching, is proposed for multistage interconnection networks. It combines the advantages of both message switching and circuit switching methods currently used. An analytical model for predicting the delay time of networks with short-circuits is presented under the assumption of infinite queue length and fixed message length. To remove these assumptions, several simulations were conducted comparing the performance of circuit, short-circuit, and message switchings. These results show that, in multistage interconnection networks, short-circuit switching outperforms message and circuit switchings.

Received February 1990.

* Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.