-
Notifications
You must be signed in to change notification settings - Fork 330
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
ungron is slow and leaky #93
Comments
I'll have a look at this for my memory-efficient fork. Looks like it's probably reasonably straightforward to fix this (especially given the helpful |
With N=21, I've got it down to 12s and 459M. Without frequent |
That sounds cool. Do you plan to merge these adjustments to the code base? (If not yet suitable for prime time, then at least on a topic branch?) |
I'll try and get a branch up on my fork this week. |
Couple of days delay - had an epiphany earlier which might bring the memory usage right down if I can rearchitect the internals appropriately. But it looks promising from today's quick testing... |
Up on my fork,
Output verified as correct by feeding them all through Falls off a CPU (but not memory) cliff with n=25 - it's not the number of lines because I can feed it 75M lines of a different file with no problem. I suspect the depth of the structure and resultant cavalcade of pointers are causing the GC some internal discomfort. Investigations continue but it's mostly good to go for normal workloads now. (All benchmarks run on a 2020 M1 Pro with arm64 binaries, Go 1.17) |
Hi @csabahenk @rjp , as an alternative option you can try my project, https://github.com/adamritter/fastgron (written in C++). It doesn't support -j (JSON based output format), but I converted the file that was outputted by ./bintreefold 21, and got these timings: time gron -u g.gson > /dev/null time fastgron -u g.gson > /dev/null (for the gron case fastgron is getting even more speedup, as it uses a SIMD optimized library for JSON parsing) |
I'm using the following Ruby script named bintreefeed.rb as data generator:
It takes a single numeric argument N, and produces the gronned description of a complete binary tree of height N (using the JSON format). Example:
Increasing N we can observe that gron becomes extremely slow and bloated. Eg. the N=20 results are on my machine:
./bintreefeed 20 | gron -u -j -m > /dev/null
takes 30 seconds and peaks at 5Gb footprint. For comparison, I have a Ruby reimplementation of gron at https://github.com/csabahenk/gron_rb. Using its gron.rb script,./bintreefeed 20 | ./gron.rb -u > /dev/null
takes 7 second and the footprint is around 300 Mb. Checked also with N=21: gron runs 58 seconds with 14Gb footprint, while gron.rb runs 22 seconds with 480 Mb footprint.Notes:
tested with current gron release (0.6.1) and master (6d4fe18)
a difference between gron and gron.rb, that with
-u
former produces indented JSON, while latter produces compact JSON. To get indented JSON with gron.rb, one can use the following oneliner (executed in the gron_rb repo):ruby -I. -rgron -rjson -e 'Gron::Ungron.new{|u| $<.each{|l| u << JSON.load(l)}}.tree.then{|t| JSON.pretty_generate t}.then{|s| puts s}'
Using this, the runtime with N=20 increases to 10 seconds and the footprint to 380 Mb — not a significant difference.
The text was updated successfully, but these errors were encountered: