Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Safaei, F.; Khonsari, A.; Fathy, M.; Alzeidi, N.; Ould-Khaoua, M. (2006)
Publisher: IEEE Computer Society
Languages: English
Types: Other
Subjects: QA75
Circuit switching (CS) has been suggested as an efficient switching method for supporting simultaneous communications (such as data, voice, and images) across parallel systems due to its ability to preserve both communication performance and fault-tolerant demands in such systems. In this paper we present an efficient scheme to capture the mean message latency in 2D torus with CS in the presence of faulty components. We have also conducted extensive simulation experiments, the results of which are used to validate the analytical model
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • W.J. Dally and B. Towles, Principles and practices of interconnection networks, Morgan Kaufman Publishers, 2004.
    • P. Mohapatra, Wormhole Routing Techniques for Directly Connected Multicomputer Systems, ACM Computing Surveys, Vol. 30, No. 3, September 1998.
    • P. Molinero-Fernandez, N. McKeown, The Performance of Circuit Switching in the Internet, [4] Journal of Optical Networking, Vol. 2, pp. 82-96, 2003.
    • G. Min, M. Ould-Khaoua, H. Sdazi-Azad, Communication Delay in Circuit-Switched Interconnection Networks, IPCCC 2001, pp. 51-56, 2001.
    • J. Duato, S. Yalamanchili, L.M. Ni, Interconnection networks: An engineering approach, Morgan Kaufmann Publishers, 2003.
    • 25, No. 2, pp. 151-167, 1996.
    • M. Colajarmi, B. Ciciani, S. Tucci, Performance analysis of circuit-switching interconnection networks with deterministic and adaptive routing, Performance Evaluation, Vol. 34, No. l, pp. 1-26, 1998.
    • Parallel & Distributed systems, Vol. 8, No. 4, pp.349-366, 1997.
    • W.J. Dally, Performance analysis of k-ary n-cubes interconnection networks, IEEE Trans. Computers, Vol. 39, No.6, pp. 775-785, 1990.
    • L. Kleinrock, Queueing Systems, Vol. 1, John Wiley, New York, 1975.
    • M. Ould-Khaoua, A Performance model for Duato's adaptive routing algorithm in k-ary n-cubes, IEEE Trans. Computers, Vol. 48, No 12, pp. 1-8, 1999.
    • A. Agarwal, Limits on interconnection network performance, IEEE Trans. Parallel & Distributed Systems, Vol. 2, No. 4, pp. 398-412, 1991.
    • J. Draper, J. Ghosh, A comprehensive analytical model for wormhole routing in multicomputers systems, Journal of Parallel and Distributed Computing (JPDC), Vol. 32, pp. 202-214, 1994.
    • Parallel & Distributed Systems, Vol. 3, No. 2, pp.
    • G. Min, M. Ould-Khaoua, A Comparative Study of Switching Methods in Multicomputer Networks, Journal of Supercomputing Vol. 21, pp. 227-238, 2002.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article