NAME
Bencher::Scenario::GraphTopologicalSortModules - Benchmark graph topological sort modules
VERSION
This document describes version 0.002 of Bencher::Scenario::GraphTopologicalSortModules (from Perl distribution Bencher-Scenario-GraphTopologicalSortModules), released on 2017-01-25.
SYNOPSIS
To run benchmark with default option:
% bencher -m GraphTopologicalSortModulesTo run module startup overhead benchmark:
% bencher --module-startup -m GraphTopologicalSortModulesFor more options (dump scenario, list/include/exclude/add participants, list/include/exclude/add datasets, etc), see bencher or run bencher --help.
DESCRIPTION
Packaging a benchmark script as a Bencher scenario makes it convenient to include/exclude/add participants/datasets (either via CLI or Perl code), send the result to a central repository, among others . See Bencher and bencher (CLI) for more details.
BENCHMARKED MODULES
Version numbers shown below are the versions used when running the sample benchmark.
Data::Graph::Util 0.002
Sort::Topological 0.02
BENCHMARK PARTICIPANTS
Sort::Topological::toposort (perl_code)
Code template:
my $graph = <graph>; Sort::Topological::toposort(sub { @{ $graph->{shift} || [] } }, <unsorted>)Data::Graph::Util::toposort (perl_code)
Function call template:
Data::Graph::Util::toposort(<graph>, <unsorted>)
BENCHMARK DATASETS
g1
SAMPLE BENCHMARK RESULTS
Run on: perl: v5.24.0, CPU: Intel(R) Core(TM) M-5Y71 CPU @ 1.20GHz (2 cores), OS: GNU/Linux LinuxMint version 17.3, OS kernel: Linux version 3.19.0-32-generic.
Benchmark with default options (bencher -m GraphTopologicalSortModules):
#table1#
+-----------------------------+-----------+-----------+------------+---------+---------+
| participant | rate (/s) | time (μs) | vs_slowest | errors | samples |
+-----------------------------+-----------+-----------+------------+---------+---------+
| Sort::Topological::toposort | 78300 | 12.8 | 1 | 6.7e-09 | 20 |
| Data::Graph::Util::toposort | 81000 | 12 | 1 | 1.3e-08 | 21 |
+-----------------------------+-----------+-----------+------------+---------+---------+Benchmark module startup overhead (bencher -m GraphTopologicalSortModules --module-startup):
#table2#
+---------------------+------------------------------+--------------------+----------------+-----------+------------------------+------------+---------+---------+
| participant | proc_private_dirty_size (kB) | proc_rss_size (MB) | proc_size (MB) | time (ms) | mod_overhead_time (ms) | vs_slowest | errors | samples |
+---------------------+------------------------------+--------------------+----------------+-----------+------------------------+------------+---------+---------+
| Data::Graph::Util | 840 | 4.1 | 16 | 7.7 | 3.4 | 1 | 4.6e-05 | 20 |
| Sort::Topological | 972 | 4.4 | 16 | 7.6 | 3.3 | 1 | 3e-05 | 20 |
| perl -e1 (baseline) | 992 | 4.3 | 16 | 4.3 | 0 | 1.8 | 6.9e-06 | 20 |
+---------------------+------------------------------+--------------------+----------------+-----------+------------------------+------------+---------+---------+To display as an interactive HTML table on a browser, you can add option --format html+datatables.
HOMEPAGE
Please visit the project's homepage at https://metacpan.org/release/Bencher-Scenario-GraphTopologicalSortModules.
SOURCE
Source repository is at https://github.com/perlancar/perl-Bencher-Scenario-GraphTopologicalSortModules.
BUGS
Please report any bugs or feature requests on the bugtracker website https://rt.cpan.org/Public/Dist/Display.html?Name=Bencher-Scenario-GraphTopologicalSortModules
When submitting a bug or request, please include a test-file or a patch to an existing test-file that illustrates the bug or desired feature.
AUTHOR
perlancar <perlancar@cpan.org>
COPYRIGHT AND LICENSE
This software is copyright (c) 2017 by perlancar@cpan.org.
This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself.