Study on Broadcasting Algorithm for Parallel Computers

点击翻译按钮获取中文摘要

Our main results are as follows :(1)We proposed a new all-to-all personalized communication algorithm for faulty hypercube networks with link faults. This algorithm is obtained by extending an all-to-all broadcasting algorithm fault-tolerant in the presence of up to n/2 faulty nodes.(2)We presented a discussion on fault-tolerant multicasting algorithms in multistage interconnection networks for constructing efficient communication algorithm. In this work, total nine fractionalizecl schemes are evaluated in terms of required routing steps. Finally, we recommended two fault-tolerant algorithms with the same evaluation.(3)We presented a one-to-one routing algorithm for faulty hypercube networks, and showed that a considerable number of unexplored shortest paths can be found by introducing a preliminary knowledge into the routing.