fceabee18f
Propose a new graph flow that will run every task in the graph at the same time but will use a count down latch concept to ensure that a tasks dependents are provided before the task itself can run. This allows for tasks to run in parallel (if they have no dependents or are placed in disjoint parts of graph). Note: although this flow uses threads it is typically expected that the underlying threads would be greenthreads since python native threading is still suboptimal (for various reasons). Implements: blueprint locally-run-many-at-once Change-Id: If434abd77758aa12fc99da395a2559995305a853
18 lines
472 B
Plaintext
18 lines
472 B
Plaintext
# Packages needed for using this library.
|
|
anyjson>=0.2.4
|
|
eventlet>=0.9.17
|
|
iso8601
|
|
netaddr>=0.7.6
|
|
# Need currently the newest version of oslo.config for the DeprecatedOpt
|
|
# used inside oslo database layer.
|
|
-f http://tarballs.openstack.org/oslo.config/oslo.config-1.2.0a3.tar.gz#egg=oslo.config-1.2.0a3
|
|
oslo.config>=1.2.0a3
|
|
six
|
|
# Only needed if database backend used.
|
|
sqlalchemy>=0.7,<=0.7.99
|
|
alembic>=0.4.1
|
|
# Very nice graph library
|
|
networkx>=1.8.1
|
|
threading2
|
|
Babel>=0.9.6
|