Distributed mutual exclusion algorithms for intersection traffic control
Traffic control at intersections is a key issue and hot research topic in intelligent
transportation systems. Existing approaches, including traffic light scheduling and trajectory …
transportation systems. Existing approaches, including traffic light scheduling and trajectory …
Noise removal in MR images using non linear filters
P Punhani, NK Garg - 2015 6th International Conference on …, 2015 - ieeexplore.ieee.org
Magnetic Resonance Imaging is most popularly used techniques in clinical diagnosis.
During acquisition, image quality is degraded by certain noise and artifacts. Due to which, it …
During acquisition, image quality is degraded by certain noise and artifacts. Due to which, it …
Tolerance to unbounded byzantine faults
M Nesterenko, A Arora - 21st IEEE Symposium on Reliable …, 2002 - ieeexplore.ieee.org
An ideal approach to deal with faults in large-scale distributed systems is to contain the
effects of faults as locally as possible and, additionally, to ensure some type of tolerance …
effects of faults as locally as possible and, additionally, to ensure some type of tolerance …
Efficient and robust local mutual exclusion in mobile ad hoc networks
In a mobile ad hoc network, nodes that are geographically close may need to compete for
exclusive access to a shared resource. This paper proposes an abstraction of this problem …
exclusive access to a shared resource. This paper proposes an abstraction of this problem …
Dining philosophers that tolerate malicious crashes
M Nesterenko, A Arora - Proceedings 22nd International …, 2002 - ieeexplore.ieee.org
We present a solution to the problem of dining philosophers. Our solution tolerates malicious
crashes. In a malicious crash the failed process behaves arbitrarily for a finite time and then …
crashes. In a malicious crash the failed process behaves arbitrarily for a finite time and then …
[PDF][PDF] A generalized mutual exclusion problem and its algorithm
Mutual exclusion (ME) is a fundamental problem for resource allocation in distributed
systems, It is concerned with how the various processes access shared resources in a …
systems, It is concerned with how the various processes access shared resources in a …
Dining philosophers with crash locality 1
SM Pike, PAG Sivilotti - 24th International Conference on …, 2004 - ieeexplore.ieee.org
Ideally, distributed algorithms isolate the side-effects of faults within local neighborhoods of
impact. Failure locality quantifies this concept as the maximum radius of impact caused by a …
impact. Failure locality quantifies this concept as the maximum radius of impact caused by a …
Self-stabilizing philosophers with generic conflicts
P Danturi, M Nesterenko, S Tixeuil - Symposium on Self-Stabilizing …, 2006 - Springer
We generalize the classic dining philosophers problem to separate the conflict and
communication neighbors of each process. Communication neighbors may directly …
communication neighbors of each process. Communication neighbors may directly …
Evaluating and optimizing stabilizing dining philosophers
J Adamek, M Nesterenko… - 2015 11th European …, 2015 - ieeexplore.ieee.org
We study theoretical and practical aspects of five of the most well-known self-stabilizing
dining philosophers algorithms. We theoretically prove that three of them are incorrect. For …
dining philosophers algorithms. We theoretically prove that three of them are incorrect. For …
Self-stabilizing philosophers with generic conflicts
P Danturi, M Nesterenko, S Tixeuil - ACM Transactions on Autonomous …, 2009 - dl.acm.org
We generalize the classic dining philosophers problem to separate the conflict and
communication neighbors of each process. Communication neighbors may directly …
communication neighbors of each process. Communication neighbors may directly …