-
Notifications
You must be signed in to change notification settings - Fork 434
Leader Election
Randgalt edited this page Aug 11, 2011
·
8 revisions
== Description ==
In distributed computing, leader election is the process of designating a single process as the organizer of some task distributed among several computers (nodes). Before the task is begun, all network nodes are unaware which node will serve as the "leader," or coordinator, of the task. After a leader election algorithm has been run, however, each node throughout the network recognizes a particular, unique node as the task leader.
== Participating Classes ==
- LeaderSelector
- LeaderSelectorListener
=== Creating a LeaderSelector ===
public LeaderSelector(CuratorFramework client, String mutexPath, LeaderSelectorListener listener) Parameters: client - the client mutexPath - the path for this leadership group listener - listener
public LeaderSelector(CuratorFramework client, String mutexPath, ThreadFactory threadFactory, Executor executor, LeaderSelectorListener listener) Parameters: client - the client mutexPath - the path for this leadership group threadFactory - factory to use for making internal threads executor - the executor to run in listener - listener
- Curator
- Javadoc
- Coverage Report
- Getting Started
- Examples
- FAQ
- Client
- Framework
-
Recipes
- Leader Latch
- Leader Election
- Shared Reentrant Lock
- Shared Lock
- Shared Reentrant Read Write Lock
- Shared Semaphore
- Multi Shared Lock
- Distributed Queue
- Distributed Id Queue
- Distributed Priority Queue
- Distributed Delay Queue
- Simple Distributed Queue
- Barrier
- Double Barrier
- Shared counter
- Distributed Atomic Long
- Path Cache
- Node Cache
- Utilities – Test Server, Test Cluster, ZKPaths, EnsurePath, QueueSharder, Reaper, ChildReaper
- Tech Notes
- Errors
- Exhibitor Integration
- Extensions
- Logging and Tracing