|
ROSE 0.11.145.192
|
Work list with dependencies.
This class takes a graph of tasks. The vertices are the tasks that need to be worked on, and an edge from vertex a to vertex b means work on a depends on b having been completed. Vertices that participate in a cycle cannot be worked on since there is no way to resolve their dependencies; in this case, as much work as possible is performed.
See also, the workInParallel function which is less typing since template parameters are inferred.
Definition at line 32 of file ThreadWorkers.h.
#include <Sawyer/ThreadWorkers.h>
Public Member Functions | |
| ThreadWorkers () | |
| Default constructor. | |
| ThreadWorkers (const DependencyGraph &dependencies, size_t nWorkers, Functor functor) | |
| Constructor that synchronously runs the work. | |
| ~ThreadWorkers () | |
| Destructor. | |
| void | start (const DependencyGraph &dependencies, size_t nWorkers, Functor functor) |
| Start workers and return. | |
| void | wait () |
| Wait for work to complete. | |
| template<class Rep , class Period > | |
| bool | tryWaitFor (const boost::chrono::duration< Rep, Period > &relTime) |
| Wait for work to complete. | |
| void | run (const DependencyGraph &dependencies, size_t nWorkers, Functor functor) |
| Synchronously processes tasks. | |
| bool | isFinished () |
| Test whether all possible work is finished. | |
| size_t | nStarted () |
| Number of tasks that have started. | |
| size_t | nFinished () |
| Number of tasks that have completed. | |
| std::set< size_t > | runningTasks () |
| Tasks currently running. | |
| std::pair< size_t, size_t > | nWorkers () |
| Number of worker threads. | |
|
inline |
Default constructor.
This constructor initializes the object but does not start any worker threads. Each object can perform work a single time, which is done by calling run (synchronous) or start and wait (asynchronous).
Definition at line 52 of file ThreadWorkers.h.
|
inline |
Constructor that synchronously runs the work.
This constructor creates up to the specified number of worker threads to run the work described in the dependencies (at least one thread, but not more than the number of vertices in the graph). If nWorkers is zero then the system's hadware concurrency is used. If the dependency graph contains a cycle then as much work as possible is performed and then a ContainsCycle exception is thrown.
The dependency graph is copied into this class so that the class can modify it as tasks are completed. The functor can be a class with operator(), a function pointer, or a lambda expression. If a class is used, it must be copyable and each worker thread will be given its own copy. The functor is invoked with two arguments: the ID number of the task being processed, and a reference to a copy of the task (vertex value) in the dependency graph. The ID number is the vertex ID number in the dependencies graph.
The constructor does not return until all possible non-cyclic work has been completed. This object can only perform work a single time.
Definition at line 71 of file ThreadWorkers.h.
References Sawyer::ThreadWorkers< DependencyGraph, Functor >::nWorkers(), and Sawyer::ThreadWorkers< DependencyGraph, Functor >::run().
|
inline |
Destructor.
The destructor waits for all possible non-cyclic work to complete before returning.
Definition at line 85 of file ThreadWorkers.h.
References Sawyer::ThreadWorkers< DependencyGraph, Functor >::wait().
|
inline |
Start workers and return.
This method saves a copy of the dependencies, initializes a work list, and starts worker threads. The vertices of the dependency graph are the tasks to be performed by the workers and the edges represent dependencies between the tasks. An edge from vertex a to vertex b means that task a cannot start until work on task b has finished.
The tasks in dependencies are processed by up to nWorkers threads created by this method and destroyed when work is complete. This method creates at least one thread (if there's any work), but never more threads than the total amount of work. If nWorkers is zero then the system's hardware concurrency is used. It returns as soon as those workers are created.
Each object can perform work only a single time.
Definition at line 103 of file ThreadWorkers.h.
References Sawyer::ThreadWorkers< DependencyGraph, Functor >::nWorkers().
Referenced by Sawyer::ThreadWorkers< DependencyGraph, Functor >::run(), and Sawyer::workInParallel().
|
inline |
Wait for work to complete.
This call blocks until all possible non-cyclic work is completed. If no work has started yet then it returns immediately.
Definition at line 122 of file ThreadWorkers.h.
Referenced by Sawyer::ThreadWorkers< DependencyGraph, Functor >::~ThreadWorkers(), and Sawyer::ThreadWorkers< DependencyGraph, Functor >::run().
|
inline |
Wait for work to complete.
Waits for up to the specified amount of time for work to complete. Returns true if no work has been started, or all work has completed within the time period. Returns false if a timeout occurred while waiting for work to complete.
Definition at line 143 of file ThreadWorkers.h.
Referenced by Sawyer::workInParallel().
|
inline |
Synchronously processes tasks.
This is simply a wrapper around start and wait. It performs work synchronously, returning only after all possible work has completed. If the dependency graph contained cycles then a ContainsCycle exception is thrown after all possible non-cyclic work is finished.
Definition at line 168 of file ThreadWorkers.h.
References Sawyer::ThreadWorkers< DependencyGraph, Functor >::nWorkers(), Sawyer::ThreadWorkers< DependencyGraph, Functor >::start(), and Sawyer::ThreadWorkers< DependencyGraph, Functor >::wait().
Referenced by Sawyer::ThreadWorkers< DependencyGraph, Functor >::ThreadWorkers().
|
inline |
Test whether all possible work is finished.
Returns false if work is ongoing, true if all possible non-cyclic work is finished or no work was ever started.
Definition at line 176 of file ThreadWorkers.h.
|
inline |
Number of tasks that have started.
This is the number of tasks that have been started, some of which may have completed already. Although this function is thread-safe, the returned data might be out of date by time the caller accesses it.
Definition at line 185 of file ThreadWorkers.h.
|
inline |
Number of tasks that have completed.
Although this function is thread-safe, the returned data might be out of date by time the caller accesses it.
Definition at line 193 of file ThreadWorkers.h.
Referenced by Sawyer::workInParallel().
|
inline |
Tasks currently running.
Returns the set of tasks (dependency graph vertex IDs) that are currently running. Although this function is thread-safe, the returned data might be out of date by time the caller accesses it.
Definition at line 202 of file ThreadWorkers.h.
Referenced by Sawyer::workInParallel().
|
inline |
Number of worker threads.
Returns a pair of numbers. The first is the total number of worker threads that are allocated, and the second is the number of threads that are busy working. The second number will never be larger than the first.
Definition at line 211 of file ThreadWorkers.h.
Referenced by Sawyer::ThreadWorkers< DependencyGraph, Functor >::ThreadWorkers(), Sawyer::ThreadWorkers< DependencyGraph, Functor >::run(), and Sawyer::ThreadWorkers< DependencyGraph, Functor >::start().
1.9.8