A golang LRU Cache for high concurrency
Find a file
Karl Seguin 6720535fab Checking if an item should be promoted because it's new is the uncommon
case which we can optimize out by being more explicit when we create
a new item
2013-11-13 13:46:41 +08:00
bucket.go Checking if an item should be promoted because it's new is the uncommon 2013-11-13 13:46:41 +08:00
bucket_test.go Checking if an item should be promoted because it's new is the uncommon 2013-11-13 13:46:41 +08:00
cache.go Checking if an item should be promoted because it's new is the uncommon 2013-11-13 13:46:41 +08:00
configuration.go Remove Value interface, cache now works against interface{} with the 2013-10-30 20:18:51 +08:00
item.go Checking if an item should be promoted because it's new is the uncommon 2013-11-13 13:46:41 +08:00
item_test.go Checking if an item should be promoted because it's new is the uncommon 2013-11-13 13:46:41 +08:00
readme.md Remove Value interface, cache now works against interface{} with the 2013-10-30 20:18:51 +08:00

CCache

CCache is an LRU Cache, written in Go, focused on supporting high concurrency.

Lock contention on the list is reduced by:

  • Introducing a window which limits the frequency that an item can get promoted
  • Using a buffered channel to queue promotions for a single worker
  • Garbage collecting within the same thread as the worker