Abstract
A concept of systolic dissemination of information in interconnection networks is introduced, and the complexity of systolic gossip in one-way (telegraph) and two-way (telephone) communication mode is investigated. Optimal systolic algorithms in both communication modes are constructed for paths and complete k-ary trees for any k≥2.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
