A new routing method to tolerate both convex and concave faulty regions in mesh/torus networks

Huaxi Gu; Hong Shen; Zengji Liu; Guochang Kang

doi:10.1109/PDCAT.2005.27

A new routing method to tolerate both convex and concave faulty regions in mesh/torus networks

Huaxi Gu, Hong Shen, Zengji Liu, Guochang Kang

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

6 Citations (Scopus)

Abstract

To make the exiting fault routing algorithms tolerate concave fault regions without disabling any healthy nodes, the concept of hole is proposed in this paper. A hole consists of healthy nodes in the concave parts and neighborhood of a given concave fault region. By guiding the packet routing inside and outside the hole, the new routing method empowers the convex fault tolerant routing algorithm to tolerate concave shape regions without disabling any healthy nodes. The proposed modification method is simple and does not add new virtual channels. Moreover, it doesn't change the rules of the previous algorithms. Finally, the performance of the modified routing algorithm is simulated under various concave fault patterns.

Original language	English
Title of host publication	Proceedings - Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005
Pages	714-718
Number of pages	5
DOIs	https://doi.org/10.1109/PDCAT.2005.27
Publication status	Published - 2005
Externally published	Yes
Event	6th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005 - Dalian, China Duration: 5 Dec 2005 → 8 Dec 2005

Publication series

Name	Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings
Volume	2005

Conference

Conference	6th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005
Country/Territory	China
City	Dalian
Period	5/12/05 → 8/12/05

Access to Document

10.1109/PDCAT.2005.27

Cite this

Gu, H., Shen, H., Liu, Z., & Kang, G. (2005). A new routing method to tolerate both convex and concave faulty regions in mesh/torus networks. In Proceedings - Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005 (pp. 714-718). Article 1579014 (Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings; Vol. 2005). https://doi.org/10.1109/PDCAT.2005.27

Gu, Huaxi ; Shen, Hong ; Liu, Zengji et al. / A new routing method to tolerate both convex and concave faulty regions in mesh/torus networks. Proceedings - Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005. 2005. pp. 714-718 (Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings).

@inproceedings{c03cbc8c458c4bff85fe547a0847aa85,

title = "A new routing method to tolerate both convex and concave faulty regions in mesh/torus networks",

abstract = "To make the exiting fault routing algorithms tolerate concave fault regions without disabling any healthy nodes, the concept of hole is proposed in this paper. A hole consists of healthy nodes in the concave parts and neighborhood of a given concave fault region. By guiding the packet routing inside and outside the hole, the new routing method empowers the convex fault tolerant routing algorithm to tolerate concave shape regions without disabling any healthy nodes. The proposed modification method is simple and does not add new virtual channels. Moreover, it doesn't change the rules of the previous algorithms. Finally, the performance of the modified routing algorithm is simulated under various concave fault patterns.",

author = "Huaxi Gu and Hong Shen and Zengji Liu and Guochang Kang",

year = "2005",

doi = "10.1109/PDCAT.2005.27",

language = "English",

isbn = "0769524052",

series = "Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings",

pages = "714--718",

booktitle = "Proceedings - Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005",

note = "6th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005 ; Conference date: 05-12-2005 Through 08-12-2005",

}

Gu, H, Shen, H, Liu, Z & Kang, G 2005, A new routing method to tolerate both convex and concave faulty regions in mesh/torus networks. in Proceedings - Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005., 1579014, Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, vol. 2005, pp. 714-718, 6th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005, Dalian, China, 5/12/05. https://doi.org/10.1109/PDCAT.2005.27

A new routing method to tolerate both convex and concave faulty regions in mesh/torus networks. / Gu, Huaxi; Shen, Hong; Liu, Zengji et al.
Proceedings - Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005. 2005. p. 714-718 1579014 (Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings; Vol. 2005).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A new routing method to tolerate both convex and concave faulty regions in mesh/torus networks

AU - Gu, Huaxi

AU - Shen, Hong

AU - Liu, Zengji

AU - Kang, Guochang

PY - 2005

Y1 - 2005

N2 - To make the exiting fault routing algorithms tolerate concave fault regions without disabling any healthy nodes, the concept of hole is proposed in this paper. A hole consists of healthy nodes in the concave parts and neighborhood of a given concave fault region. By guiding the packet routing inside and outside the hole, the new routing method empowers the convex fault tolerant routing algorithm to tolerate concave shape regions without disabling any healthy nodes. The proposed modification method is simple and does not add new virtual channels. Moreover, it doesn't change the rules of the previous algorithms. Finally, the performance of the modified routing algorithm is simulated under various concave fault patterns.

AB - To make the exiting fault routing algorithms tolerate concave fault regions without disabling any healthy nodes, the concept of hole is proposed in this paper. A hole consists of healthy nodes in the concave parts and neighborhood of a given concave fault region. By guiding the packet routing inside and outside the hole, the new routing method empowers the convex fault tolerant routing algorithm to tolerate concave shape regions without disabling any healthy nodes. The proposed modification method is simple and does not add new virtual channels. Moreover, it doesn't change the rules of the previous algorithms. Finally, the performance of the modified routing algorithm is simulated under various concave fault patterns.

UR - http://www.scopus.com/inward/record.url?scp=33745163554&partnerID=8YFLogxK

U2 - 10.1109/PDCAT.2005.27

DO - 10.1109/PDCAT.2005.27

M3 - Conference contribution

AN - SCOPUS:33745163554

SN - 0769524052

SN - 9780769524054

T3 - Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings

SP - 714

EP - 718

BT - Proceedings - Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005

T2 - 6th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005

Y2 - 5 December 2005 through 8 December 2005

ER -

Gu H, Shen H, Liu Z, Kang G. A new routing method to tolerate both convex and concave faulty regions in mesh/torus networks. In Proceedings - Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005. 2005. p. 714-718. 1579014. (Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings). doi: 10.1109/PDCAT.2005.27

A new routing method to tolerate both convex and concave faulty regions in mesh/torus networks

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this