Issue No.03 - March (1994 vol.43)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.272439
<p>Presents an algorithm that solves the conflict resolution problem in fault-tolerant multicast-connected MINs. Without loss of generality, the authors apply the algorithm to reconfigure a four-path cube-based network. An intensive simulation study is conducted to reveal the performance improvement gained by the conflict resolution and fault-free path selection algorithm on the network under study. The simulation results indicate that the probability of failure to provide multicast connections using two paths is comparable to that of using three and four paths under various fault scenarios. The results also indicate that an effective reconfiguration algorithm based on two alternate paths has a great impact on the network performance in the presence of faults and conflicts.</p>
multiprocessor interconnection networks; fault tolerant computing; conflict resolution; multicast-connected; cube-based; MINs; fault-free path selection; performance improvement; simulation results; probability of failure; multicast connections; reconfiguration algorithm; network performance; faults; conflicts.
A.A. Abonamah, N.K. Sharma, "Conflict Resolution and Fault-Free Path Selection in Multicast-Connected Cube-Based Networks", IEEE Transactions on Computers, vol.43, no. 3, pp. 374-380, March 1994, doi:10.1109/12.272439