An Optimal Termination Detection Algorithm for Rings
نویسندگان
چکیده
Rings Murat Demirbas Anish Arora 1 Department of Computer and Information S ien e The Ohio State University Columbus, Ohio 43210 USA Abstra t This paper presents an optimal termination dete tion algorithm for rings. The algorithm is based on Safra's and Dijkstra et al.'s [1℄ algorithm. It optimizes the time onstant of the Dijkstra & Safra algorithm from 2N 3N to 0 N , where N denotes the number of pro esses in the ring. A proof of orre tness of the algorithm is also presented.
منابع مشابه
Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings
Probabilistic algorithms are developed for a basic problem in distributed computation, assuming anonymous, asynchronous, unidirectional rings of processors. The problem, known as Solitude Detection, requires that a nonempty subset of the processors, called contenders, determine whether or not there is exactly one contender. Monte Carlo algorithms are developed, that err with probability bounded...
متن کاملTermination Detection of Local Computations
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the problem of the detection of the termination of local computations. We define four types of termination detection: no detection, detection of the local termination, detection by a distributed observer, detection of the globa...
متن کاملMessage-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies
Detecting termination of a distributed computation is a fundamental problem in distributed systems. We present two optimal algorithms for detecting termination of a non-diffusing distributed computation for an arbitrary topology. Both algorithms are optimal in terms of message complexity and detection latency. The first termination detection algorithm has to be initiated along with the underlyi...
متن کاملOPTIMAL DESIGN OF DOUBLE LAYER GRIDS CONSIDERING NONLINEAR BEHAVIOUR BY SEQUENTIAL GREY WOLF ALGORITHM
The present paper tackles the optimization problem of double layer grids considering nonlinear behaviour. In this paper, an efficient optimization algorithm is proposed to achieve the optimization task based on the newly developed grey wolf algorithm (GWA) termed as sequential GWA (SGWA). In the framework of SGWA, a sequence of optimization processe...
متن کاملOptimal Detection of Oil Contamination at Sea by the FPSO Algorithm
Leakage of oil from pipelines and oil tankers into seas and oceans is ecologically important and can have significant social and economic impacts on the environment. An early detection of deliberate or accidental oil spills can reduce serious hazards that may threaten coastal residents and help identify pollutants. Iran has been surrounded by seas from the north and the south and they provide u...
متن کامل