This paper first surveys election algorithms on synchronous ring networks and then presents two algorithms for distributed election on synchronous networks in which processors have distinct identifiers taken from the ...
详细信息
This paper first surveys election algorithms on synchronous ring networks and then presents two algorithms for distributed election on synchronous networks in which processors have distinct identifiers taken from the countable set of natural numbers. Using an algorithm, which generalizes previous results for synchronous ring election and which exploits identifiers and clocks, a new O(e) worst case message complexity upper bound is demonstrated for networks of unknown topology. Unfortunately, the algorithm may suffer an exorbitant time complexity. In consequence, a more time-efficient second algorithm that incurs O(e log*n) message complexity is presented, where log*k is the number of times the log function must be applied to k to obtain a result less than or equal to 1. Synchronous distributed election on networks where processors do not have identifiers, i.e. the symmetry breaking problem, is also considered. A random algorithm for the general network which expects O(e) bit and time complexity, assuming global knowledge of the number of processors and network links, is given, again generalizing past results for rings.
The emergent behaviour of autonomic systems, together with the scale of their deployment, impedes prediction of the full range of configuration and failure scenarios;thus it is not possible to devise management and re...
详细信息
ISBN:
(纸本)0769521959
The emergent behaviour of autonomic systems, together with the scale of their deployment, impedes prediction of the full range of configuration and failure scenarios;thus it is not possible to devise management and recovery strategies to cover all possible outcomes. One solution to this problem is to embed self-managing and self-healing abilities into such applications. Traditional design approaches favour determinism, even when unnecessary. This can lead to conflicts between the non-functional requirements. Natural systems such as ant colonies have evolved cooperative, finely tuned emergent behaviours which allow the colonies to function at very large scale and to be very robust, although non-deterministic. Simple pheromone-exchange communication systems are highly efficient and are a major contribution to their success. This paper proposes that we look to natural systems for inspiration when designing architecture and communications strategies, and presents an election algorithm which encapsulates non-deterministic behaviour to achieve high scalability, robustness and stability.
This study examines the estimation of parameters for the Shifted Weibull Distribution (SWD) using several robust metaheuristic algorithms, with a focus on enhancing precision and reliability in investment data analysi...
详细信息
暂无评论