Time-optimal gossip in noncombining 2-D tori with constant buffers

摘要

This paper describes a time,transmission,and memory - optimal algorithm for gossiping in general 2-D tori in the noncombining full-duplex and all-port communcaitons model.