view release on metacpan or  search on metacpan

README  view on Meta::CPAN

VERSION
    This document describes version 0.001 of
    Acme::CPANModules::OrderingAndRunningTasks (from Perl distribution
    Acme-CPANModules-OrderingAndRunningTasks), released on 2023-12-20.

DESCRIPTION
    This list reviews what tools are available on CPAN and in general to
    order multiple tasks (with possible interdependency) and running them
    (possibly in parallel).

    To specify dependency, you can use a graph then do a topological sort on
    it. This will make sure that a task that depends on another is executed
    after the latter. This will also check circular dependencies: if there
    is a circular dependency, the graph becomes cyclical and will fail to
    sort topologically. There are several modules to do topological sorting,
    among them: Graph, Data::Graph::Util, Sort::Topological. There's also
    Algorithm::Dependency.

    To run tasks in parallel, you can also represent the tasks and
    dependencies among them using a graph, then separate the connected
    subgraphs. The subgraphs do not connect to one another and thus you can
    run the tasks in a subgraph in parallel with tasks in another subgraph.
    These modules can search and return connected subgraphs: Graph
    ("connected_components" method), Data::Graph::Util
    ("connected_components" function).

lib/Acme/CPANModules/OrderingAndRunningTasks.pm  view on Meta::CPAN

our $VERSION = '0.001'; # VERSION

our $LIST = {
    summary => 'List of modules/tools to order multiple tasks (with possible interdependency) and running them (possibly in parallel)',
    description => <<'_',

This list reviews what tools are available on CPAN and in general to order
multiple tasks (with possible interdependency) and running them (possibly in
parallel).

To specify dependency, you can use a graph then do a topological sort on it.
This will make sure that a task that depends on another is executed after the
latter. This will also check circular dependencies: if there is a circular
dependency, the graph becomes cyclical and will fail to sort topologically.
There are several modules to do topological sorting, among them: <pm:Graph>,
<pm:Data::Graph::Util>, <pm:Sort::Topological>. There's also
<pm:Algorithm::Dependency>.

To run tasks in parallel, you can also represent the tasks and dependencies
among them using a graph, then separate the connected subgraphs. The subgraphs
do not connect to one another and thus you can run the tasks in a subgraph in
parallel with tasks in another subgraph. These modules can search and return
connected subgraphs: <pm:Graph> (`connected_components` method),
<pm:Data::Graph::Util> (`connected_components` function).

Keyword: dependency ordering, parallel execution

lib/Acme/CPANModules/OrderingAndRunningTasks.pm  view on Meta::CPAN

=head1 VERSION

This document describes version 0.001 of Acme::CPANModules::OrderingAndRunningTasks (from Perl distribution Acme-CPANModules-OrderingAndRunningTasks), released on 2023-12-20.

=head1 DESCRIPTION

This list reviews what tools are available on CPAN and in general to order
multiple tasks (with possible interdependency) and running them (possibly in
parallel).

To specify dependency, you can use a graph then do a topological sort on it.
This will make sure that a task that depends on another is executed after the
latter. This will also check circular dependencies: if there is a circular
dependency, the graph becomes cyclical and will fail to sort topologically.
There are several modules to do topological sorting, among them: L<Graph>,
L<Data::Graph::Util>, L<Sort::Topological>. There's also
L<Algorithm::Dependency>.

To run tasks in parallel, you can also represent the tasks and dependencies
among them using a graph, then separate the connected subgraphs. The subgraphs
do not connect to one another and thus you can run the tasks in a subgraph in
parallel with tasks in another subgraph. These modules can search and return
connected subgraphs: L<Graph> (C<connected_components> method),
L<Data::Graph::Util> (C<connected_components> function).

Keyword: dependency ordering, parallel execution