| Summary: | 博士 === 國立交通大學 === 資訊工程研究所 === 82 === An appropiate approach--neighborhood approach--is proposed
forng an approximate agreement in massively prallel systems.
Instead-to-all broadcasting that conventional approaches
adopt, pproach requires only direct neighbor communication
and e routing and redirection. Besides, the approach
inherents ties such as isotropic and autonomy, which are
very desirabledistributed systems.ealize neighborhood approach,
we present a simple but effective m to achieve an
approximate agreement on hypercube and wraparoundystems. A set
of recurrence relations are derived for each ing to the
behavior of neighboring average algorithm. Convergenceor each
topology is then deducted through solving the recurrenceons.
The evaluated convergence rate, expressed as a function ofure
parameters, shows how it is affected by topology of the ch
neighboring average algorithm is applied.neighboring average
algorithm is then employed to synchronizeand its performance is
compared to three representitive globalthms. The performance
comparison shows that, besides the advant-n communication and
implementation, neighboring average algori-es outperform any
global algorithm in some communication
|
|---|
