PERFORMANCE ANALYSIS OF FULLY ADAPTIVE ROUTING ALGORITHMS IN WORMHOLE-SWITCHED INTERCONNECT NETWORKS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SAFAEI F.; KHANSARI A.; FATHI MAHMOUD; OULD KHAOUA M.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING Year:2005 | Volume:3 | Issue:2-4 (B) Page(s): 27-38

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

1,486

Download:

Cites:

Information Journal Paper

Title

PERFORMANCE ANALYSIS OF FULLY ADAPTIVE ROUTING ALGORITHMS IN WORMHOLE-SWITCHED INTERCONNECT NETWORKS

Author(s)

SAFAEI F. | KHANSARI A. | FATHI MAHMOUD | OULD KHAOUA M. | Issue Writer Certificate

Keywords

MASSIVELY PARALLEL COMPUTERSQ4

INTERCONNECT NETWORKSQ4

TORUSQ4

ADAPTIVE ROUTINGQ4

VIRTUAL CHANNELSQ4

MESSAGE LATENCYQ4

QUEUING THEORYQ4

AND PERFORMANCE EVALUATIONQ4

Abstract

As the number of elements in large-scale MASSIVELY PARALLEL COMPUTERS, Multiprocessors System-on-Chip (MP-SoCs), and peer-to-peer communication networks increases, the probability of component failure becomes significant. Consequently, fault-tolerance turns out to be a key issue in the design of such systems. ADAPTIVE ROUTING algorithms have been frequently suggested as a means of improving communication performance in such systems these algorithms, unlike deterministic routing, can utilize network state information to exploit the presence of multiple paths. Before such schemes can be successfully incorporated in networks, it is necessary to have a clear understanding of the factors which affect their performance potential this paper investigates the performance of nine prominent adaptive fault-tolerant routing algorithms in wormhole-switched 2-D tori with a routing scheme suggested by Chalasani and Boppana, as an instance of a fault-tolerant method. The suggested scheme is widely used in the literature to achieve high adaptivity and support interprocessor communications in MASSIVELY PARALLEL COMPUTERS due to its ability to preserve both communication performance and fault-tolerant demands in these networks. The performance measures studied in the paper are the throughput, average MESSAGE LATENCY and average usage of VIRTUAL CHANNELS per node. Results obtained through simulation suggest two classes of presented routing schemes as high performance candidates in most faulty networks Furthermore; we propose an analytical model to assess the performance behavior of a fully ADAPTIVE ROUTING which has been shown to be one of the most efficient routings in the TORUS networks. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

Cites

No record.

References

No record.

Cite

APA: Copy

SAFAEI, F., KHANSARI, A., FATHI, MAHMOUD, & OULD KHAOUA, M.. (2005). PERFORMANCE ANALYSIS OF FULLY ADAPTIVE ROUTING ALGORITHMS IN WORMHOLE-SWITCHED INTERCONNECT NETWORKS. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, 3(2-4 (B)), 27-38. SID. https://sid.ir/paper/70688/en

Vancouver: Copy

SAFAEI F., KHANSARI A., FATHI MAHMOUD, OULD KHAOUA M.. PERFORMANCE ANALYSIS OF FULLY ADAPTIVE ROUTING ALGORITHMS IN WORMHOLE-SWITCHED INTERCONNECT NETWORKS. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING[Internet]. 2005;3(2-4 (B)):27-38. Available from: https://sid.ir/paper/70688/en

IEEE: Copy

F. SAFAEI, A. KHANSARI, MAHMOUD FATHI, and M. OULD KHAOUA, “PERFORMANCE ANALYSIS OF FULLY ADAPTIVE ROUTING ALGORITHMS IN WORMHOLE-SWITCHED INTERCONNECT NETWORKS,” THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, vol. 3, no. 2-4 (B), pp. 27–38, 2005, [Online]. Available: https://sid.ir/paper/70688/en

Related Journal Papers