非表示:
キーワード:
-
要旨:
Near-optimal gossiping algorithms are given for two- and higher
dimensional tori assuming the full-port store-and-forward
communication model. For two-dimensional tori, a previous algorithm
achieved optimality in an intricate way, with an adaptive routing
pattern. In contrast, the PUs in our algorithm forward the received
packets always in the same way. We thus achieve almost the same
performance with patterns that might be hardwired.
