Fault - Tolerant Multicasting in MIN - based Multicomputers using Cube Encoding Scheme


The KIPS Transactions:PartA, Vol. 8, No. 2, pp. 99-106, Jun. 2001
10.3745/KIPSTA.2001.8.2.99,   PDF Download:

Abstract

In this paper, we study fault-tolerant multicasting in multicomputers based on multistage interconnection networks(MIN's). In addition to one-to-one routing among processing nodes, efficient multicasting has an important effect on the performance of multicomputers. This paper presents a multicasting algorithm to tolerate faulty switching elements. The proposed algorithm uses the cube encoding scheme to represent multicast destinations in MIN, and is based on a recursive scheme in order to bypass faults. This algorithm can route any multicast message to its own destinations in only two passes through the MIN containing several faulty switching elements. Moreover, we prove the correctness of our algorithm by exploiting well-known nonblocking property of MIN.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. S. Kim, J. H. Park, M. K. Kim, "Fault - Tolerant Multicasting in MIN - based Multicomputers using Cube Encoding Scheme," The KIPS Transactions:PartA, vol. 8, no. 2, pp. 99-106, 2001. DOI: 10.3745/KIPSTA.2001.8.2.99.

[ACM Style]
Jin Soo Kim, Jae Hyung Park, and Myung Kyun Kim. 2001. Fault - Tolerant Multicasting in MIN - based Multicomputers using Cube Encoding Scheme. The KIPS Transactions:PartA, 8, 2, (2001), 99-106. DOI: 10.3745/KIPSTA.2001.8.2.99.