This documentation is for a development version of IPython. There may be significant differences from the latest stable release.
The AsyncResult object¶
In non-blocking mode,
apply() submits the command to be executed and
then returns a
AsyncResult object immediately. The
AsyncResult object gives you a way of getting a result at a later
time through its
get() method, but it also collects metadata
Beyond multiprocessing’s AsyncResult¶
Our AsyncResult objects add a number of convenient features for working with parallel results, beyond what is provided by the original AsyncResult.
AsyncResult.get_dict(), which pulls results as a dictionary
keyed by engine_id, rather than a flat list. This is useful for quickly
coordinating or distributing information about all of the engines.
As an example, here is a quick call that gives every engine a dict showing the PID of every other engine:
In : ar = rc[:].apply_async(os.getpid) In : pids = ar.get_dict() In : rc[:]['pid_map'] = pids
This trick is particularly useful when setting up inter-engine communication,
as in IPython’s
ipyparallel tracks some metadata about the tasks, which is stored
Client.metadata dict. The AsyncResult object gives you an
interface for this information as well, including timestamps stdout/err,
and engine IDs.
IPython tracks various timestamps as
and the AsyncResult object has a few properties that turn these into useful
times (in seconds as floats).
For use while the tasks are still pending:
ar.elapsedis just the elapsed seconds since submission, for use before the AsyncResult is complete.
ar.progressis the number of tasks that have completed. Fractional progress would be:
1.0 * ar.progress / len(ar)
AsyncResult.wait_interactive()will wait for the result to finish, but print out status updates on progress and elapsed time while it waits.
For use after the tasks are done:
ar.serial_timeis the sum of the computation time of all of the tasks done in parallel.
ar.wall_timeis the time between the first task submitted and last result received. This is the actual cost of computation, including IPython overhead.
wall_time is only precise if the Client is waiting for results when
the task finished, because the received timestamp is made when the result is
unpacked by the Client, triggered by the
spin() call. If you
are doing work in the Client, and not waiting/spinning, then received might
be artificially high.
An often interesting metric is the time it actually cost to do the work in parallel relative to the serial computation, and this can be given simply with
speedup = ar.serial_time / ar.wall_time
Map results are iterable!¶
When an AsyncResult object has multiple results (e.g. the
object), you can actually iterate through results themselves, and act on them as they arrive:
from __future__ import print_function import time import ipyparallel as ipp # create client & view rc = ipp.Client() dv = rc[:] v = rc.load_balanced_view() # scatter 'id', so id=0,1,2 on engines 0,1,2 dv.scatter('id', rc.ids, flatten=True) print("Engine IDs: ", dv['id']) # create a Reference to `id`. This will be a different value on each engine ref = ipp.Reference('id') print("sleeping for `id` seconds on each engine") tic = time.time() ar = dv.apply(time.sleep, ref) for i,r in enumerate(ar): print("%i: %.3f"%(i, time.time()-tic)) def sleep_here(t): import time time.sleep(t) return id,t # one call per task print("running with one call per task") amr = v.map(sleep_here, [.01*t for t in range(100)]) tic = time.time() for i,r in enumerate(amr): print("task %i on engine %i: %.3f" % (i, r, time.time()-tic)) print("running with four calls per task") # with chunksize, we can have four calls per task amr = v.map(sleep_here, [.01*t for t in range(100)], chunksize=4) tic = time.time() for i,r in enumerate(amr): print("task %i on engine %i: %.3f" % (i, r, time.time()-tic)) print("running with two calls per task, with unordered results") # We can even iterate through faster results first, with ordered=False amr = v.map(sleep_here, [.01*t for t in range(100,0,-1)], ordered=False, chunksize=2) tic = time.time() for i,r in enumerate(amr): print("slept %.2fs on engine %i: %.3f" % (r, r, time.time()-tic))
That is to say, if you treat an AsyncMapResult as if it were a list of your actual results, it should behave as you would expect, with the only difference being that you can start iterating through the results before they have even been computed.
This lets you do a dumb version of map/reduce with the builtin Python functions, and the only difference between doing this locally and doing it remotely in parallel is using the asynchronous view.map instead of the builtin map.
Here is a simple one-line RMS (root-mean-square) implemented with Python’s builtin map/reduce.
In : X = np.linspace(0,100) In : from math import sqrt In : add = lambda a,b: a+b In : sq = lambda x: x*x In : sqrt(reduce(add, map(sq, X)) / len(X)) Out: 58.028845747399714 In : sqrt(reduce(add, view.map(sq, X)) / len(X)) Out: 58.028845747399714
To break that down:
map(sq, X)Compute the square of each element in the list (locally, or in parallel)
reduce(add, sqX) / len(X)compute the mean by summing over the list (or AsyncMapResult) and dividing by the size
- take the square root of the resulting number
When AsyncResult or the AsyncMapResult don’t provide what you need (for instance,
handling individual results as they arrive, but with metadata), you can always
just split the original result’s
msg_ids attribute, and handle them as you like.
For an example of this, see