On an improved algorithm for decentralized extrema finding in circular configurations of processors
暂无分享,去创建一个
This note presents a more efficient algorithm for finding the largest element in a circular list of processors when messages can be passed in either direction. It passes 2<italic>N</italic>*floor(lg <italic>N</italic>) + 3<italic>N</italic> messages in the worst case, compared to Chang and Roberts' <italic>N</italic>(<italic>N</italic> + 1)/2 and Hirschberg and Sinclair's 8<italic>N</italic> + 8*ceiling(<italic>N</italic> lg <italic>N</italic>) messages. The technique is a selective elimination of possible processes, which then merely relay future messages between the remaining contenders.
[1] Ernest J. H. Chang,et al. An improved algorithm for decentralized extrema-finding in circular configurations of processes , 1979, CACM.
[2] Daniel S. Hirschberg,et al. Decentralized extrema-finding in circular configurations of processors , 1980, CACM.