| Summary: | 碩士 === 國立成功大學 === 電機工程學系碩博士班 === 101 === Multicast communication can greatly enhance the performance of Networks-on-Chip. Currently most multicast routing methods are either tree-based or path-based. The former may suffer from the problem of multicast deadlocks and the latter may require long routing paths. In this thesis, we propose a hybrid multicast routing approach that combines the advantages of both path-based and tree-based methods. The proposed approach ensures deadlock-free multicast routing without requiring additional virtual channels or large buffers to hold large packets. High routing performance is achieved due to an adaptive routing strategy according to the traffic load. We also investigate several variations of this hybrid approach and identify an algorithm that can achieve the best performance in general. Experimental results show that the saturation point (in terms of injection ratio) of this algorithm is significantly higher than those of the state-of-the-art tree- and path-based multicast routing algorithms. In fact experiments with different network dimensions, buffer sizes, packet sizes, and numbers of destinations per packet under various traffic injection rates have been carried out and the results show that the proposed algorithm outperforms the other two algorithms in all of these experiments.
|
|---|
