JISE


  [1] [2] [3] [4] [5] [6] [7] [8] [9]


Journal of Information Science and Engineering, Vol. 19 No. 3, pp. 479-501


A Scalable Core Migration Protocol for Dynamic Multicast Tree


Ting-Yuan Wang, Lih-Chyau Wuu** and Shing-Tsaan Huang+
Department of Computer Science 
National Tsing Hua University 
Hsinchu, 300 Taiwan 
**Department of Electrical Engineering 
National Yunlin University of Science & Technology 
Touliu, 640 Taiwan 
E-mail: wuulc@yuntech.edu.tw 
+Department of Computer Science 
National Central University 
Chungli, 320 Taiwan


    Wormhole routing is most commonly used in parallel architectures in which messages are sent in small fragments, called flits. It is a lightweight and efficient method of routing messages between parallel processors. Self-stabilization is a technique that guarantees tolerance to transient faults (e.g., memory corruption or communication hazards) for a given protocol. Self-stabilization guarantees that the network recovers to a correct behavior in a finite amount of time, without the need for human intervention. Self-stabilization also guarantees the safety property, meaning that once the network is in a legitimate state, it will remain there until another fault occurs. This paper presents the first self-stabilizing network algorithm in the wormhole routing model, using the unidirectional ring topology. Our solution benefits from wormhole routing by providing high throughput and low latency, and from self-stabilization by ensuring automatic resilience to all possible transient failures.


Keywords: distributed algorithms, fault-tolerance, self-stabilization, wormhole routing, interconnexion networks, virtual channels

  Retrieve PDF document (JISE_200303_06.pdf)