us
pyroscope
us | pyroscope | |
---|---|---|
2 | 56 | |
55 | 7,382 | |
- | - | |
1.5 | 9.6 | |
4 months ago | about 1 year ago | |
Go | Go | |
MIT License | GNU Affero General Public License v3.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
us
-
Ask HN: What are some 'cool' but obscure data structures you know about?
It might be easier to think about it as a stack, rather than a tree. Each element of the stack represents a subtree -- a perfect binary tree. If you ever have two subtrees of height k, you merge them together into one subtree of height k+1. Your stack might already have another subtree of height k+1; if so, you repeat the process, until there's at most one subtree of each height.
This process is isomorphic to binary addition. Worked example: let's start with a single leaf, i.e. a subtree of height 0. Then we "add" another leaf; since we now have a pair of two equally-sized leaves, we merge them into one subtree of height 1. Then we add a third leaf; now this one doesn't have a sibling to merge with, so we just keep it. Now our "stack" contains two subtrees: one of height 1, and one of height 0.
Now the isomorphism: we start with the binary integer 1, i.e. a single bit at index 0. We add another 1 to it, and the 1s "merge" into a single 1 bit at index 1. Then we add another 1, resulting in two 1 bits at different indices: 11. If we add one more bit, we'll get 100; likewise, if we add another leaf to our BNT, we'll get a single subtree of height 2. Thus, the binary representation of the number of leaves "encodes" the structure of the BNT.
This isomorphism allows you to do some neat tricks, like calculating the size of a Merkle proof in 3 asm instructions. There's some code here if that helps: https://github.com/lukechampine/us/blob/master/merkle/stack....
You could also check out section 5.1 of the BLAKE3 paper: https://github.com/BLAKE3-team/BLAKE3-specs/blob/master/blak...
-
My proposal to the Foundation: add first-class S3 provider support
This isn't what I'm asking for - I don't care if it's baked into us, exists as a backend for minio, uses PseudoKV https://github.com/lukechampine/us/issues/67, or whatever the case may be. I see no value in sending any third party my private data in an unencrypted form (uploading to your server, even if over HTTPS, you got my data).
pyroscope
- Grafana Phlare, open source database for continuous profiling at scale
-
The pros and cons of eBPF profiling in K8s
What do you mean? pyroscope.io was slow for you? or the blog?
- Go garbage collector doesn't release memory
- Pyroscope - Continuous profiling platform
-
Ask HN: What are some 'cool' but obscure data structures you know about?
Tries (or prefix trees).
We use them a lot at Pyroscope for compressing strings that have common prefixes. They are also used in databases (e.g indexes in Mongo) or file formats (e.g debug symbols in macOS/iOS Mach-O format are compressed using tries).
We have an article with some animations that go into details about tries in case anyone's interested [0].
[0] https://github.com/pyroscope-io/pyroscope/blob/main/docs/sto...
- How to add dynamic tags/labels to Java profiles (example)
-
Question: How do you handle oversized heap analysis?
You could use continuous profiling with Pyroscope which uses async-profiler under the hood, but with the added functionality that you can add relevant tags to your VMs (example).
-
JFR (Java Flight Recorder) Parser written in Go
Java Flight Recorder (JFR) is a format for collecting diagnostic and profiling data from Java applications. A while back someone created an issue for Pyroscope , an open source continuous profiler written in Go, to support ingesting profiles in JFR format, but there were no existing parsers that were also written in Go.
-
flamegraph.com - a new website for uploading, analyzing, and sharing pprof profiles
This cloud version is actually a slimmed-down version of Pyroscope which is open source and so you can run it locally.
-
We created flamegraph.com - A website for uploading, analyzing, and sharing flamegraphs
At Pyroscope (open source continuous profiling) we use flamegraphs extensively to visualize and analyze profiling data. However, one of the worst parts about using flamegraphs for analysis is that they are kind of annoying to share.
What are some alternatives?
lnd - Lightning Network Daemon ⚡️
parca - Continuous profiling for analysis of CPU and memory usage, down to the line number and throughout time. Saving infrastructure cost, improving performance, and increasing reliability.
ego - EGraphs in OCaml
profefe - Continuous profiling for long-term postmortem analysis
swift - the multiparty transport protocol (aka "TCP with swarming" or "BitTorrent at the transport layer")
barrier - Open-source KVM software
pvfmm - A parallel kernel-independent FMM library for particle and volume potentials
Grafana - The open and composable observability and data visualization platform. Visualize metrics, logs, and traces from multiple sources like Prometheus, Loki, Elasticsearch, InfluxDB, Postgres and many more.
gring - Golang circular linked list with array backend
SheetJS js-xlsx - 📗 SheetJS Spreadsheet Data Toolkit -- New home https://git.sheetjs.com/SheetJS/sheetjs
ctrie-java - Java implementation of a concurrent trie
Oat++ - 🌱Light and powerful C++ web framework for highly scalable and resource-efficient web application. It's zero-dependency and easy-portable.