This is akin to memcached, but better (of course)


  • data is idempotent/nonmutable – keys always have one specific value for all time
  • has cache-filling mechanism so peers cooperate so only one does a load of missing data
  • mirroring of popular data to multiple caches
  • client library as well as standalone server

Only in Go unless someone ports it.


Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>