Hello, over the course of past few months I have been tasked with solving a (real-world) problem of sorting the sums of all possible combinations of numbers. Some boring accounting stuff revolving around invoices. As the total number of combinations is 2^N where N is the number of source numbers, this task got "interesting" once there were more than 24 numbers - that is on my laptop with:
model name : Intel(R) Core(TM) i7-8550U CPU @ 1.80GHz 4 cores, 8 hyper-threads and 16GB RAM. Long story short, I had to implement a custom merge-sort for fxvectors and managed to leverage futures for fully parallel execution. Now in some spare time, I slightly polished the code and released it as "futures-sort" package. The source code is available on GitHub[1] and it is already in Racket package index[2]. The package provides four sorting functions - two for vector? and two for fxvector?. There are two variants of each, one with progress reporting and one without. For the original task I needed to show progress using racket/gui gauge% and it might be helpful for others (it's just a callback that gets current and total number of merges performed regularly). I would really appreciate any feedback regarding the naming conventions, code style and generally anything else. Yes, the tests are not there (yet). The same algorithm without futures runs on par with Racket's default sorting routines (tested for sets upto 2^30 - only 16G of memory here) and for fixnums it is even (very slightly but consistently) faster than vector-sort alone. With parallelism using futures it runs roughly N times faster where N is the number reported by (processor-count). I have already some benchmark results available and once I get more data I am more than happy to share it as well. The parallelism is configurable as parameter. And yes, all of this can be seen in the documentation which is included but I still have to look into how to build it - I was sort of assuming this works automatically based on what I see for example in scribble-math[3][4]. Any help with getting this right is also more than welcome. Lastly - thanks go out to Jens Axel Søgaard for pointing out that fixnums and fxvectors might help (and why) and also to other helpful folks on #racket at Freenode. Cheers, Dominik [1] https://github.com/dzoep/futures-sort [2] https://pkgd.racket-lang.org/pkgn/package/futures-sort [3] https://docs.racket-lang.org/scribble-math/index.html [4] https://pkgd.racket-lang.org/pkgn/package/scribble-math -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/racket-users/bdddfd14-7e06-28e7-91c0-67a2403f5629%40trustica.cz.
