%0 Journal Article
%T Efficient Indirect All-to-All Personalized Communication on Rings and 2-D Tori
%A GU Naijie
%A <br>顾乃杰
%J 计算机科学技术学报
%D 2001
%I 
%X All-to-All personalized communication is a basic communication operation in a parallel computing environment. There are a lot of results appearing in literature. All these communication algorithms can be divided into two kinds: direct communication algorithm and indirect communication algorithm. The optimal direct all-to-all communication algorithm on rings and 2-D tori does exist. But, for indirect all-to-all communication algorithms, there is a gap between the time complexity of the already existing algorithm and the lower bound. In this paper an efficient indirect algorithm for all-to-all communication on rings and 2-D square tori with bidirection channels is presented. The algorithms is faster than any previous indirect algorithms. The main items of the time complexity of the algorithm is P2/8 and p3/2/8 on rings and 2-D tori respectively, both reaching the theoretical lower bound, where p is the number of processors.
%K algorithm
%K all-to-all communication
%K parallel computing<br>通信
%K 个性化通信
%K 并行计算
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=4E5604AA3363D673E093AD9B9361BA10&yid=14E7EF987E4155E6&vid=7801E6FC5AE9020C&iid=94C357A881DFC066&sid=2B25C5E62F83A049&eid=2B25C5E62F83A049&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=2&reference_num=9