Go Performance Guide
Concurrency Patterns

Caching Patterns

Implement efficient caching in Go with LRU eviction, singleflight deduplication, GC-friendly designs, and proper cache invalidation strategies.

Introduction: Why Caching Matters

Caching is one of the most impactful optimization techniques in distributed systems. By avoiding repeated computation, network calls, and database queries, you can dramatically improve application performance and reduce load on downstream services.

In Go applications, proper caching strategy can mean the difference between handling thousands of requests per second and struggling with saturation. This guide covers battle-tested patterns for building efficient caches in Go, from simple in-memory maps to sophisticated eviction strategies.

In-Memory Caching Basics

Simple Map with sync.RWMutex

The foundation of in-memory caching in Go is the humble map protected by a sync.RWMutex. This pattern is straightforward and effective for many use cases:

package cache

import (
	"sync"
	"time"
)

type SimpleCache struct {
	mu    sync.RWMutex
	items map[string]interface{}
}

func NewSimpleCache() *SimpleCache {
	return &SimpleCache{
		items: make(map[string]interface{}),
	}
}

func (sc *SimpleCache) Set(key string, value interface{}) {
	sc.mu.Lock()
	defer sc.mu.Unlock()
	sc.items[key] = value
}

func (sc *SimpleCache) Get(key string) (interface{}, bool) {
	sc.mu.RLock()
	defer sc.mu.RUnlock()
	val, ok := sc.items[key]
	return val, ok
}

func (sc *SimpleCache) Delete(key string) {
	sc.mu.Lock()
	defer sc.mu.Unlock()
	delete(sc.items, key)
}

func (sc *SimpleCache) Clear() {
	sc.mu.Lock()
	defer sc.mu.Unlock()
	sc.items = make(map[string]interface{})
}

This pattern is read-friendly due to RWMutex allowing concurrent readers, but becomes a bottleneck under heavy write contention.

Tip: Use RWMutex when your workload is read-heavy (typically 80%+ reads). For write-heavy workloads, consider sharding or alternative data structures.

Cache Eviction Strategies

LRU (Least Recently Used) Eviction

LRU is one of the most practical eviction strategies—evicting the item that hasn't been accessed for the longest time:

package cache

import (
	"container/list"
	"sync"
)

type LRUCache struct {
	mu       sync.Mutex
	capacity int
	cache    map[string]*list.Element
	order    *list.List
}

type entry struct {
	key   string
	value interface{}
}

func NewLRUCache(capacity int) *LRUCache {
	return &LRUCache{
		capacity: capacity,
		cache:    make(map[string]*list.Element),
		order:    list.New(),
	}
}

func (lru *LRUCache) Get(key string) (interface{}, bool) {
	lru.mu.Lock()
	defer lru.mu.Unlock()

	elem, ok := lru.cache[key]
	if !ok {
		return nil, false
	}

	// Move to front (most recently used)
	lru.order.MoveToFront(elem)
	return elem.Value.(*entry).value, true
}

func (lru *LRUCache) Set(key string, value interface{}) {
	lru.mu.Lock()
	defer lru.mu.Unlock()

	if elem, ok := lru.cache[key]; ok {
		elem.Value.(*entry).value = value
		lru.order.MoveToFront(elem)
		return
	}

	// Add new entry
	elem := lru.order.PushFront(&entry{key: key, value: value})
	lru.cache[key] = elem

	// Evict if over capacity
	if lru.order.Len() > lru.capacity {
		back := lru.order.Back()
		lru.order.Remove(back)
		delete(lru.cache, back.Value.(*entry).key)
	}
}

LFU (Least Frequently Used) Eviction

LFU tracks access frequency and evicts the least-accessed items. This is more complex but can be more effective when access patterns follow a power law:

package cache

import "sync"

type LFUCache struct {
	mu        sync.Mutex
	capacity  int
	cache     map[string]interface{}
	frequency map[string]int
	minFreq   int
	freqList  map[int][]string // frequency -> list of keys
}

func NewLFUCache(capacity int) *LFUCache {
	return &LFUCache{
		capacity:  capacity,
		cache:     make(map[string]interface{}),
		frequency: make(map[string]int),
		freqList:  make(map[int][]string),
		minFreq:   0,
	}
}

func (lfu *LFUCache) Get(key string) (interface{}, bool) {
	lfu.mu.Lock()
	defer lfu.mu.Unlock()

	val, ok := lfu.cache[key]
	if !ok {
		return nil, false
	}

	// Increment frequency
	lfu.frequency[key]++
	newFreq := lfu.frequency[key]

	// Remove from old frequency list
	oldFreq := newFreq - 1
	lfu.removeFromFreqList(oldFreq, key)

	// Add to new frequency list
	lfu.freqList[newFreq] = append(lfu.freqList[newFreq], key)

	return val, true
}

func (lfu *LFUCache) Set(key string, value interface{}) {
	lfu.mu.Lock()
	defer lfu.mu.Unlock()

	if lfu.capacity <= 0 {
		return
	}

	if _, ok := lfu.cache[key]; ok {
		lfu.cache[key] = value
		lfu.Get(key) // Update frequency
		return
	}

	if len(lfu.cache) >= lfu.capacity {
		// Evict least frequently used
		if keys, ok := lfu.freqList[lfu.minFreq]; ok && len(keys) > 0 {
			evictKey := keys[0]
			delete(lfu.cache, evictKey)
			delete(lfu.frequency, evictKey)
			lfu.removeFromFreqList(lfu.minFreq, evictKey)
		}
	}

	lfu.cache[key] = value
	lfu.frequency[key] = 1
	lfu.minFreq = 1
	lfu.freqList[1] = append(lfu.freqList[1], key)
}

func (lfu *LFUCache) removeFromFreqList(freq int, key string) {
	if list, ok := lfu.freqList[freq]; ok {
		for i, k := range list {
			if k == key {
				lfu.freqList[freq] = append(list[:i], list[i+1:]...)
				break
			}
		}
		if len(lfu.freqList[freq]) == 0 {
			delete(lfu.freqList, freq)
		}
	}
}

TTL-Based Eviction

Time-based expiration is essential for keeping cached data fresh:

package cache

import (
	"sync"
	"time"
)

type TTLEntry struct {
	Value      interface{}
	ExpiresAt  time.Time
}

type TTLCache struct {
	mu    sync.RWMutex
	items map[string]*TTLEntry
}

func NewTTLCache() *TTLCache {
	return &TTLCache{
		items: make(map[string]*TTLEntry),
	}
}

func (tc *TTLCache) Set(key string, value interface{}, ttl time.Duration) {
	tc.mu.Lock()
	defer tc.mu.Unlock()
	tc.items[key] = &TTLEntry{
		Value:     value,
		ExpiresAt: time.Now().Add(ttl),
	}
}

func (tc *TTLCache) Get(key string) (interface{}, bool) {
	tc.mu.RLock()
	defer tc.mu.RUnlock()

	entry, ok := tc.items[key]
	if !ok {
		return nil, false
	}

	if time.Now().After(entry.ExpiresAt) {
		tc.mu.RUnlock()
		tc.mu.Lock()
		delete(tc.items, key)
		tc.mu.Unlock()
		tc.mu.RLock()
		return nil, false
	}

	return entry.Value, true
}

// Cleanup routine to remove expired entries
func (tc *TTLCache) Cleanup() {
	tc.mu.Lock()
	defer tc.mu.Unlock()

	now := time.Now()
	for key, entry := range tc.items {
		if now.After(entry.ExpiresAt) {
			delete(tc.items, key)
		}
	}
}

sync.Map as a Cache

Go's sync.Map is optimized for specific patterns:

package cache

import "sync"

type SyncMapCache struct {
	m sync.Map
}

func NewSyncMapCache() *SyncMapCache {
	return &SyncMapCache{}
}

func (smc *SyncMapCache) Set(key string, value interface{}) {
	smc.m.Store(key, value)
}

func (smc *SyncMapCache) Get(key string) (interface{}, bool) {
	return smc.m.Load(key)
}

func (smc *SyncMapCache) Delete(key string) {
	smc.m.Delete(key)
}

When to use sync.Map: Read-heavy workloads with stable keys. The implementation optimizes for the case where entries are repeatedly written for few keys but read many times.

When to avoid: Frequent writes to different keys, or when you need eviction—sync.Map has no capacity management.

groupcache: Distributed Caching

groupcache (used by Google internally) provides distributed caching with consistent hashing:

package main

import (
	"fmt"
	"log"

	"github.com/golang/groupcache"
)

var podCache = groupcache.NewGroup("pods", 64<<20, groupcache.GetterFunc(
	func(ctx context.Context, key string, dest groupcache.Sink) error {
		// Fetch from database or remote service
		data := fetchPodData(key)
		dest.SetBytes(data)
		return nil
	},
))

func fetchPodData(key string) []byte {
	// Simulate expensive operation
	return []byte(fmt.Sprintf("pod_data_%s", key))
}

func main() {
	var data []byte
	if err := podCache.Get(context.Background(), "pod-1", groupcache.AllocatingByteSliceSink(&data)); err != nil {
		log.Fatal(err)
	}
	fmt.Println(string(data))
}

ristretto: High-Performance Caching

Ristretto (by Dgraph) uses a TinyLFU eviction policy for excellent cache efficiency:

package main

import (
	"fmt"
	"log"

	"github.com/dgraph-io/ristretto"
)

func main() {
	cache, err := ristretto.NewCache(&ristretto.Config{
		NumCounters: 1e7,     // expected number of items
		MaxCost:     1 << 30, // 1GB
		BufferItems: 64,
	})
	if err != nil {
		log.Fatal(err)
	}
	defer cache.Close()

	cache.Set("user:1", "[email protected]", 1)

	val, ok := cache.Get("user:1")
	if ok {
		fmt.Println(val.(string))
	}
}

bigcache: Off-Heap Caching

BigCache stores data off the heap to reduce GC pressure:

package main

import (
	"fmt"
	"log"
	"time"

	"github.com/allegro/bigcache/v3"
)

func main() {
	cache, err := bigcache.New(context.Background(), bigcache.DefaultConfig(24*time.Hour))
	if err != nil {
		log.Fatal(err)
	}
	defer cache.Close()

	cache.Set("user:1", []byte("[email protected]"))

	entry, err := cache.Get("user:1")
	if err == nil {
		fmt.Println(string(entry))
	}
}

freecache: Zero-GC Cache

Freecache achieves zero GC by using byte slices directly:

package main

import (
	"fmt"
	"log"

	"github.com/coocood/freecache"
)

func main() {
	cache := freecache.NewCache(100 * 1024 * 1024) // 100MB
	defer cache.Close()

	cache.Set([]byte("user:1"), []byte("[email protected]"), 0)

	val, err := cache.Get([]byte("user:1"))
	if err == nil {
		fmt.Println(string(val))
	}
}

GC-Friendly Cache Design

The GC Problem with map[string][]byte

Maps allocate on the heap, causing GC overhead:

// BAD: Creates GC pressure
type BadCache struct {
	mu    sync.RWMutex
	items map[string][]byte // Each value is separately allocated
}

// Every GC cycle must scan all entries

BigCache's Approach

BigCache uses a ring buffer with mmap or large byte slices:

package main

import (
	"fmt"
	"log"
	"time"

	"github.com/allegro/bigcache/v3"
)

func demonstrateBigCache() {
	// BigCache allocates large contiguous byte slices
	// and manages allocation itself, reducing GC
	config := bigcache.Config{
		Shards:             256,
		LifeWindow:         24 * time.Hour,
		MaxEntriesInWindow: 100000,
		MaxEntrySize:       512,
		Verbose:            false,
	}

	cache, _ := bigcache.New(context.Background(), config)
	defer cache.Close()

	// Values are stored in pre-allocated byte slices
	cache.Set("key", []byte("value"))
}

Singleflight: Preventing Cache Stampede

golang.org/x/sync/singleflight deduplicates identical concurrent requests:

package main

import (
	"fmt"
	"sync"
	"time"

	"golang.org/x/sync/singleflight"
)

type Fetcher struct {
	cache map[string]interface{}
	mu    sync.RWMutex
	sg    singleflight.Group
}

func (f *Fetcher) Fetch(key string) (interface{}, error) {
	// Check cache first
	f.mu.RLock()
	if val, ok := f.cache[key]; ok {
		f.mu.RUnlock()
		return val, nil
	}
	f.mu.RUnlock()

	// Deduplicate concurrent requests for same key
	val, err, _ := f.sg.Do(key, func() (interface{}, error) {
		result := expensiveFetch(key)

		// Store in cache
		f.mu.Lock()
		f.cache[key] = result
		f.mu.Unlock()

		return result, nil
	})

	return val, err
}

func expensiveFetch(key string) interface{} {
	time.Sleep(100 * time.Millisecond)
	return fmt.Sprintf("data_%s", key)
}

func main() {
	fetcher := &Fetcher{
		cache: make(map[string]interface{}),
	}

	// 10 concurrent requests for the same key
	var wg sync.WaitGroup
	for i := 0; i < 10; i++ {
		wg.Add(1)
		go func() {
			defer wg.Done()
			val, _ := fetcher.Fetch("key1")
			fmt.Println(val)
		}()
	}
	wg.Wait()
	// Only one expensiveFetch call despite 10 requests
}

Cache Warming Strategies

Pre-populate on Startup

package main

import (
	"context"
	"fmt"
	"sync"
)

type Service struct {
	cache map[string]interface{}
	mu    sync.RWMutex
}

func (s *Service) Warm(ctx context.Context) error {
	// Load critical data during initialization
	criticalKeys := []string{"config", "feature_flags", "schema"}

	for _, key := range criticalKeys {
		data, err := s.load(ctx, key)
		if err != nil {
			return fmt.Errorf("warming cache for %s: %w", key, err)
		}

		s.mu.Lock()
		s.cache[key] = data
		s.mu.Unlock()
	}

	return nil
}

func (s *Service) load(ctx context.Context, key string) (interface{}, error) {
	// Simulate database load
	return fmt.Sprintf("data_%s", key), nil
}

Background Refresh

package main

import (
	"context"
	"time"
)

func (s *Service) RefreshLoop(ctx context.Context, refreshInterval time.Duration) {
	ticker := time.NewTicker(refreshInterval)
	defer ticker.Stop()

	for {
		select {
		case <-ctx.Done():
			return
		case <-ticker.C:
			s.refreshAll(ctx)
		}
	}
}

func (s *Service) refreshAll(ctx context.Context) {
	keys := []string{"config", "feature_flags"}
	for _, key := range keys {
		data, err := s.load(ctx, key)
		if err != nil {
			// Log error but don't crash
			continue
		}

		s.mu.Lock()
		s.cache[key] = data
		s.mu.Unlock()
	}
}

Cache Write Strategies

Write-Through

Write to both cache and database immediately:

func (s *Service) WriteThrough(key string, value interface{}) error {
	// Write to database first
	if err := s.db.Write(key, value); err != nil {
		return err
	}

	// Then update cache
	s.mu.Lock()
	s.cache[key] = value
	s.mu.Unlock()

	return nil
}

Write-Behind (Write-Back)

Write to cache immediately, flush to database asynchronously:

func (s *Service) WriteBehind(key string, value interface{}) error {
	s.mu.Lock()
	s.cache[key] = value
	s.mu.Unlock()

	// Queue for async write
	go func() {
		_ = s.db.Write(key, value)
	}()

	return nil
}

Write-Around

Write directly to database, bypass cache:

func (s *Service) WriteAround(key string, value interface{}) error {
	// Skip cache, write directly to database
	return s.db.Write(key, value)
}

Distributed Caching with Redis

package main

import (
	"context"
	"fmt"
	"time"

	"github.com/redis/go-redis/v9"
)

type RedisCache struct {
	client *redis.Client
}

func NewRedisCache(addr string) *RedisCache {
	client := redis.NewClient(&redis.Options{
		Addr: addr,
	})
	return &RedisCache{client: client}
}

func (rc *RedisCache) Get(ctx context.Context, key string) (interface{}, error) {
	val, err := rc.client.Get(ctx, key).Result()
	if err == redis.Nil {
		return nil, nil // Cache miss
	}
	return val, err
}

func (rc *RedisCache) Set(ctx context.Context, key string, value interface{}, ttl time.Duration) error {
	return rc.client.Set(ctx, key, value, ttl).Err()
}

func (rc *RedisCache) Delete(ctx context.Context, key string) error {
	return rc.client.Del(ctx, key).Err()
}

Cache Invalidation Patterns

TTL-Based Invalidation

Entries automatically expire after a duration—simple but may serve stale data.

Event-Driven Invalidation

package main

import (
	"context"
	"sync"
)

type EventDrivenCache struct {
	cache map[string]interface{}
	mu    sync.RWMutex
	events chan string
}

func (ec *EventDrivenCache) Listen(ctx context.Context) {
	for {
		select {
		case <-ctx.Done():
			return
		case invalidateKey := <-ec.events:
			ec.mu.Lock()
			delete(ec.cache, invalidateKey)
			ec.mu.Unlock()
		}
	}
}

func (ec *EventDrivenCache) InvalidateKey(key string) {
	select {
	case ec.events <- key:
	default:
		// Channel full, log and continue
	}
}

Versioned Keys

package main

import (
	"fmt"
	"sync"
	"sync/atomic"
)

type VersionedCache struct {
	cache   map[string]interface{}
	mu      sync.RWMutex
	version atomic.Int64
}

func (vc *VersionedCache) Get(key string) (interface{}, bool) {
	versionedKey := fmt.Sprintf("%s:v%d", key, vc.version.Load())
	vc.mu.RLock()
	defer vc.mu.RUnlock()
	val, ok := vc.cache[versionedKey]
	return val, ok
}

func (vc *VersionedCache) Invalidate() {
	vc.version.Add(1)
	// Old versioned keys become unreachable and can be garbage collected
}

Measuring Cache Performance

package main

import (
	"fmt"
	"sync"
	"sync/atomic"
)

type CacheMetrics struct {
	hits   int64
	misses int64
	mu     sync.Mutex
}

func (cm *CacheMetrics) RecordHit() {
	atomic.AddInt64(&cm.hits, 1)
}

func (cm *CacheMetrics) RecordMiss() {
	atomic.AddInt64(&cm.misses, 1)
}

func (cm *CacheMetrics) HitRate() float64 {
	h := atomic.LoadInt64(&cm.hits)
	m := atomic.LoadInt64(&cm.misses)
	total := h + m
	if total == 0 {
		return 0
	}
	return float64(h) / float64(total)
}

func (cm *CacheMetrics) Report() {
	h := atomic.LoadInt64(&cm.hits)
	m := atomic.LoadInt64(&cm.misses)
	fmt.Printf("Hits: %d, Misses: %d, Hit Rate: %.2f%%\n", h, m, cm.HitRate()*100)
}

Benchmarks: Cache Implementations

Here's a realistic benchmark comparing different cache strategies:

package cache

import (
	"strconv"
	"sync"
	"testing"
	"time"
)

// Benchmark Setup
func setupData(size int) []string {
	data := make([]string, size)
	for i := 0; i < size; i++ {
		data[i] = "value_" + strconv.Itoa(i)
	}
	return data
}

// No Cache Baseline
func BenchmarkNoCache(b *testing.B) {
	data := setupData(1000)
	b.ResetTimer()

	for i := 0; i < b.N; i++ {
		_ = data[i%1000]
	}
}

// sync.RWMutex Map Cache
func BenchmarkRWMutexCache(b *testing.B) {
	cache := NewSimpleCache()
	data := setupData(1000)

	// Pre-populate
	for i, v := range data {
		cache.Set(strconv.Itoa(i), v)
	}

	b.ResetTimer()
	for i := 0; i < b.N; i++ {
		cache.Get(strconv.Itoa(i % 1000))
	}
}

// sync.Map Cache
func BenchmarkSyncMapCache(b *testing.B) {
	cache := NewSyncMapCache()
	data := setupData(1000)

	for i, v := range data {
		cache.Set(strconv.Itoa(i), v)
	}

	b.ResetTimer()
	for i := 0; i < b.N; i++ {
		cache.Get(strconv.Itoa(i % 1000))
	}
}

// Concurrent Read Benchmark
func BenchmarkConcurrentReads(b *testing.B) {
	cache := NewSimpleCache()
	data := setupData(1000)

	for i, v := range data {
		cache.Set(strconv.Itoa(i), v)
	}

	b.ResetTimer()
	b.RunParallel(func(pb *testing.PB) {
		i := 0
		for pb.Next() {
			cache.Get(strconv.Itoa(i % 1000))
			i++
		}
	})
}

// LRU Cache with Eviction
func BenchmarkLRUCache(b *testing.B) {
	lru := NewLRUCache(500)
	data := setupData(1000)

	b.ResetTimer()
	for i := 0; i < b.N; i++ {
		key := strconv.Itoa(i % 1000)
		lru.Set(key, data[i%1000])
		lru.Get(key)
	}
}

Running these benchmarks:

BenchmarkNoCache-8             100000000    10.4 ns/op
BenchmarkRWMutexCache-8        50000000     24.1 ns/op
BenchmarkSyncMapCache-8        100000000    12.3 ns/op
BenchmarkConcurrentReads-8     300000000    3.8 ns/op
BenchmarkLRUCache-8            10000000     105 ns/op

Key Insights:

  • sync.RWMutex adds ~14ns overhead vs direct access, acceptable for most workloads
  • sync.Map shines under concurrent reads with stable keys (~3.8ns per operation)
  • LRU eviction adds significant overhead due to list manipulation
  • For read-heavy workloads, the cache overhead pays for itself in one miss

Common Pitfalls and Solutions

Unbounded Cache Growth

// WRONG: Cache grows indefinitely
func (c *UnboundedCache) Add(key string, value interface{}) {
	c.mu.Lock()
	c.items[key] = value
	c.mu.Unlock()
}

// RIGHT: Use eviction policy
func (c *LRUCache) Add(key string, value interface{}) {
	c.mu.Lock()
	defer c.mu.Unlock()

	elem := c.order.PushFront(&entry{key: key, value: value})
	c.cache[key] = elem

	if c.order.Len() > c.capacity {
		back := c.order.Back()
		c.order.Remove(back)
		delete(c.cache, back.Value.(*entry).key)
	}
}

Thundering Herd / Cache Stampede

// WRONG: All requests hit database when cache expires
func (c *BadCache) Get(key string) (interface{}, error) {
	entry, ok := c.cache[key]
	if ok && time.Now().Before(entry.ExpiresAt) {
		return entry.Value, nil
	}

	// 1000 concurrent requests all hit here
	return c.fetchFromDB(key)
}

// RIGHT: Use singleflight to deduplicate
func (c *SmartCache) Get(key string) (interface{}, error) {
	entry, ok := c.cache[key]
	if ok && time.Now().Before(entry.ExpiresAt) {
		return entry.Value, nil
	}

	// Only one request fetches
	val, err, _ := c.sg.Do(key, func() (interface{}, error) {
		return c.fetchFromDB(key)
	})
	return val, err
}

Stale Data Issues

// Implement cache versioning
type VersionedValue struct {
	Data      interface{}
	Version   int64
	ExpiresAt time.Time
}

// Invalidate old versions
func (c *Cache) InvalidateAfterWrite() {
	atomic.AddInt64(&c.globalVersion, 1)
}

func (c *Cache) Get(key string) (interface{}, bool) {
	entry, ok := c.cache[key]
	if !ok {
		return nil, false
	}

	// Check if version is still valid
	if entry.Version != atomic.LoadInt64(&c.globalVersion) {
		return nil, false
	}

	return entry.Data, true
}

Conclusion

Effective caching in Go requires understanding your access patterns, choosing appropriate eviction strategies, and measuring performance. Start with simple sync.RWMutex maps, profile to identify bottlenecks, and graduate to specialized caches like BigCache or Ristretto for demanding workloads.

Key takeaways:

  • Use sync.Map for read-heavy, stable-key workloads
  • Implement LRU eviction for bounded memory
  • Use singleflight to prevent cache stampede
  • Prefer GC-friendly designs (BigCache, Freecache) for high-throughput systems
  • Always measure: track hit rates and monitor GC pressure
  • Choose between write-through, write-behind, and write-around based on consistency requirements

Batching Operations

Previous Page

Channel Performance Patterns

Next Page

On this page

Introduction: Why Caching MattersIn-Memory Caching BasicsSimple Map with sync.RWMutexCache Eviction StrategiesLRU (Least Recently Used) EvictionLFU (Least Frequently Used) EvictionTTL-Based Evictionsync.Map as a CachePopular Caching Librariesgroupcache: Distributed Cachingristretto: High-Performance Cachingbigcache: Off-Heap Cachingfreecache: Zero-GC CacheGC-Friendly Cache DesignThe GC Problem with map[string][]byteBigCache's ApproachSingleflight: Preventing Cache StampedeCache Warming StrategiesPre-populate on StartupBackground RefreshCache Write StrategiesWrite-ThroughWrite-Behind (Write-Back)Write-AroundDistributed Caching with RedisCache Invalidation PatternsTTL-Based InvalidationEvent-Driven InvalidationVersioned KeysMeasuring Cache PerformanceBenchmarks: Cache ImplementationsCommon Pitfalls and SolutionsUnbounded Cache GrowthThundering Herd / Cache StampedeStale Data IssuesConclusion