A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit <a rel="external noopener" href="http://www.chu.edu.tw:80/~cwyu/PaperPublished/ACSAC2005LNCS3740.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Irregular Redistribution Scheduling by Partitioning Messages
[chapter]
<span title="">2005</span>
<i title="Springer Berlin Heidelberg">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a>
</i>
Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Previous results focus on reducing index computational cost, schedule computational cost, and message packing/unpacking cost. In irregular redistribution, however, messages with varying sizes are transmitted in the same communication step. Therefore, the largest sized messages in the same communication step dominate the data
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11572961_24">doi:10.1007/11572961_24</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2lpuebmb2vd7zgkcpns2sstaje">fatcat:2lpuebmb2vd7zgkcpns2sstaje</a>
</span>
more »
... r time required for this communication step. This work presents an efficient algorithm to partition large messages into multiple small ones and schedules them by using the minimum number of steps without communication contention and, in doing so, reducing the overall redistribution time. When the number of processors or the maximum degree of the redistribution graph increases or the selected size of messages is medium, the proposed algorithm can significantly reduce the overall redistribution time to 52%.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160518210805/http://www.chu.edu.tw:80/~cwyu/PaperPublished/ACSAC2005LNCS3740.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/9c/37/9c374858ecd876bdf387639852daa7ba8716c7b5.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11572961_24">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
springer.com
</button>
</a>