All-to-All Scatter in de Bruijn and Kautz Networks
Petr Salinger ; Pavel Tvrdík
Computing and Informatics, Tome 28 (2012) no. 1, / Harvested from Computing and Informatics
Text on Computing and Informatics
In this paper, we describe algorithms for all-to-all scatter in all-port de Bruijn and Kautz networks. The algorithms are memory-optimal and asymptotically time- and transmission-optimal. We give algorithms for the noncombining model and their modifications for the limited combining model. The algorithms achieve asymptotic optimality on both store-and-forward and wormhole switched networks.
Publié le : 2012-01-26
Classification:  
@article{cai526,
     author = {Petr Salinger and Pavel Tvrd\'\i k},
     title = {All-to-All Scatter in de Bruijn and Kautz Networks},
     journal = {Computing and Informatics},
     volume = {28},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai526}
}

Petr Salinger; Pavel Tvrdík. All-to-All Scatter in de Bruijn and Kautz Networks. Computing and Informatics, Tome 28 (2012) no. 1, . http://gdmltest.u-ga.fr/item/cai526/