| | |
Summary: An Optimal Termination Detection Algorithm for
Rings
Murat Demirbas Anish Arora 1
Department of Computer and Information Science
The Ohio State University
Columbus, Ohio 43210 USA
Abstract
This paper presents an optimal termination detection algorithm for rings. The
algorithm is based on Safra's and Dijkstra et al.'s [1] algorithm. It optimizes the
time constant of the Dijkstra & Safra algorithm from 2N 3N to 0 N , where N
denotes the number of processes in the ring. A proof of correctness of the algorithm
is also presented.
Keywords : Termination detection, Distributed computing, Algorithms.
1
Email: fdemirbas, anishg@cis.ohio-state.edu; Tel: +1-614-292-1836 ; Fax: +1-614-292-2911 ;
Web: http://www.cis.ohio-state.edu/f~ demirbas,~anishg;
Arora is currently on sabbatical leave at Microsoft Research. This work was partially sponsored by
NSA Grant MDA904-96-1-0111, NSF Grant NSF-CCR-9972368, an Ameritech Faculty Fellowship,
and a grant from Microsoft Research.
|
