![]() Is presenting the data in a way which doesn't destroy the Generating the benchmark even slower, but the main problem Number of cores-that's 288 different configurations on anĨ-core machine per dataset). The number of data points (for example, LZMA would have 4Ĭodecs with 9 levels each, multiplied the number the I'm willing to consider pull requests if youĬan find a good way to display it, as well as a good Wall-clock data is actually captured but not ![]() I would be very happy to merge it, and integrate it intoĬPU time. Good way to capture that data on the C side I would really like to include that data. Prefixes-1 KiB is 1024 bytes, 1 MiB is 1024 KiB, and so on. (2 × uncompressed size ) ÷ ( compression time + decompression time) Uncompressed size ÷ decompression time Round Trip Speed Uncompressed size ÷ compression time Decompression Speed Uncompressed size ÷ compressed size Compression Speed Those are then used toĬalculate the values used in the benchmark: The benchmark collects the compressed size, compression This on are running Linux with various architectures, soĮven if there is a plugin for a Windows-only, or x86-only,Įtc., library it probably will not show up for everyĪ Windows API plugin, but it will not show up on any Still may be willing to accept a pull request forĪ plugin, but keep in mind that all the machines I run If the codec doesn't meet all the above critera I Plugin, or at least merge a pull request. Source the odds are good I would be willing to write a Tests), works on Linux, accessible from C or C++, and open If the codec is reliable (it has to pass Squash's unit If there is a specific codec you're interested in, In order to be included the benchmark the software must be Message to announce the updated version of both the Sure! This benchmark is updated whenever a new version of Section "TITYMBW" the first thing I would have to I thought you might be wondering", but if I called this So much "frequently asked questions" as "things Well, okay, I'm writing this before I publish the URL, so not
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |