|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Ahmad Faraj, Xin Yuan, Pitch Patarasuk, "A Message Scheduling Scheme for All-to-All Personalized Communication on Ethernet Switched Clusters," IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 2, pp. 264-276, February, 2007. | |||
| BibTex | x | ||
| @article{ 10.1109/TPDS.2007.19, author = {Ahmad Faraj and Xin Yuan and Pitch Patarasuk}, title = {A Message Scheduling Scheme for All-to-All Personalized Communication on Ethernet Switched Clusters}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {18}, number = {2}, issn = {1045-9219}, year = {2007}, pages = {264-276}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2007.19}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Parallel and Distributed Systems TI - A Message Scheduling Scheme for All-to-All Personalized Communication on Ethernet Switched Clusters IS - 2 SN - 1045-9219 SP264 EP276 EPD - 264-276 A1 - Ahmad Faraj, A1 - Xin Yuan, A1 - Pitch Patarasuk, PY - 2007 KW - All-to-all personalized communications KW - Ethernet KW - scheduling. VL - 18 JA - IEEE Transactions on Parallel and Distributed Systems ER - | |||
Abstract—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.