Skip to content

penberg/awesome-low-latency

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

22 Commits
 
 

Repository files navigation

Awesome Low Latency

Low latency programming is increasingly important across a variety of use cases. Still, many of the tips and tricks of low latency are only part of developer folklore. This document attempts to codify that knowledge for people to (re)discover the art of low-latency programming.

Patterns

How to Measure Latency Correctly

  • Latency is a distribution
  • Avoid coordinated omission

Avoid Data Movement

  • Co-locate compute and data e.g. Processing-In-Memory or Processing-Near-Memory
  • Replicate data for faster access
  • Maximize cache hit rate
  • Control memory access patterns

Avoid Work

  • Tame algorithmic complexity
  • Avoid dynamic memory management
  • Avoid demand paging to prevent memory thrashing e.g. by using larger memory pages (hugepages on Linux, superpages on FreeBSD, ...)
  • Avoid as much work as possible (for example, avoid function call overhead by using inlining)
  • Avoid CPU intensive computation.

Avoid Waiting

  • Partition data to avoid sharing (and, therefore, synchronization)
  • Make shared data structures read-only (when possible)
  • Reduce head-of-line blocking
  • Avoid context switching
  • Use wait-free data synchronization
  • Use busy-polling instead of wakeups
  • Disable Nagle's algorithm
  • Use non-blocking I/O

Hide Latency

  • Parallelize requests to different services
  • Request hedging (send redundant requests to multiple replicase, use response from fastest one)
  • Use optimized SIMD instructions for suitable problems
  • Multiprocessing and multithreading

Tune for Low Latency

  • Use preemptible kernel
  • Interrupt and process affinity
  • Watch out for bad device drivers

Advanced Topics

  • Use kernel-bypass networking such as DPDK or XDP
  • Use hardware offload with accelerators and FPGA

Blogs

Publications

Books

Conferences