GitHub Hot Board

GitHub Hot Board · 저장소 아카이브

golang/groupcache

groupcache is a caching and cache-filling library, intended as a replacement for memcached in many cases. (소개는 저장소 자체 문서에서 왔습니다.)

데이터 기준 October 25golang

최고 순위

#331

종합 · Go 언어별

13K

누적 스타

1.4K

포크 수

0

최근 30일 기록 일수

프로젝트 상태라이선스: Apache-2.0최근 push: November 29열린 이슈(PR 포함): 46

2026-10-25부터 수집. 미확인 = 아직 미수집

README에 뱃지를 붙여보세요 · golang/groupcache[![README에 뱃지를 붙여보세요](https://git.vaiox.xyz/api/badge/golang/groupcache.svg)](https://git.vaiox.xyz/ko/repo/golang/groupcache)
<a href="https://git.vaiox.xyz/ko/repo/golang/groupcache"><img src="https://git.vaiox.xyz/api/badge/golang/groupcache.svg" alt="README에 뱃지를 붙여보세요" height="20"></a>

프로젝트 문서

groupcache

Summary

groupcache is a distributed caching and cache-filling library, intended as a replacement for a pool of memcached nodes in many cases.

For API docs and examples, see http://godoc.org/github.com/golang/groupcache

Comparison to memcached

Like memcached, groupcache:

  • shards by key to select which peer is responsible for that key

Unlike memcached, groupcache:

  • does not require running a separate set of servers, thus massively reducing deployment/configuration pain. groupcache is a client library as well as a server. It connects to its own peers, forming a distributed cache.

  • 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.

  • does not support versioned values. If key "foo" is value "bar", key "foo" must always be "bar". There are neither cache expiration times, nor explicit cache evictions. Thus there is also no CAS, nor Increment/Decrement. This also means that groupcache....

  • ... supports automatic mirroring of super-hot items to multiple processes. This prevents memcached hot spotting where a machine's CPU and/or NIC are overloaded by very popular keys/values.

  • is currently only available for Go. It's very unlikely that I (bradfitz@) will port the code to any other language.

Loading process

In a nutshell, a groupcache lookup of Get("foo") looks like:

(On machine #5 of a set of N machines running the same code)

  1. Is the value of "foo" in local memory because it's super hot? If so, use it.

  2. Is the value of "foo" in local memory because peer #5 (the current peer) is the owner of it? If so, use it.

  3. Amongst all the peers in my set of N, am I the owner of the key "foo"? (e.g. does it consistent hash to 5?) If so, load it. If other callers come in, via the same process or via RPC requests from peers, they block waiting for the load to finish and get the same answer. If not, RPC to the peer that's the owner and get the answer. If the RPC fails, just load it locally (still with local dup suppression).

Users

groupcache is in production use by dl.google.com (its original user), parts of Blogger, parts of Google Code, parts of Google Fiber, parts of Google production monitoring systems, etc.

Presentations

See http://talks.golang.org/2013/oscon-dl.slide

Help

Use the golang-nuts mailing list for any discussion or questions.

현재 순위

  • 331

    종합 랭킹 · 역대 최강 · Go

    13K 스타 · 1.4K fork · 총 스타 수

    종합 · Go →

최근 30일 추이

최근 30일간 기록이 없습니다.

← 랭킹으로