Title of article :
Gossiping and broadcasting versus computing functions in networks Original Research Article
Author/Authors :
Martin Dietzfelbinger، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2004
Pages :
27
From page :
127
To page :
153
Abstract :
In the theory of dissemination of information in interconnection networks (gossiping and broadcasting) one assumes that a message consists of a set of distinguishable, atomic pieces of information, and that one communication pattern is used for solving a task. In this paper, a close connection is established between this theory and a situation in which functions are computed in synchronous networks without restrictions on the type of message used and with possibly different communication patterns for different inputs. The following restriction on the way processors communicate turns out to be essential:
Keywords :
Communication in networks , Dissemination of information , Synchronisation , Parallel random access machines , Lower bounds
Journal title :
Discrete Applied Mathematics
Serial Year :
2004
Journal title :
Discrete Applied Mathematics
Record number :
885814
Link To Document :
بازگشت