Programming-Language-Benchmarks
Folly
Programming-Language-Benchmarks | Folly | |
---|---|---|
19 | 90 | |
593 | 27,118 | |
- | 0.6% | |
5.3 | 9.8 | |
12 days ago | 6 days ago | |
C# | C++ | |
MIT License | Apache License 2.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.
Programming-Language-Benchmarks
-
A Comprehensive Introduction to Golang
The benchmark available at https://programming-language-benchmarks.vercel.app/ demonstrates that Golang stands out as one of the most memory-efficient languages presently available. This achievement is attributable to several inherent features of Golang, such as its static typing, robust garbage collection system, and the inherent structuring of data within the language. These traits collectively contribute to Golang's exceptional efficiency in terms of minimal memory consumption compared to other languages.
- Rust vs Zig Benchmarks
-
Ask HN: What are some of the most elegant codebases in your favorite language?
I found Zig implementation of json parsing is interesting. The code is free from hidden control flow !.
https://github.com/hanabi1224/Programming-Language-Benchmark...
-
why does this while loop run instantly
I think https://programming-language-benchmarks.vercel.app/ is a good starting point to compare languages and compilers, also implementations are optimized for the specific language so you don't end up with a poorly ported c++ implementation in rust and wonder why it performs so bad.
- Why did tiger beetle choose zig over rust?
-
How fast is JIT compiled Lua/JavaScript compared to static compiled C++ and Rust measured in runtime?
It varies a lot depending on what the code consists of, but if you want concrete numbers for certain benchmarks, this site might be of interest: https://programming-language-benchmarks.vercel.app/
-
Speed Comparisons: JavaScript vs Python vs C vs Rust
There is not "one real" benchmark. In the end, all you can do is test languages for a specific feature / purpose. You can see how many different suggestions people have here, and here (I think) you can see the difficulties of comparing languages. That site uses quite a lot of algorithms / problems with multiple inputs, single and multithreaded, with different optimization flags (where applicable) and so on paired with different languages, and it's a mess. Sometimes one language is on top, sometimes another. (I mean, python will very rarely beat pure C, but I wont rule out that someone already created an edge case just to refute exactly this point)
- how to benchmark a programming language
- The original computer languages benchmark is back
-
Comparing Elixir with Rust and Go
Hello, World!: Elixir vs. Go vs. Rust
Folly
-
Ask HN: How bad is the xz hack?
https://github.com/facebook/folly/commit/b1391e1c57be71c1e2a...
-
Backdoor in upstream xz/liblzma leading to SSH server compromise
https://github.com/facebook/folly/pull/2153
-
A lock-free ring-buffer with contiguous reservations (2019)
To set a HP on Linux, Folly just does a relaxed load of the src pointer, release store of the HP, compiler-only barrier, and acquire load. (This prevents the compiler from reordering the 2nd load before the store, right? But to my understanding does not prevent a hypothetical CPU reordering of the 2nd load before the store, which seems potentially problematic!)
Then on the GC/reclaim side of things, after protected object pointers are stored, it does a more expensive barrier[0] before acquire-loading the HPs.
I'll admit, I am not confident I understand why this works. I mean, even on x86, loads can be reordered before earlier program-order stores. So it seems like the 2nd check on the protection side could be ineffective. (The non-Linux portable version just uses an atomic_thread_fence SeqCst on both sides, which seems more obviously correct.) And if they don't need the 2nd load on Linux, I'm unclear on why they do it.
[0]: https://github.com/facebook/folly/blob/main/folly/synchroniz...
(This uses either mprotect to force a TLB flush in process-relevant CPUs, or the newer Linux membarrier syscall if available.)
-
Appending to an std:string character-by-character: how does the capacity grow?
folly provides functions to resize std::string & std::vector without initialization [0].
[0] https://github.com/facebook/folly/blob/3c8829785e3ce86cb821c...
-
Can anyone explain feedback of a HFT firm regarding implementation of SPSC lock-free ring-buffer queue?
My implementation was quite similar to Boost's spsc_queue and Facebook's folly/ProducerConsumerQueue.h.
-
A Compressed Indexable Bitset
> How is that relevant?
Roaring bitmaps and similar data structures get their speed from decoding together consecutive groups of elements, so if you do sequential decoding or decode a large fraction of the list you get excellent performance.
EF instead excels at random skipping, so if you visit a small fraction of the list you generally get better performance. This is why it works so well for inverted indexes, as generally the queries are very selective (otherwise why do you need an index?) and if you have good intersection algorithms you can skip a large fraction of documents.
I didn't follow the rest of your comment, select is what EF is good at, every other data structure needs a lot more scanning once you land on the right chunk. With BMI2 you can also use the PDEP instruction to accelerate the final select on a 64-bit block: https://github.com/facebook/folly/blob/main/folly/experiment...
-
Defer for Shell
C++ with folly's SCOPE_EXIT {} construct:
https://github.com/facebook/folly/blob/main/folly/ScopeGuard...
-
Is there any facebook/folly community for discussion and Q&A?
Seems like github issues taking a long time to get any response: https://github.com/facebook/folly
-
How a Single Line of Code Made a 24-Core Server Slower Than a Laptop
Can't speak for abseil and tbb, but in folly there are a few solutions for the common problem of sharing state between a writer that updates it very infrequently and concurrent readers that read it very frequently (typical use case is configs).
The most performant solutions are RCU (https://github.com/facebook/folly/blob/main/folly/synchroniz...) and hazard pointers (https://github.com/facebook/folly/blob/main/folly/synchroniz...), but they're not quite as easy to use as a shared_ptr [1].
Then there is simil-shared_ptr implemented with thread-local counters (https://github.com/facebook/folly/blob/main/folly/experiment...).
If you absolutely need a std::shared_ptr (which can be the case if you're working with pre-existing interfaces) there is CoreCachedSharedPtr (https://github.com/facebook/folly/blob/main/folly/concurrenc...), which uses an aliasing trick to transparently maintain per-core reference counts, and scales linearly, but it works only when acquiring the shared_ptr, any subsequent copies of that would still cause contention if passed around in threads.
[1] Google has a proposal to make a smart pointer based on RCU/hazptr, but I'm not a fan of it because generally RCU/hazptr guards need to be released in the same thread that acquired them, and hiding them in a freely movable object looks like a recipe for disaster to me, especially if paired with coroutines https://www.open-std.org/jtc1/sc22/wg21/docs/papers/2020/p05...
-
Ask HN: What are some of the most elegant codebases in your favorite language?
Not sure if it's still the case but about 6 years ago Facebook's folly C++ library was something I'd point to for my junior engineers to get a sense of "good" C++ https://github.com/facebook/folly
What are some alternatives?
Programming-Language-Benchmark
abseil-cpp - Abseil Common Libraries (C++)
svix-webhooks - The enterprise-ready webhooks service 🦀
Boost - Super-project for modularized Boost
rust-csharp-ffi - An example Rust + C# hybrid application
Seastar - High performance server-side application framework
Game-Of-Life-Implementations - Conway's Game of Life implementation in various languages
parallel-hashmap - A family of header-only, very fast and memory-friendly hashmap and btree containers.
sb-simd - A convenient SIMD interface for SBCL.
EASTL - Obsolete repo, please go to: https://github.com/electronicarts/EASTL
lish - Lisp Shell
OpenFrameworks - openFrameworks is a community-developed cross platform toolkit for creative coding in C++.