Rewrap according to PEP standards; indent documentation for API elements for better clarity.

This commit is contained in:
Georg Brandl 2010-05-01 09:58:11 +00:00
parent ebeb712eea
commit 45d710b6d5
1 changed files with 196 additions and 182 deletions

View File

@ -14,20 +14,20 @@ Post-History:
Abstract
========
This PEP proposes a design for a package that facilitates the evaluation of
callables using threads and processes.
This PEP proposes a design for a package that facilitates the
evaluation of callables using threads and processes.
==========
Motivation
==========
Python currently has powerful primitives to construct multi-threaded and
multi-process applications but parallelizing simple operations requires a lot of
work i.e. explicitly launching processes/threads, constructing a work/results
queue, and waiting for completion or some other termination condition (e.g.
failure, timeout). It is also difficult to design an application with a global
process/thread limit when each component invents its own parallel execution
strategy.
Python currently has powerful primitives to construct multi-threaded
and multi-process applications but parallelizing simple operations
requires a lot of work i.e. explicitly launching processes/threads,
constructing a work/results queue, and waiting for completion or some
other termination condition (e.g. failure, timeout). It is also
difficult to design an application with a global process/thread limit
when each component invents its own parallel execution strategy.
=============
Specification
@ -95,10 +95,10 @@ Web Crawl Example
Interface
---------
The proposed package provides two core classes: `Executor` and `Future`.
An `Executor` receives asynchronous work requests (in terms of a callable and
its arguments) and returns a `Future` to represent the execution of that
work request.
The proposed package provides two core classes: `Executor` and
`Future`. An `Executor` receives asynchronous work requests (in terms
of a callable and its arguments) and returns a `Future` to represent
the execution of that work request.
Executor
''''''''
@ -106,68 +106,70 @@ Executor
`Executor` is an abstract class that provides methods to execute calls
asynchronously.
`submit(fn, *args, **kwargs)`
``submit(fn, *args, **kwargs)``
Schedules the callable to be executed as fn(*\*args*, *\*\*kwargs*) and returns
a `Future` instance representing the execution of the function.
Schedules the callable to be executed as ``fn(*args, **kwargs)``
and returns a `Future` instance representing the execution of the
function.
This is an abstract method and must be implemented by Executor subclasses.
This is an abstract method and must be implemented by Executor
subclasses.
`map(func, *iterables, timeout=None)`
``map(func, *iterables, timeout=None)``
Equivalent to map(*func*, *\*iterables*) but executed asynchronously and
possibly out-of-order. The returned iterator raises a `TimeoutError` if
`__next__()` is called and the result isn't available after *timeout* seconds
from the original call to `map()`. If *timeout* is not specified or
``None`` then there is no limit to the wait time. If a call raises an exception
then that exception will be raised when its value is retrieved from the
iterator.
Equivalent to ``map(func, *iterables)`` but executed
asynchronously and possibly out-of-order. The returned iterator
raises a `TimeoutError` if `__next__()` is called and the result
isn't available after *timeout* seconds from the original call to
`map()`. If *timeout* is not specified or `None` then there is no
limit to the wait time. If a call raises an exception then that
exception will be raised when its value is retrieved from the
iterator.
`shutdown(wait=True)`
``shutdown(wait=True)``
Signal the executor that it should free any resources that it is using when
the currently pending futures are done executing. Calls to
`Executor.submit` and `Executor.map` and made after shutdown will raise
`RuntimeError`.
Signal the executor that it should free any resources that it is
using when the currently pending futures are done executing.
Calls to `Executor.submit` and `Executor.map` and made after
shutdown will raise `RuntimeError`.
If wait is `True` then the executor will not return until all the
pending futures are done executing and the resources associated
with the executor have been freed.
If wait is `True` then the executor will not return until all the pending
futures are done executing and the resources associated with the executor
have been freed.
| ``__enter__()``
| ``__exit__(exc_type, exc_val, exc_tb)``
`__enter__()`
`__exit__(exc_type, exc_val, exc_tb)`
When using an executor as a context manager, `__exit__` will call
`Executor.shutdown(wait=True)`.
When using an executor as a context manager, `__exit__` will call
``Executor.shutdown(wait=True)``.
ProcessPoolExecutor
'''''''''''''''''''
The `ProcessPoolExecutor` class is an `Executor` subclass that uses a pool of
processes to execute calls asynchronously. The callable objects and arguments
passed to `ProcessPoolExecutor.submit` must be serializeable according to the
same limitations as the multiprocessing module.
The `ProcessPoolExecutor` class is an `Executor` subclass that uses a
pool of processes to execute calls asynchronously. The callable
objects and arguments passed to `ProcessPoolExecutor.submit` must be
serializeable according to the same limitations as the multiprocessing
module.
Calling `Executor` or `Future` methods from within a callable submitted to a
`ProcessPoolExecutor` will result in deadlock.
Calling `Executor` or `Future` methods from within a callable
submitted to a `ProcessPoolExecutor` will result in deadlock.
`__init__(max_workers)`
``__init__(max_workers)``
Executes calls asynchronously using a pool of a most *max_workers*
processes. If *max_workers* is ``None`` or not given then as many worker
processes will be created as the machine has processors.
Executes calls asynchronously using a pool of a most *max_workers*
processes. If *max_workers* is ``None`` or not given then as many
worker processes will be created as the machine has processors.
ThreadPoolExecutor
''''''''''''''''''
The `ThreadPoolExecutor` class is an `Executor` subclass that uses a pool of
threads to execute calls asynchronously.
The `ThreadPoolExecutor` class is an `Executor` subclass that uses a
pool of threads to execute calls asynchronously.
Deadlock can occur when the callable associated with a `Future` waits on
the results of another `Future`. For example:
::
Deadlock can occur when the callable associated with a `Future` waits
on the results of another `Future`. For example::
import time
def wait_on_b():
@ -185,9 +187,7 @@ the results of another `Future`. For example:
a = executor.submit(wait_on_b)
b = executor.submit(wait_on_a)
And:
::
And::
def wait_on_future():
f = executor.submit(pow, 5, 2)
@ -198,186 +198,200 @@ And:
executor = ThreadPoolExecutor(max_workers=1)
executor.submit(wait_on_future)
`__init__(max_workers)`
``__init__(max_workers)``
Executes calls asynchronously using a pool of at most *max_workers* threads.
Executes calls asynchronously using a pool of at most
*max_workers* threads.
Future Objects
''''''''''''''
The `Future` class encapsulates the asynchronous execution of a function
or method call. `Future` instances are returned by `Executor.submit`.
The `Future` class encapsulates the asynchronous execution of a
function or method call. `Future` instances are returned by
`Executor.submit`.
`cancel()`
``cancel()``
Attempt to cancel the call. If the call is currently being executed then
it cannot be cancelled and the method will return `False`, otherwise the call
will be cancelled and the method will return `True`.
Attempt to cancel the call. If the call is currently being
executed then it cannot be cancelled and the method will return
`False`, otherwise the call will be cancelled and the method will
return `True`.
`cancelled()`
``cancelled()``
Return `True` if the call was successfully cancelled.
Return `True` if the call was successfully cancelled.
`running()`
``running()``
Return `True` if the call is currently being executed and cannot be cancelled.
Return `True` if the call is currently being executed and cannot
be cancelled.
`done()`
``done()``
Return `True` if the call was successfully cancelled or finished running.
Return `True` if the call was successfully cancelled or finished
running.
`result(timeout=None)`
``result(timeout=None)``
Return the value returned by the call. If the call hasn't yet completed then
this method will wait up to *timeout* seconds. If the call hasn't completed
in *timeout* seconds then a `TimeoutError` will be raised. If *timeout*
is not specified or ``None`` then there is no limit to the wait time.
Return the value returned by the call. If the call hasn't yet
completed then this method will wait up to *timeout* seconds. If
the call hasn't completed in *timeout* seconds then a
`TimeoutError` will be raised. If *timeout* is not specified or
`None` then there is no limit to the wait time.
If the future is cancelled before completing then `CancelledError`
will be raised.
If the call raised then this method will raise the same exception.
If the future is cancelled before completing then `CancelledError` will
be raised.
``exception(timeout=None)``
If the call raised then this method will raise the same exception.
Return the exception raised by the call. If the call hasn't yet
completed then this method will wait up to *timeout* seconds. If
the call hasn't completed in *timeout* seconds then a
`TimeoutError` will be raised. If *timeout* is not specified or
``None`` then there is no limit to the wait time.
If the future is cancelled before completing then `CancelledError`
will be raised.
If the call completed without raising then `None` is returned.
`exception(timeout=None)`
``add_done_callback(fn)``
Return the exception raised by the call. If the call hasn't yet completed
then this method will wait up to *timeout* seconds. If the call hasn't
completed in *timeout* seconds then a `TimeoutError` will be raised.
If *timeout* is not specified or ``None`` then there is no limit to the wait
time.
Attaches a function *fn* to the future that will be called when
the future is cancelled or finishes running. *fn* will be called
with the future as its only argument.
If the future has already completed or been cancelled then *fn*
will be called immediately. If the same function is added several
times then it will still only be called once.
NOTE: This method can be used to create adapters from Futures to
Twisted Deferreds.
If the future is cancelled before completing then `CancelledError` will
be raised.
``remove_done_callback(fn)``
If the call completed without raising then ``None`` is returned.
`add_done_callback(fn)`
Attaches a function *fn* to the future that will be called when the future is
cancelled or finishes running. *fn* will be called with the future as its only
argument.
If the future has already completed or been cancelled then *fn* will be called
immediately. If the same function is added several times then it will still only
be called once.
NOTE: This method can be used to create adapters from Futures to Twisted
Deferreds.
`remove_done_callback(fn)`
Removes the function *fn*, which was previously attached to the future using
`add_done_callback`. `KeyError` is raised if the function was not previously
attached.
Removes the function *fn*, which was previously attached to the
future using `add_done_callback`. `KeyError` is raised if the
function was not previously attached.
Internal Future Methods
^^^^^^^^^^^^^^^^^^^^^^^
The following `Future` methods are meant for use in unit tests and `Executor`
implementations.
The following `Future` methods are meant for use in unit tests and
`Executor` implementations.
`set_running_or_notify_cancel()`
``set_running_or_notify_cancel()``
Should be called by `Executor` implementations before executing the work
associated with the `Future`.
Should be called by `Executor` implementations before executing
the work associated with the `Future`.
If the method returns `False` then the `Future` was cancelled,
i.e. `Future.cancel` was called and returned `True`. Any threads
waiting on the `Future` completing (i.e. through `as_completed()`
or `wait()`) will be woken up.
If the method returns `True` then the `Future` was not cancelled
and has been put in the running state, i.e. calls to
`Future.running()` will return `True`.
This method can only be called once and cannot be called after
`Future.set_result()` or `Future.set_exception()` have been
called.
If the method returns `False` then the `Future` was cancelled i.e.
`Future.cancel` was called and returned `True`. Any threads waiting on the
`Future` completing (i.e. through `as_completed()` or `wait()`) will be woken
up.
``set_result(result)``
If the method returns `True` then the `Future` was not cancelled and has been
put in the running state i.e. calls to `Future.running()` will return `True`.
Sets the result of the work associated with the `Future`.
This method can only be called once and cannot be called after
`Future.set_result()` or `Future.set_exception()` have been called.
``set_exception(exception)``
`set_result(result)`
Sets the result of the work associated with the `Future`.
`set_exception(exception)`
Sets the result of the work associated with the `Future` to the given
`Exception`.
Sets the result of the work associated with the `Future` to the
given `Exception`.
Module Functions
''''''''''''''''
`wait(fs, timeout=None, return_when=ALL_COMPLETED)`
``wait(fs, timeout=None, return_when=ALL_COMPLETED)``
Wait for the `Future` instances given by *fs* to complete. Returns a named
2-tuple of sets. The first set, named "finished", contains the futures that
completed (finished or were cancelled) before the wait completed. The second
set, named "not_finished", contains uncompleted futures.
Wait for the `Future` instances given by *fs* to complete.
Returns a named 2-tuple of sets. The first set, named "finished",
contains the futures that completed (finished or were cancelled)
before the wait completed. The second set, named "not_finished",
contains uncompleted futures.
*timeout* can be used to control the maximum number of seconds to
wait before returning. If timeout is not specified or None then
there is no limit to the wait time.
*return_when* indicates when the method should return. It must be
one of the following constants:
============================= ==================================================
Constant Description
============================= ==================================================
`FIRST_COMPLETED` The method will return when any future finishes or
is cancelled.
`FIRST_EXCEPTION` The method will return when any future finishes by
raising an exception. If not future raises an
exception then it is equivalent to ALL_COMPLETED.
`ALL_COMPLETED` The method will return when all calls finish.
============================= ==================================================
*timeout* can be used to control the maximum number of seconds to wait before
returning. If timeout is not specified or None then there is no limit to the
wait time.
``as_completed(fs, timeout=None)``
*return_when* indicates when the method should return. It must be one of the
following constants:
============================= ==================================================
Constant Description
============================= ==================================================
`FIRST_COMPLETED` The method will return when any future finishes or
is cancelled.
`FIRST_EXCEPTION` The method will return when any future finishes by
raising an exception. If not future raises an
exception then it is equivalent to ALL_COMPLETED.
`ALL_COMPLETED` The method will return when all calls finish.
============================= ==================================================
`as_completed(fs, timeout=None)`
Returns an iterator over the `Future` instances given by *fs* that yields
futures as they complete (finished or were cancelled). Any futures that
completed before `as_completed()` was called will be yielded first. The returned
iterator raises a `TimeoutError` if `__next__()` is called and the result isn't
available after *timeout* seconds from the original call to `as_completed()`. If
*timeout* is not specified or `None` then there is no limit to the wait time.
Returns an iterator over the `Future` instances given by *fs* that
yields futures as they complete (finished or were cancelled). Any
futures that completed before `as_completed()` was called will be
yielded first. The returned iterator raises a `TimeoutError` if
`__next__()` is called and the result isn't available after
*timeout* seconds from the original call to `as_completed()`. If
*timeout* is not specified or `None` then there is no limit to the
wait time.
=========
Rationale
=========
The proposed design of this module was heavily influenced by the the Java
java.util.concurrent package [1]_. The conceptual basis of the module, as in
Java, is the Future class, which represents the progress and result of an
asynchronous computation. The Future class makes little commitment to the
evaluation mode being used e.g. it can be be used to represent lazy or eager
evaluation, for evaluation using threads, processes or remote procedure call.
The proposed design of this module was heavily influenced by the the
Java java.util.concurrent package [1]_. The conceptual basis of the
module, as in Java, is the Future class, which represents the progress
and result of an asynchronous computation. The Future class makes
little commitment to the evaluation mode being used e.g. it can be be
used to represent lazy or eager evaluation, for evaluation using
threads, processes or remote procedure call.
Futures are created by concrete implementations of the Executor class
(called ExecutorService in Java). The reference implementation provides
classes that use either a process a thread pool to eagerly evaluate
computations.
(called ExecutorService in Java). The reference implementation
provides classes that use either a process a thread pool to eagerly
evaluate computations.
Futures have already been seen in Python as part of a popular Python
cookbook recipe [2]_ and have discussed on the Python-3000 mailing list [3]_.
cookbook recipe [2]_ and have discussed on the Python-3000 mailing
list [3]_.
The proposed design is explicit i.e. it requires that clients be aware that
they are consuming Futures. It would be possible to design a module that
would return proxy objects (in the style of `weakref`) that could be used
transparently. It is possible to build a proxy implementation on top of
the proposed explicit mechanism.
The proposed design is explicit, i.e. it requires that clients be
aware that they are consuming Futures. It would be possible to design
a module that would return proxy objects (in the style of `weakref`)
that could be used transparently. It is possible to build a proxy
implementation on top of the proposed explicit mechanism.
The proposed design does not introduce any changes to Python language syntax
or semantics. Special syntax could be introduced [4]_ to mark function and
method calls as asynchronous. A proxy result would be returned while the
operation is eagerly evaluated asynchronously, and execution would only
block if the proxy object were used before the operation completed.
The proposed design does not introduce any changes to Python language
syntax or semantics. Special syntax could be introduced [4]_ to mark
function and method calls as asynchronous. A proxy result would be
returned while the operation is eagerly evaluated asynchronously, and
execution would only block if the proxy object were used before the
operation completed.
Anh Hai Trinh proposed a simpler but more limited API concept [5]_ and the API
has been discussed in some detail on stdlib-sig [6]_.
Anh Hai Trinh proposed a simpler but more limited API concept [5]_ and
the API has been discussed in some detail on stdlib-sig [6]_.
========================
Reference Implementation
========================
The reference implementation [7]_ contains a complete implementation of the
proposed design. It has been tested on Linux and Mac OS X.
The reference implementation [7]_ contains a complete implementation
of the proposed design. It has been tested on Linux and Mac OS X.
==========
References