EveryCulling
simdjson
Our great sponsors
EveryCulling | simdjson | |
---|---|---|
3 | 65 | |
120 | 18,362 | |
- | 1.2% | |
3.4 | 9.2 | |
3 months ago | 18 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.
EveryCulling
-
Introduce my in-house game engine
And I have been trying to make game engine faster. So I implemented SW ViewFrustumCulling(https://www.ea.com/frostbite/news/culling-the-battlefield-data-oriented-design-in-practice) and SW Occlusion Culling ( Masked SW Occlusion Culling, https://www.intel.com/content/dam/develop/external/us/en/documents/masked-software-occlusion-culling.pdf ), Distance Culling from unreal engine. You can see source code at here ( https://github.com/SungJJinKang/EveryCulling )
-
I implemented Masked SW Occlusion Culling in my in-house game engine
And Data layout is defined for multithreading. You can see at here https://github.com/SungJJinKang/EveryCulling/blob/main/DataType/EntityBlock.h. Every entities's datas is stored in this EntityBlock. EntityBlock has 16 ~ 24 entities datas. Then Each threads work on a entity block. It makes no requirement for lock to prevent data race. And It prevent false sharing because threads works on different cache line.
simdjson
-
Tips on adding JSON output to your command line utility. (2021)
It's also supported by simdjson [0] (which has a lot of language bindings [1]):
> Multithreaded processing of gigantic Newline-Delimited JSON (ndjson) and related formats at 3.5 GB/s
[0] https://simdjson.org/
[0] https://github.com/simdjson/simdjson?tab=readme-ov-file#bind...
- 1BRC Merykitty's Magic SWAR: 8 Lines of Code Explained in 3k Words
- Training great LLMs from ground zero in the wilderness as a startup
- simdjson: Parsing Gigabytes of JSON per Second
-
Use any web browser as GUI, with Zig in the back end and HTML5 in the front end
String parsing is negligible compared to the speed of the DOM which is glacially slow: https://news.ycombinator.com/item?id=38835920
Come on, people, make an effort to learn how insanely fast computers are, and how insanely inefficient our software is.
String parsing can be done at gigabytes per second: https://github.com/simdjson/simdjson If you think that is the slowest operation in the browser, please find some resources that talk about what is actually happening in the browser?
-
Cray-1 performance vs. modern CPUs
Thanks for all the detailed information! That answers a bunch of my questions and the implementation of strlen is nice.
The instruction I was thinking of is pshufb. An example ‘weird’ use can be found for detecting white space in simdjson: https://github.com/simdjson/simdjson/blob/24b44309fb52c3e2c5...
This works as follows:
1. Observe that each ascii whitespace character ends with a different nibble.
2. Make some vector of 16 bytes which has the white space character whose final nibble is the index of the byte, or some other character with a different final nibble from the byte (eg first element is space =0x20, next could be eg 0xff but not 0xf1 as that ends in the same nibble as index)
3. For each block where you want to find white space, compute pcmpeqb(pshufb(whitespace, input), input). The rules of pshufb mean (a) non-ascii (ie bit 7 set) characters go to 0 so will compare false, (b) other characters are replaced with an element of whitespace according to their last nibble so will compare equal only if they are that whitespace character.
I’m not sure how easy it would be to do such tricks with vgather.vv. In particular, the length of the input doesn’t matter (could be longer) but the length of white space must be 16 bytes. I’m not sure how the whole vlen stuff interacts with tricks like this where you (a) require certain fixed lengths and (b) may have different lengths for tables and input vectors. (and indeed there might just be better ways, eg you could imagine an operation with a 256-bit register where you permute some vector of bytes by sign-extending the nth bit of the 256-bit register into the result where the input byte is n).
-
Codebases to read
Additionally, if you like low level stuff, check out libfmt (https://github.com/fmtlib/fmt) - not a big project, not difficult to understand. Or something like simdjson (https://github.com/simdjson/simdjson).
- Simdjson: Parsing Gigabytes of JSON per Second
-
Building a high performance JSON parser
Everything you said is totally reasonable. I'm a big fan of napkin math and theoretical upper bounds on performance.
simdjson (https://github.com/simdjson/simdjson) claims to fully parse JSON on the order of 3 GB/sec. Which is faster than OP's Go whitespace parsing! These tests are running on different hardware so it's not apples-to-apples.
The phrase "cannot go faster than this" is just begging for a "well ackshully". Which I hate to do. But the fact that there is an existence proof of Problem A running faster in C++ SIMD than OP's Probably B scalar Go is quite interesting and worth calling out imho. But I admit it doesn't change the rest of the post.
-
New package : lspce - a simple LSP Client for Emacs
I have same question as /u/JDRiverRun : how do you deal with JSON, do you parse json on Rust side or on Emacs side. I see that you are requiring json.el in your lspce.el, but I haven't looked through entire file carefully. If you parse on Rust side, do you use simdjson (there are at least two Rust bindings to it)? If yes, what are your impressions, experiences compared to more "standard" json library?