In March 2023, Grafana Labs acquired Pyroscope, the company behind the eponymous open source continuous profiling project. In September 2023,
Grafana Pyroscope v1.0.0 was released.
This documentation covers Pyroscope versions preceding
v1.0.0. We're keeping it for the time being, but we recommend that you upgrade to Grafana Pyroscope v1.0.0 or higher and switch to the new Grafana Pyroscope Docs for most up-to-date documentation.
This article is relevant for pre-v1.0.0 versions of Pyroscope. Since acquisition of Pyroscope in March 2023 we've been working on a new horizontally scalable storage engine that was released in v1.0.0. You can learn more about it here. This article is here for historical purposes.
The challenge with continuous profiling is that if you just take frequent chunks of profiling data, compress it, and store it somewhere, it becomes:
- Too much data to store efficiently
- Too much data to query quickly
We solve these problems by:
- Using a combination of tries and trees to compress data efficiently
- Using segment trees to return queries for any timespan of data in Olog(n) vs O(n) time complexity
The simplest way to represent profiling data is in a list of string each one representing a stack trace and a number of times this particular stack trace was seen during a profiling session:
server.py;fast_function;work 2server.py;slow_function;work 8
The first obvious thing we do is we turn this data into a tree. Conveniently, this representation also makes it easy to later generate flamegraphs.
Compressing the stack traces into trees saves space on repeated elements. By using trees, we go from having to store common paths like
net/http.request in the db multiple times to only having to store it 1 time and saving a reference to the location at which it's located. This is fairly standard with profiling libraries since its the lowest hanging fruit when it comes to optimizing storage with profiling data.
So now that we've compressed the raw profiling data by converting into a tree, many of the nodes in this compressed tree contain symbols that also share repeated elements with other nodes. For example:
net/http.request;net/io.read 100 samplesnet/http.request;net/io.write 200 samples
net/io.write functions differ they share the same common ancestor of
Each of these lines can be serialized using a prefix tree as follows. This means that instead of storing the same prefixes multiple times, we can now just store them once in a trie and access them by storing a pointer to their position in memory:
In this basic example we save ~80% of space going from 39 bytes to 8 bytes. Typically symbol names are much longer and as the number of symbols grows, storage requirements grow logarithmically rather than linearly.
In the end, by using a tree to compress the raw profiling data and then using tries to compress the symbols we get the following storage amounts for our simple example:
| data type | bytes ||---------------------|-------|| raw data | 93 || tree | 58 || tree + trie | 10 |
As you can see this is a 9x improvement for a fairly trivial case. In real world scenarios the compression factor gets much larger.
Now that we have a way of storing the data efficiently the next problem that arises is how do we query it efficiently. The way we solve this problem is by pre-aggregating the profiling data and storing it in a special segment tree.
Every 10s Pyroscope agent sends a chunk of profiling data to the server which writes the data into the db with the corresponding timestamp. You'll notice that each write happens once, but is replicated multiple times.
Each layer represents a time block of larger units so in this case for every two 10s time blocks, one 20s time block is created. This is to make reading the data more efficient (more on that in a second).
If you don't use segment trees and just write data in 10 second chunks the time complexity for the reads becomes a function of how many 10s units the query asks for. If you want 1 year of data, you'll have to then merge 3,154,000 trees representing the profiling data. By using segment trees you can effectively decrease the amount of merge operations from O(n) to Olog(n).