plb2
related_post_gen
plb2 | related_post_gen | |
---|---|---|
7 | 15 | |
238 | 279 | |
- | - | |
9.4 | 9.9 | |
20 days ago | about 2 months ago | |
C | C++ | |
Creative Commons Zero v1.0 Universal | MIT License |
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.
plb2
-
Byte-Sized Swift: Building Tiny Games for the Playdate
https://github.com/attractivechaos/plb2 - limited but broad comparison across a large number of languages. Swift and Nim both compare favourably to C.
-
The One Billion Row Challenge in Go: from 1m45s to 4s in nine solutions
https://github.com/attractivechaos/plb2/blob/master/README.m...
Synthetic benchmarks aside, I think as far as average (spring boots of the world) code goes, Go beats Java almost every time, often in less lines than the usual pom.xml
-
Python 3.13 Gets a JIT
I wouldn't be so enthusiastic. Look at other languages that have JIT now: Ruby and PHP. After years of efforts, they are still an order of magnitude slower than V8 and even PyPy [1]. It seems to me that you need to design a JIT implementation from ground up to get good performance – V8, Dart, LuaJIT and PyPy are like this; if you start with a pure interpreter, it may be difficult to speed it up later.
[1] https://github.com/attractivechaos/plb2
-
Benchmarking 20 programming languages on N-queens and matrix multiplication
A curious thing about Swift: after https://github.com/attractivechaos/plb2/pull/23, the matrix multiplication example is comparable to C and Rust. However, I don’t see a way to idiomatically optimise the sudoku example, whose main overhead is allocating several arrays each time solve() is called. Apparently, in Swift there is no such thing as static array allocation. That’s very unfortunate.
related_post_gen
-
Speed up your code: don't pass structs bigger than 16 bytes on AMD64
Looks like the HO means hand optimized, with special datastructures for this benchmark.
see: https://github.com/jinyus/related_post_gen/#user-content-fn-...
-
Benchmarking 20 programming languages on N-queens and matrix multiplication
There is one for data processing here: https://github.com/jinyus/related_post_gen
-
The Neat Programming Language
Is it ready for benchmarking? D currently sits at the top of https://github.com/jinyus/related_post_gen and it would be interesting to see how neat stacks up.
-
Murder is a pixel art ECS game engine in C#
[2] https://github.com/jinyus/related_post_gen#multicore-results
-
Jaq – A jq clone focused on correctness, speed, and simplicity
I think my benchmark[1] would be a great test for this. The jq[2] version takes 50s on my machine.
[1] : https://github.com/jinyus/related_post_gen
[2]: https://github.com/jinyus/related_post_gen/blob/main/jq/rela...
-
Gleam vs Erlang vs Go vs Zig vs Rust for data processing
I added gleam to my data processing benchmark and the performance is less than stellar...so I hope someone here can make suggestions to improve it.
- jinyus/related_post_gen: Data Processing benchmark featuring Rust, Go, Swift, Zig, Julia etc.
-
Ask HN: What's the big deal with Go (Golang)?
Easy concurrency.
ps: I wrote a data processing benchmark[1] and go is currently leading the charts. I ported it to c++ but it's not performing as expected. Take a look if you have the time.
[1]: https://github.com/jinyus/related_post_gen
- Julia leads Rust,Zig,Go and Java in data processing benchmark
- Julia Ranks First in Data Processing Microbenchmark
What are some alternatives?
c-examples - Example C code
uiua - A stack-based array programming language
laser - The HPC toolbox: fused matrix multiplication, convolution, data-parallel strided tensor primitives, OpenMP facilities, SIMD, JIT Assembler, CPU detection, state-of-the-art vectorized BLAS for floats and integers
pspy - Monitor linux processes without root permissions
weave - A state-of-the-art multithreading runtime: message-passing based, fast, scalable, ultra-low overhead
ivy - ivy, an APL-like calculator
tarantool - Get your data in RAM. Get compute close to data. Enjoy the performance.
BQN - An APL-like programming language. Self-hosted!
blis - BLAS-like Library Instantiation Software Framework
cognate - A human readable quasi-concatenative programming language
1brc - 1BRC in .NET among fastest on Linux
Saxon-HE - Saxon-HE open source repository