memberlist VS groupcache

I use lightweight https://github.com/hashicorp/memberlist to build initial cluster skeleton (find out what are nodes constituting it)

Does https://github.com/hashicorp/memberlist count? It’s a gossip-based eventual consistency protocol based on SWIM.

An equivalent of golang's memberlist would be awesome.

I don't know the engineer that did it but I know what happened. There's a library that a bunch of foundational Amazon services use called DFDD. It uses a gossip protocol to handle service discovery and health checking. The open source equivalent is Hashicorp memberlist. To remove a node from the cluster, you have to send a command to an arbitrary node that says a node is dead.

serf uses memberlist which uses the SWIM failure detection protocol (https://www.cs.cornell.edu/projects/Quicksilver/public_pdfs/SWIM.pdf) with the Lifeguard extensions (https://arxiv.org/pdf/1707.00788.pdf).

https://github.com/hashicorp/memberlist

Fairly idiomatic/clean

This algorithm assumes you're doing that separately using some sort of membership protocol (e.g. SWIM), and you pass in the membership list that you are keeping up to date with that protocol. If you're curious about those, HashiCorp memberlist and HashiCorp Serf are really good to look at. I believe Consul uses those libraries under the hood.

As shown in the title, DREAMEMO is a distributed cache with out-of-the-box, high-scalability, modular-design features.The groupcache implementation is referenced, and re-structured, specific module differentiation is as follows:

I remember one of the first real-world uses of Go being the groupcache package: https://github.com/golang/groupcache (to serve Chrome downloads, IIRC?)

> comes with a cache filling mechanism. Whereas memcached just says "Sorry, cache miss", often resulting in a thundering herd of database (or whatever) loads from an unbounded number of clients (which has resulted in several fun outages), groupcache coordinates cache fills such that only one load in one process of an entire replicated set of processes populates the cache, then multiplexes the loaded value to all callers.

I read that group cache (https://github.com/golang/groupcache) can be used to sync servers around a key.

I've not tried this myself, but I've seen it suggested to use groupcache (https://github.com/golang/groupcache) to sync your servers.

https://github.com/golang/groupcache is managing distributed caching that addresses thundering herd problem of memcache.

How it goes sometimes. Check out https://github.com/golang/groupcache and of course the AWS golang SDK.

There is also groupcache, written by the same author as memcached, but better.