/ 
Bencher-Scenario-GraphTopologicalSortModules-0.003
River stage one • 1 direct dependent • 1 total dependent
/ Bencher::Scenario::GraphTopologicalSortModules

NAME

Bencher::Scenario::GraphTopologicalSortModules - Benchmark graph topological sort modules

VERSION

This document describes version 0.003 of Bencher::Scenario::GraphTopologicalSortModules (from Perl distribution Bencher-Scenario-GraphTopologicalSortModules), released on 2017-04-03.

SYNOPSIS

To run benchmark with default option:

% bencher -m GraphTopologicalSortModules

To run module startup overhead benchmark:

% bencher --module-startup -m GraphTopologicalSortModules

For 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.

Algorithm::Dependency 1.110

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->{$_[0]} || [] } }, <unsorted>)

  • Data::Graph::Util::toposort (perl_code)

    Function call template:

    Data::Graph::Util::toposort(<graph>, <unsorted>)

  • Algorithm::Dependency (perl_code)

    Code template:

    my $deps = Algorithm::Dependency::Source::HoA->new(<graph>); my $dep = Algorithm::Dependency->new(source=>$deps); $dep->schedule_all

BENCHMARK DATASETS

  • g1

SAMPLE BENCHMARK RESULTS

Run on: perl: v5.24.0, CPU: Intel(R) Core(TM) i5-2400 CPU @ 3.10GHz (4 cores), OS: GNU/Linux Debian version 8.0, OS kernel: Linux version 3.16.0-4-amd64.

Benchmark with default options (bencher -m GraphTopologicalSortModules):

#table1#
+-----------------------------+-----------+-----------+------------+---------+---------+
| participant                 | rate (/s) | time (μs) | vs_slowest |  errors | samples |
+-----------------------------+-----------+-----------+------------+---------+---------+
| Algorithm::Dependency       |     16700 |      60   |       1    | 2.5e-08 |      23 |
| Sort::Topological::toposort |     16800 |      59.6 |       1.01 | 2.5e-08 |      23 |
| Data::Graph::Util::toposort |     58700 |      17   |       3.52 | 6.7e-09 |      20 |
+-----------------------------+-----------+-----------+------------+---------+---------+

Benchmark module startup overhead (bencher -m GraphTopologicalSortModules --module-startup):

#table2#
+-----------------------+------------------------------+--------------------+----------------+-----------+------------------------+------------+---------+---------+
| participant           | proc_private_dirty_size (MB) | proc_rss_size (MB) | proc_size (MB) | time (ms) | mod_overhead_time (ms) | vs_slowest |  errors | samples |
+-----------------------+------------------------------+--------------------+----------------+-----------+------------------------+------------+---------+---------+
| Algorithm::Dependency | 0.82                         | 4.1                | 20             |      16   |                   10.5 |        1   | 2.8e-05 |      20 |
| Sort::Topological     | 0.95                         | 4.4                | 20             |       9   |                    3.5 |        1.8 | 2.4e-05 |      20 |
| Data::Graph::Util     | 1.7                          | 5.2                | 25             |       8.7 |                    3.2 |        1.8 | 1.6e-05 |      20 |
| perl -e1 (baseline)   | 0.97                         | 4.4                | 20             |       5.5 |                    0   |        2.9 | 2.5e-05 |      24 |
+-----------------------+------------------------------+--------------------+----------------+-----------+------------------------+------------+---------+---------+

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, 2016 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.