The Community for Technology Leaders
Green Image
We develop a message scheduling scheme for efficiently realizing all-to-all personalized communication (AAPC) on Ethernet switched clusters with one or more switches. To avoid network contention and achieve high performance, the message scheduling scheme partitions AAPC into phases such that 1) there is no network contention within each phase and 2) the number of phases is minimum. Thus, realizing AAPC with the contention-free phases computed by the message scheduling algorithm can potentially achieve the minimum communication completion time. In practice, phased AAPC schemes must introduce synchronizations to separate messages in different phases. We investigate various synchronization mechanisms and various methods for incorporating synchronizations into the AAPC phases. Experimental results show that the message scheduling-based AAPC implementations with proper synchronization consistently achieve high performance on clusters with many different network topologies when the message size is large
switched networks, local area networks, network topology, scheduling,network topology, message scheduling, all-to-all personalized communication, Ethernet, switched cluster, contention-free phase,Ethernet networks, Communication switching, Processor scheduling, Network topology, Scheduling algorithm, Switches, Bandwidth, Message passing, Multidimensional systems, Convolution,scheduling., All-to-all personalized communications, Ethernet
"A Message Scheduling Scheme for All-to-All Personalized Communication on Ethernet Switched Clusters", IEEE Transactions on Parallel & Distributed Systems, vol. 18, no. , pp. 264-276, February 2007, doi:10.1109/TPDS.2007.19
98 ms
(Ver 3.3 (11022016))