Towards Data Partitioning for Parallel Computing on Three Interconnected Clusters
Files in This Item:
|Becker_Lastovetsky_2007.pdf||695.11 kB||Adobe PDF||Download|
|Title:||Towards Data Partitioning for Parallel Computing on Three Interconnected Clusters||Authors:||Becker, Brett A.; Lastovetsky, Alexey||Permanent link:||http://hdl.handle.net/10197/7328||Date:||8-Jul-2007||Online since:||2015-12-22T12:16:26Z||Abstract:||We present a new data partitioning strategy for parallel computing on three interconnected clusters. This partitioning has two advantages over existing partitionings. First it can reduce communication time due to a lower total volume of communication and a more efficient communication schedule. When the network topology is a linear array this partitioning always results in a lower total volume of communication compared to existing partitionings, provided the most powerful node is at the center of the array. When the topology is fully connected this partitioning results in a lower total volume of communication for all but a few power ratios. Second, it allows for the overlapping of communication and computation. These two inherent advantages work together to reduce overall execution time significantly.||Funding Details:||Science Foundation Ireland||Type of material:||Conference Publication||Publisher:||IEEE||Copyright (published version):||2007 IEEE||Keywords:||Data partitioning strategy; Interconnected clusters; Linear array network topology; Parallel computing||DOI:||10.1109/ISPDC.2007.56||Other versions:||http://hcl.ucd.ie/system/files/Papers/1183978301367.pdf||Language:||en||Status of Item:||Peer reviewed||Conference Details:||6th International Symposium on Parallel and Distributed Computing, 2007 (ISPDC 2007), Hagenberg, Austria, 5 - 8 July 2007|
|Appears in Collections:||Computer Science Research Collection|
Show full item record
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.