Atomix is an event-driven framework for coordinating fault-tolerant distributed systems built on the Raft consensus algorithm. It provides the building blocks that solve many common distributed systems problems including group membership, leader election, distributed concurrency control, partitioning, and replication.
raft consensus consensus-algorithm raft-protocol raft-consensus-algorithm distributed-systems leader-election distributed-lock data-structuresFinn is a fast and simple framework for building Raft implementations in Go. It uses Redcon for the network transport and Hashicorp Raft. There is also the option to use LevelDB, BoltDB or FastLog for log persistence.The reason for this project is to add Raft support to a future release of BuntDB and Tile38.
raft redis raft-consensus leader-election fault-tolerantFully asynchronous C implementation of the Raft consensus protocol. The library has modular design: its core part implements only the core Raft algorithm logic, in a fully platform independent way. On top of that, a pluggable interface defines the I/O implementation for networking (send/receive RPC messages) and disk persistence (store log entries and snapshots).
raft consensus-algorithm algorithm leader-election distributed distributed-systemsreplication-manager is an high availability solution to manage MariaDB 10.x and MySQL & Percona Server 5.7 GTID replication topologies. It includes third-party libraries released under their own licences. Please refer to the vendor directory for more information.
failover slave leader-election mariadb mysql replication gtidevel is a distributed leader election library which has eventual consistency. If the nodes which have started evel application eventually agree with the same member list (usually distributed erlang ensures it), each election will elect a single leader who is recognized by all of them.
leader-election eventually-consistentThere are several options for running periodic tasks with Sidekiq, including sidekiq-scheduler, sidekiq-cron, as well as Sidekiq Pro. Each tackles the problem slightly differently. Sidecloq is inspired by various facets of these projects, as well as resque-scheduler. I urge you to take a look at all of these options to see what works best for you. Tested on MRI > 2, JRuby and Rubinius. Basically, if you can run Sidekiq, you can run Sidecloq. Note that Sidekiq >= 5 does not support MRI ruby < 2.2.2.
sidekiq schedule rails leader-election periodic recurring cronDinghy implements leader election using part of the raft protocol. It might be useful if you have several workers but only want one of them at a time doing things.
leader-election raftThis repository contains source code of an implementation of the bully algorithm written in Go and a small browser visualization tool. This has been made for learning purposes about distributed algorithms, Bully algorithm being the simplest leader election algorithm to implement.
leader-election bully-algorithm networking consensus-algorithm visualization algorithm-visualisation distributed-algorithmsA BroadcastChannel allows simple communication between browsing contexts with the same origin or different NodeJs processes. This implementation works with old browsers, new browsers, WebWorkers and NodeJs. You can use it to send messages between multiple browser-tabs, iframes, WebWorkers and NodeJs-processes.
crosstab broadcast-channel broadcast polyfill indexeddb localstorage ipc postmessage communication-channel leader-election broadcastchannelThis package also provides a few "managed" types, complete with a Notification system.
leader consul-api leader-election consultant helpful-wrappersImplementation of the NELI leader election protocol for Go and Kafka. goNELI encapsulates the 'fast' variation of the protocol, running in exclusive mode over a group of contending processes. Leader election is a straightforward concept, long-standing in the academic papers on distributed computing. For a set of competing processes, select one process that is a notional leader, ensuring that at-most one process may bear the leader status at any point in time, and that this status is unanimously agreed upon among the remaining processes. Conceptually, leader election is depicted below.
distributed-systems microservices apache-kafka leader-election
We have large collection of open source products. Follow the tags from
Tag Cloud >>
Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
Add Projects.