Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

more realistic benchmarks. #2

Merged
merged 1 commit into from
Nov 15, 2020
Merged

more realistic benchmarks. #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
140 changes: 71 additions & 69 deletions cache_test.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -631,6 +631,7 @@ func TestEvacuateCount(t *testing.T) {
func BenchmarkCacheSet(b *testing.B) {
cache := NewCache(256 * 1024 * 1024)
var key [8]byte
b.ReportAllocs()
for i := 0; i < b.N; i++ {
binary.LittleEndian.PutUint64(key[:], uint64(i))
cache.Set(key[:], make([]byte, 8), 0)
Expand All @@ -655,128 +656,128 @@ func BenchmarkParallelCacheSet(b *testing.B) {
func BenchmarkMapSet(b *testing.B) {
m := make(map[string][]byte)
var key [8]byte
b.ReportAllocs()
for i := 0; i < b.N; i++ {
binary.LittleEndian.PutUint64(key[:], uint64(i))
m[string(key[:])] = make([]byte, 8)
}
}

func BenchmarkCacheGet(b *testing.B) {
cache, count := populateCache()

b.ResetTimer()
b.ReportAllocs()
b.StopTimer()
cache := NewCache(256 * 1024 * 1024)

var key [8]byte
buf := make([]byte, 64)
for i := 0; i < b.N; i++ {
binary.LittleEndian.PutUint64(key[:], uint64(i))
cache.Set(key[:], buf, 0)
binary.LittleEndian.PutUint64(key[:], uint64(i%count))
_, _ = cache.Get(key[:])
}
b.StartTimer()
for i := 0; i < b.N; i++ {
b.Logf("b.N: %d; hit rate: %f", b.N, cache.HitRate())
}

func populateCache() (*Cache, int) {
var (
cache = NewCache(256 * 1024 * 1024)
buf = make([]byte, 64)
key [8]byte
)

// number of entries that can fit with the above parameters before an
// eviction is needed, with the standard hash function and sequential
// uint64 keys.
const maxEntries = 2739652
for i := 0; i < maxEntries; i++ {
binary.LittleEndian.PutUint64(key[:], uint64(i))
cache.Get(key[:])
_ = cache.Set(key[:], buf, 0)
}
return cache, int(cache.EntryCount())
}

func BenchmarkCacheGetFn(b *testing.B) {
cache, count := populateCache()

b.ResetTimer()
b.ReportAllocs()
b.StopTimer()
cache := NewCache(256 * 1024 * 1024)
var key [8]byte
buf := make([]byte, 64)
for i := 0; i < b.N; i++ {
binary.LittleEndian.PutUint64(key[:], uint64(i))
cache.Set(key[:], buf, 0)

fn := func(val []byte) error {
_ = val
return nil
}
b.StartTimer()

var key [8]byte
for i := 0; i < b.N; i++ {
binary.LittleEndian.PutUint64(key[:], uint64(i))
_ = cache.GetFn(key[:], func(val []byte) error {
_ = val
return nil
})
binary.LittleEndian.PutUint64(key[:], uint64(i%count))
_ = cache.GetFn(key[:], fn)
}
b.Logf("b.N: %d; hit rate: %f", b.N, cache.HitRate())
}

func BenchmarkParallelCacheGet(b *testing.B) {
cache, count := populateCache()

b.ResetTimer()
b.ReportAllocs()
b.StopTimer()
cache := NewCache(256 * 1024 * 1024)
buf := make([]byte, 64)
var key [8]byte
for i := 0; i < b.N; i++ {
binary.LittleEndian.PutUint64(key[:], uint64(i))
cache.Set(key[:], buf, 0)
}
b.StartTimer()

b.RunParallel(func(pb *testing.PB) {
counter := 0
b.ReportAllocs()
for pb.Next() {
binary.LittleEndian.PutUint64(key[:], uint64(counter))
cache.Get(key[:])
counter = counter + 1
var key [8]byte
for i := 0; pb.Next(); i++ {
binary.LittleEndian.PutUint64(key[:], uint64(i%count))
_, _ = cache.Get(key[:])
}
})
b.Logf("b.N: %d; hit rate: %f", b.N, cache.HitRate())
}

func BenchmarkCacheGetWithBuf(b *testing.B) {
cache, count := populateCache()

b.ResetTimer()
b.ReportAllocs()
b.StopTimer()
cache := NewCache(256 * 1024 * 1024)

var key [8]byte
buf := make([]byte, 64)
for i := 0; i < b.N; i++ {
binary.LittleEndian.PutUint64(key[:], uint64(i))
cache.Set(key[:], buf, 0)
}
b.StartTimer()
for i := 0; i < b.N; i++ {
binary.LittleEndian.PutUint64(key[:], uint64(i))
cache.GetWithBuf(key[:], buf)
binary.LittleEndian.PutUint64(key[:], uint64(i%count))
_, _ = cache.GetWithBuf(key[:], buf)
}
b.Logf("b.N: %d; hit rate: %f", b.N, cache.HitRate())
}

func BenchmarkParallelCacheGetWithBuf(b *testing.B) {
cache, count := populateCache()

b.ResetTimer()
b.ReportAllocs()
b.StopTimer()
cache := NewCache(256 * 1024 * 1024)
var key [8]byte
buf := make([]byte, 64)
for i := 0; i < b.N; i++ {
binary.LittleEndian.PutUint64(key[:], uint64(i))
cache.Set(key[:], buf, 0)
}
b.StartTimer()

b.RunParallel(func(pb *testing.PB) {
counter := 0
b.ReportAllocs()
for pb.Next() {
binary.LittleEndian.PutUint64(key[:], uint64(counter))
cache.GetWithBuf(key[:], buf)
counter = counter + 1
var key [8]byte
buf := make([]byte, 64)
for i := 0; pb.Next(); i++ {
binary.LittleEndian.PutUint64(key[:], uint64(i%count))
_, _ = cache.GetWithBuf(key[:], buf)
}
})
b.Logf("b.N: %d; hit rate: %f", b.N, cache.HitRate())
}

func BenchmarkCacheGetWithExpiration(b *testing.B) {
b.StopTimer()
cache := NewCache(256 * 1024 * 1024)
cache, count := populateCache()

b.ResetTimer()
b.ReportAllocs()

var key [8]byte
for i := 0; i < b.N; i++ {
binary.LittleEndian.PutUint64(key[:], uint64(i))
cache.Set(key[:], make([]byte, 8), 0)
}
b.StartTimer()
for i := 0; i < b.N; i++ {
binary.LittleEndian.PutUint64(key[:], uint64(i))
cache.GetWithExpiration(key[:])
binary.LittleEndian.PutUint64(key[:], uint64(i%count))
_, _, _ = cache.GetWithExpiration(key[:])
}
b.Logf("b.N: %d; hit rate: %f", b.N, cache.HitRate())
}

func BenchmarkMapGet(b *testing.B) {
b.ReportAllocs()
b.StopTimer()
m := make(map[string][]byte)
var key [8]byte
Expand All @@ -799,6 +800,7 @@ func BenchmarkHashFunc(b *testing.B) {
rand.Read(key)

b.ResetTimer()
b.ReportAllocs()
for i := 0; i < b.N; i++ {
hashFunc(key)
}
Expand Down