1 :mod:`multiprocessing` --- Process-based "threading" interface
2 ==============================================================
4 .. module:: multiprocessing
5 :synopsis: Process-based "threading" interface.
11 ----------------------
13 :mod:`multiprocessing` is a package that supports spawning processes using an
14 API similar to the :mod:`threading` module. The :mod:`multiprocessing` package
15 offers both local and remote concurrency, effectively side-stepping the
16 :term:`Global Interpreter Lock` by using subprocesses instead of threads. Due
17 to this, the :mod:`multiprocessing` module allows the programmer to fully
18 leverage multiple processors on a given machine. It runs on both Unix and
23 Some of this package's functionality requires a functioning shared semaphore
24 implementation on the host operating system. Without one, the
25 :mod:`multiprocessing.synchronize` module will be disabled, and attempts to
26 import it will result in an :exc:`ImportError`. See
27 :issue:`3770` for additional information.
31 Functionality within this package requires that the ``__main__`` method be
32 importable by the children. This is covered in :ref:`multiprocessing-programming`
33 however it is worth pointing out here. This means that some examples, such
34 as the :class:`multiprocessing.Pool` examples will not work in the
35 interactive interpreter. For example::
37 >>> from multiprocessing import Pool
46 Traceback (most recent call last):
47 Traceback (most recent call last):
48 Traceback (most recent call last):
49 AttributeError: 'module' object has no attribute 'f'
50 AttributeError: 'module' object has no attribute 'f'
51 AttributeError: 'module' object has no attribute 'f'
53 (If you try this it will actually output three full tracebacks
54 interleaved in a semi-random fashion, and then you may have to
55 stop the master process somehow.)
58 The :class:`Process` class
59 ~~~~~~~~~~~~~~~~~~~~~~~~~~
61 In :mod:`multiprocessing`, processes are spawned by creating a :class:`Process`
62 object and then calling its :meth:`~Process.start` method. :class:`Process`
63 follows the API of :class:`threading.Thread`. A trivial example of a
64 multiprocess program is ::
66 from multiprocessing import Process
71 if __name__ == '__main__':
72 p = Process(target=f, args=('bob',))
76 To show the individual process IDs involved, here is an expanded example::
78 from multiprocessing import Process
83 print 'module name:', __name__
84 print 'parent process:', os.getppid()
85 print 'process id:', os.getpid()
91 if __name__ == '__main__':
93 p = Process(target=f, args=('bob',))
97 For an explanation of why (on Windows) the ``if __name__ == '__main__'`` part is
98 necessary, see :ref:`multiprocessing-programming`.
102 Exchanging objects between processes
103 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
105 :mod:`multiprocessing` supports two types of communication channel between
110 The :class:`Queue` class is a near clone of :class:`Queue.Queue`. For
113 from multiprocessing import Process, Queue
116 q.put([42, None, 'hello'])
118 if __name__ == '__main__':
120 p = Process(target=f, args=(q,))
122 print q.get() # prints "[42, None, 'hello']"
125 Queues are thread and process safe.
129 The :func:`Pipe` function returns a pair of connection objects connected by a
130 pipe which by default is duplex (two-way). For example::
132 from multiprocessing import Process, Pipe
135 conn.send([42, None, 'hello'])
138 if __name__ == '__main__':
139 parent_conn, child_conn = Pipe()
140 p = Process(target=f, args=(child_conn,))
142 print parent_conn.recv() # prints "[42, None, 'hello']"
145 The two connection objects returned by :func:`Pipe` represent the two ends of
146 the pipe. Each connection object has :meth:`~Connection.send` and
147 :meth:`~Connection.recv` methods (among others). Note that data in a pipe
148 may become corrupted if two processes (or threads) try to read from or write
149 to the *same* end of the pipe at the same time. Of course there is no risk
150 of corruption from processes using different ends of the pipe at the same
154 Synchronization between processes
155 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
157 :mod:`multiprocessing` contains equivalents of all the synchronization
158 primitives from :mod:`threading`. For instance one can use a lock to ensure
159 that only one process prints to standard output at a time::
161 from multiprocessing import Process, Lock
165 print 'hello world', i
168 if __name__ == '__main__':
171 for num in range(10):
172 Process(target=f, args=(lock, num)).start()
174 Without using the lock output from the different processes is liable to get all
178 Sharing state between processes
179 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
181 As mentioned above, when doing concurrent programming it is usually best to
182 avoid using shared state as far as possible. This is particularly true when
183 using multiple processes.
185 However, if you really do need to use some shared data then
186 :mod:`multiprocessing` provides a couple of ways of doing so.
190 Data can be stored in a shared memory map using :class:`Value` or
191 :class:`Array`. For example, the following code ::
193 from multiprocessing import Process, Value, Array
197 for i in range(len(a)):
200 if __name__ == '__main__':
201 num = Value('d', 0.0)
202 arr = Array('i', range(10))
204 p = Process(target=f, args=(num, arr))
214 [0, -1, -2, -3, -4, -5, -6, -7, -8, -9]
216 The ``'d'`` and ``'i'`` arguments used when creating ``num`` and ``arr`` are
217 typecodes of the kind used by the :mod:`array` module: ``'d'`` indicates a
218 double precision float and ``'i'`` indicates a signed integer. These shared
219 objects will be process and thread safe.
221 For more flexibility in using shared memory one can use the
222 :mod:`multiprocessing.sharedctypes` module which supports the creation of
223 arbitrary ctypes objects allocated from shared memory.
227 A manager object returned by :func:`Manager` controls a server process which
228 holds Python objects and allows other processes to manipulate them using
231 A manager returned by :func:`Manager` will support types :class:`list`,
232 :class:`dict`, :class:`Namespace`, :class:`Lock`, :class:`RLock`,
233 :class:`Semaphore`, :class:`BoundedSemaphore`, :class:`Condition`,
234 :class:`Event`, :class:`Queue`, :class:`Value` and :class:`Array`. For
237 from multiprocessing import Process, Manager
245 if __name__ == '__main__':
249 l = manager.list(range(10))
251 p = Process(target=f, args=(d, l))
260 {0.25: None, 1: '1', '2': 2}
261 [9, 8, 7, 6, 5, 4, 3, 2, 1, 0]
263 Server process managers are more flexible than using shared memory objects
264 because they can be made to support arbitrary object types. Also, a single
265 manager can be shared by processes on different computers over a network.
266 They are, however, slower than using shared memory.
269 Using a pool of workers
270 ~~~~~~~~~~~~~~~~~~~~~~~
272 The :class:`~multiprocessing.pool.Pool` class represents a pool of worker
273 processes. It has methods which allows tasks to be offloaded to the worker
274 processes in a few different ways.
278 from multiprocessing import Pool
283 if __name__ == '__main__':
284 pool = Pool(processes=4) # start 4 worker processes
285 result = pool.apply_async(f, [10]) # evaluate "f(10)" asynchronously
286 print result.get(timeout=1) # prints "100" unless your computer is *very* slow
287 print pool.map(f, range(10)) # prints "[0, 1, 4,..., 81]"
293 The :mod:`multiprocessing` package mostly replicates the API of the
294 :mod:`threading` module.
297 :class:`Process` and exceptions
298 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 .. class:: Process([group[, target[, name[, args[, kwargs]]]]])
302 Process objects represent activity that is run in a separate process. The
303 :class:`Process` class has equivalents of all the methods of
304 :class:`threading.Thread`.
306 The constructor should always be called with keyword arguments. *group*
307 should always be ``None``; it exists solely for compatibility with
308 :class:`threading.Thread`. *target* is the callable object to be invoked by
309 the :meth:`run()` method. It defaults to ``None``, meaning nothing is
310 called. *name* is the process name. By default, a unique name is constructed
311 of the form 'Process-N\ :sub:`1`:N\ :sub:`2`:...:N\ :sub:`k`' where N\
312 :sub:`1`,N\ :sub:`2`,...,N\ :sub:`k` is a sequence of integers whose length
313 is determined by the *generation* of the process. *args* is the argument
314 tuple for the target invocation. *kwargs* is a dictionary of keyword
315 arguments for the target invocation. By default, no arguments are passed to
318 If a subclass overrides the constructor, it must make sure it invokes the
319 base class constructor (:meth:`Process.__init__`) before doing anything else
324 Method representing the process's activity.
326 You may override this method in a subclass. The standard :meth:`run`
327 method invokes the callable object passed to the object's constructor as
328 the target argument, if any, with sequential and keyword arguments taken
329 from the *args* and *kwargs* arguments, respectively.
333 Start the process's activity.
335 This must be called at most once per process object. It arranges for the
336 object's :meth:`run` method to be invoked in a separate process.
338 .. method:: join([timeout])
340 Block the calling thread until the process whose :meth:`join` method is
341 called terminates or until the optional timeout occurs.
343 If *timeout* is ``None`` then there is no timeout.
345 A process can be joined many times.
347 A process cannot join itself because this would cause a deadlock. It is
348 an error to attempt to join a process before it has been started.
354 The name is a string used for identification purposes only. It has no
355 semantics. Multiple processes may be given the same name. The initial
356 name is set by the constructor.
360 Return whether the process is alive.
362 Roughly, a process object is alive from the moment the :meth:`start`
363 method returns until the child process terminates.
365 .. attribute:: daemon
367 The process's daemon flag, a Boolean value. This must be set before
368 :meth:`start` is called.
370 The initial value is inherited from the creating process.
372 When a process exits, it attempts to terminate all of its daemonic child
375 Note that a daemonic process is not allowed to create child processes.
376 Otherwise a daemonic process would leave its children orphaned if it gets
377 terminated when its parent process exits.
379 In addition to the :class:`Threading.Thread` API, :class:`Process` objects
380 also support the following attributes and methods:
384 Return the process ID. Before the process is spawned, this will be
387 .. attribute:: exitcode
389 The child's exit code. This will be ``None`` if the process has not yet
390 terminated. A negative value *-N* indicates that the child was terminated
393 .. attribute:: authkey
395 The process's authentication key (a byte string).
397 When :mod:`multiprocessing` is initialized the main process is assigned a
398 random string using :func:`os.random`.
400 When a :class:`Process` object is created, it will inherit the
401 authentication key of its parent process, although this may be changed by
402 setting :attr:`authkey` to another byte string.
404 See :ref:`multiprocessing-auth-keys`.
406 .. method:: terminate()
408 Terminate the process. On Unix this is done using the ``SIGTERM`` signal;
409 on Windows :cfunc:`TerminateProcess` is used. Note that exit handlers and
410 finally clauses, etc., will not be executed.
412 Note that descendant processes of the process will *not* be terminated --
413 they will simply become orphaned.
417 If this method is used when the associated process is using a pipe or
418 queue then the pipe or queue is liable to become corrupted and may
419 become unusable by other process. Similarly, if the process has
420 acquired a lock or semaphore etc. then terminating it is liable to
421 cause other processes to deadlock.
423 Note that the :meth:`start`, :meth:`join`, :meth:`is_alive` and
424 :attr:`exit_code` methods should only be called by the process that created
427 Example usage of some of the methods of :class:`Process`:
431 >>> import multiprocessing, time, signal
432 >>> p = multiprocessing.Process(target=time.sleep, args=(1000,))
433 >>> print p, p.is_alive()
434 <Process(Process-1, initial)> False
436 >>> print p, p.is_alive()
437 <Process(Process-1, started)> True
440 >>> print p, p.is_alive()
441 <Process(Process-1, stopped[SIGTERM])> False
442 >>> p.exitcode == -signal.SIGTERM
446 .. exception:: BufferTooShort
448 Exception raised by :meth:`Connection.recv_bytes_into()` when the supplied
449 buffer object is too small for the message read.
451 If ``e`` is an instance of :exc:`BufferTooShort` then ``e.args[0]`` will give
452 the message as a byte string.
458 When using multiple processes, one generally uses message passing for
459 communication between processes and avoids having to use any synchronization
460 primitives like locks.
462 For passing messages one can use :func:`Pipe` (for a connection between two
463 processes) or a queue (which allows multiple producers and consumers).
465 The :class:`Queue` and :class:`JoinableQueue` types are multi-producer,
466 multi-consumer FIFO queues modelled on the :class:`Queue.Queue` class in the
467 standard library. They differ in that :class:`Queue` lacks the
468 :meth:`~Queue.Queue.task_done` and :meth:`~Queue.Queue.join` methods introduced
469 into Python 2.5's :class:`Queue.Queue` class.
471 If you use :class:`JoinableQueue` then you **must** call
472 :meth:`JoinableQueue.task_done` for each task removed from the queue or else the
473 semaphore used to count the number of unfinished tasks may eventually overflow
474 raising an exception.
476 Note that one can also create a shared queue by using a manager object -- see
477 :ref:`multiprocessing-managers`.
481 :mod:`multiprocessing` uses the usual :exc:`Queue.Empty` and
482 :exc:`Queue.Full` exceptions to signal a timeout. They are not available in
483 the :mod:`multiprocessing` namespace so you need to import them from
489 If a process is killed using :meth:`Process.terminate` or :func:`os.kill`
490 while it is trying to use a :class:`Queue`, then the data in the queue is
491 likely to become corrupted. This may cause any other processes to get an
492 exception when it tries to use the queue later on.
496 As mentioned above, if a child process has put items on a queue (and it has
497 not used :meth:`JoinableQueue.cancel_join_thread`), then that process will
498 not terminate until all buffered items have been flushed to the pipe.
500 This means that if you try joining that process you may get a deadlock unless
501 you are sure that all items which have been put on the queue have been
502 consumed. Similarly, if the child process is non-daemonic then the parent
503 process may hang on exit when it tries to join all its non-daemonic children.
505 Note that a queue created using a manager does not have this issue. See
506 :ref:`multiprocessing-programming`.
508 For an example of the usage of queues for interprocess communication see
509 :ref:`multiprocessing-examples`.
512 .. function:: Pipe([duplex])
514 Returns a pair ``(conn1, conn2)`` of :class:`Connection` objects representing
517 If *duplex* is ``True`` (the default) then the pipe is bidirectional. If
518 *duplex* is ``False`` then the pipe is unidirectional: ``conn1`` can only be
519 used for receiving messages and ``conn2`` can only be used for sending
523 .. class:: Queue([maxsize])
525 Returns a process shared queue implemented using a pipe and a few
526 locks/semaphores. When a process first puts an item on the queue a feeder
527 thread is started which transfers objects from a buffer into the pipe.
529 The usual :exc:`Queue.Empty` and :exc:`Queue.Full` exceptions from the
530 standard library's :mod:`Queue` module are raised to signal timeouts.
532 :class:`Queue` implements all the methods of :class:`Queue.Queue` except for
533 :meth:`~Queue.Queue.task_done` and :meth:`~Queue.Queue.join`.
537 Return the approximate size of the queue. Because of
538 multithreading/multiprocessing semantics, this number is not reliable.
540 Note that this may raise :exc:`NotImplementedError` on Unix platforms like
541 Mac OS X where ``sem_getvalue()`` is not implemented.
545 Return ``True`` if the queue is empty, ``False`` otherwise. Because of
546 multithreading/multiprocessing semantics, this is not reliable.
550 Return ``True`` if the queue is full, ``False`` otherwise. Because of
551 multithreading/multiprocessing semantics, this is not reliable.
553 .. method:: put(item[, block[, timeout]])
555 Put item into the queue. If the optional argument *block* is ``True``
556 (the default) and *timeout* is ``None`` (the default), block if necessary until
557 a free slot is available. If *timeout* is a positive number, it blocks at
558 most *timeout* seconds and raises the :exc:`Queue.Full` exception if no
559 free slot was available within that time. Otherwise (*block* is
560 ``False``), put an item on the queue if a free slot is immediately
561 available, else raise the :exc:`Queue.Full` exception (*timeout* is
562 ignored in that case).
564 .. method:: put_nowait(item)
566 Equivalent to ``put(item, False)``.
568 .. method:: get([block[, timeout]])
570 Remove and return an item from the queue. If optional args *block* is
571 ``True`` (the default) and *timeout* is ``None`` (the default), block if
572 necessary until an item is available. If *timeout* is a positive number,
573 it blocks at most *timeout* seconds and raises the :exc:`Queue.Empty`
574 exception if no item was available within that time. Otherwise (block is
575 ``False``), return an item if one is immediately available, else raise the
576 :exc:`Queue.Empty` exception (*timeout* is ignored in that case).
578 .. method:: get_nowait()
581 Equivalent to ``get(False)``.
583 :class:`multiprocessing.Queue` has a few additional methods not found in
584 :class:`Queue.Queue`. These methods are usually unnecessary for most
589 Indicate that no more data will be put on this queue by the current
590 process. The background thread will quit once it has flushed all buffered
591 data to the pipe. This is called automatically when the queue is garbage
594 .. method:: join_thread()
596 Join the background thread. This can only be used after :meth:`close` has
597 been called. It blocks until the background thread exits, ensuring that
598 all data in the buffer has been flushed to the pipe.
600 By default if a process is not the creator of the queue then on exit it
601 will attempt to join the queue's background thread. The process can call
602 :meth:`cancel_join_thread` to make :meth:`join_thread` do nothing.
604 .. method:: cancel_join_thread()
606 Prevent :meth:`join_thread` from blocking. In particular, this prevents
607 the background thread from being joined automatically when the process
608 exits -- see :meth:`join_thread`.
611 .. class:: JoinableQueue([maxsize])
613 :class:`JoinableQueue`, a :class:`Queue` subclass, is a queue which
614 additionally has :meth:`task_done` and :meth:`join` methods.
616 .. method:: task_done()
618 Indicate that a formerly enqueued task is complete. Used by queue consumer
619 threads. For each :meth:`~Queue.get` used to fetch a task, a subsequent
620 call to :meth:`task_done` tells the queue that the processing on the task
623 If a :meth:`~Queue.join` is currently blocking, it will resume when all
624 items have been processed (meaning that a :meth:`task_done` call was
625 received for every item that had been :meth:`~Queue.put` into the queue).
627 Raises a :exc:`ValueError` if called more times than there were items
633 Block until all items in the queue have been gotten and processed.
635 The count of unfinished tasks goes up whenever an item is added to the
636 queue. The count goes down whenever a consumer thread calls
637 :meth:`task_done` to indicate that the item was retrieved and all work on
638 it is complete. When the count of unfinished tasks drops to zero,
639 :meth:`~Queue.join` unblocks.
645 .. function:: active_children()
647 Return list of all live children of the current process.
649 Calling this has the side affect of "joining" any processes which have
652 .. function:: cpu_count()
654 Return the number of CPUs in the system. May raise
655 :exc:`NotImplementedError`.
657 .. function:: current_process()
659 Return the :class:`Process` object corresponding to the current process.
661 An analogue of :func:`threading.current_thread`.
663 .. function:: freeze_support()
665 Add support for when a program which uses :mod:`multiprocessing` has been
666 frozen to produce a Windows executable. (Has been tested with **py2exe**,
667 **PyInstaller** and **cx_Freeze**.)
669 One needs to call this function straight after the ``if __name__ ==
670 '__main__'`` line of the main module. For example::
672 from multiprocessing import Process, freeze_support
677 if __name__ == '__main__':
679 Process(target=f).start()
681 If the ``freeze_support()`` line is omitted then trying to run the frozen
682 executable will raise :exc:`RuntimeError`.
684 If the module is being run normally by the Python interpreter then
685 :func:`freeze_support` has no effect.
687 .. function:: set_executable()
689 Sets the path of the python interpreter to use when starting a child process.
690 (By default :data:`sys.executable` is used). Embedders will probably need to
691 do some thing like ::
693 setExecutable(os.path.join(sys.exec_prefix, 'pythonw.exe'))
695 before they can create child processes. (Windows only)
700 :mod:`multiprocessing` contains no analogues of
701 :func:`threading.active_count`, :func:`threading.enumerate`,
702 :func:`threading.settrace`, :func:`threading.setprofile`,
703 :class:`threading.Timer`, or :class:`threading.local`.
709 Connection objects allow the sending and receiving of picklable objects or
710 strings. They can be thought of as message oriented connected sockets.
712 Connection objects usually created using :func:`Pipe` -- see also
713 :ref:`multiprocessing-listeners-clients`.
715 .. class:: Connection
717 .. method:: send(obj)
719 Send an object to the other end of the connection which should be read
722 The object must be picklable. Very large pickles (approximately 32 MB+,
723 though it depends on the OS) may raise a ValueError exception.
727 Return an object sent from the other end of the connection using
728 :meth:`send`. Raises :exc:`EOFError` if there is nothing left to receive
729 and the other end was closed.
733 Returns the file descriptor or handle used by the connection.
737 Close the connection.
739 This is called automatically when the connection is garbage collected.
741 .. method:: poll([timeout])
743 Return whether there is any data available to be read.
745 If *timeout* is not specified then it will return immediately. If
746 *timeout* is a number then this specifies the maximum time in seconds to
747 block. If *timeout* is ``None`` then an infinite timeout is used.
749 .. method:: send_bytes(buffer[, offset[, size]])
751 Send byte data from an object supporting the buffer interface as a
754 If *offset* is given then data is read from that position in *buffer*. If
755 *size* is given then that many bytes will be read from buffer. Very large
756 buffers (approximately 32 MB+, though it depends on the OS) may raise a
759 .. method:: recv_bytes([maxlength])
761 Return a complete message of byte data sent from the other end of the
762 connection as a string. Raises :exc:`EOFError` if there is nothing left
763 to receive and the other end has closed.
765 If *maxlength* is specified and the message is longer than *maxlength*
766 then :exc:`IOError` is raised and the connection will no longer be
769 .. method:: recv_bytes_into(buffer[, offset])
771 Read into *buffer* a complete message of byte data sent from the other end
772 of the connection and return the number of bytes in the message. Raises
773 :exc:`EOFError` if there is nothing left to receive and the other end was
776 *buffer* must be an object satisfying the writable buffer interface. If
777 *offset* is given then the message will be written into the buffer from
778 that position. Offset must be a non-negative integer less than the
779 length of *buffer* (in bytes).
781 If the buffer is too short then a :exc:`BufferTooShort` exception is
782 raised and the complete message is available as ``e.args[0]`` where ``e``
783 is the exception instance.
790 >>> from multiprocessing import Pipe
792 >>> a.send([1, 'hello', None])
795 >>> b.send_bytes('thank you')
799 >>> arr1 = array.array('i', range(5))
800 >>> arr2 = array.array('i', [0] * 10)
801 >>> a.send_bytes(arr1)
802 >>> count = b.recv_bytes_into(arr2)
803 >>> assert count == len(arr1) * arr1.itemsize
805 array('i', [0, 1, 2, 3, 4, 0, 0, 0, 0, 0])
810 The :meth:`Connection.recv` method automatically unpickles the data it
811 receives, which can be a security risk unless you can trust the process
812 which sent the message.
814 Therefore, unless the connection object was produced using :func:`Pipe` you
815 should only use the :meth:`~Connection.recv` and :meth:`~Connection.send`
816 methods after performing some sort of authentication. See
817 :ref:`multiprocessing-auth-keys`.
821 If a process is killed while it is trying to read or write to a pipe then
822 the data in the pipe is likely to become corrupted, because it may become
823 impossible to be sure where the message boundaries lie.
826 Synchronization primitives
827 ~~~~~~~~~~~~~~~~~~~~~~~~~~
829 Generally synchronization primitives are not as necessary in a multiprocess
830 program as they are in a multithreaded program. See the documentation for
831 :mod:`threading` module.
833 Note that one can also create synchronization primitives by using a manager
834 object -- see :ref:`multiprocessing-managers`.
836 .. class:: BoundedSemaphore([value])
838 A bounded semaphore object: a clone of :class:`threading.BoundedSemaphore`.
840 (On Mac OS X this is indistinguishable from :class:`Semaphore` because
841 ``sem_getvalue()`` is not implemented on that platform).
843 .. class:: Condition([lock])
845 A condition variable: a clone of :class:`threading.Condition`.
847 If *lock* is specified then it should be a :class:`Lock` or :class:`RLock`
848 object from :mod:`multiprocessing`.
852 A clone of :class:`threading.Event`.
853 This method returns the state of the internal semaphore on exit, so it
854 will always return ``True`` except if a timeout is given and the operation
857 .. versionchanged:: 2.7
858 Previously, the method always returned ``None``.
862 A non-recursive lock object: a clone of :class:`threading.Lock`.
866 A recursive lock object: a clone of :class:`threading.RLock`.
868 .. class:: Semaphore([value])
870 A bounded semaphore object: a clone of :class:`threading.Semaphore`.
874 The :meth:`acquire` method of :class:`BoundedSemaphore`, :class:`Lock`,
875 :class:`RLock` and :class:`Semaphore` has a timeout parameter not supported
876 by the equivalents in :mod:`threading`. The signature is
877 ``acquire(block=True, timeout=None)`` with keyword parameters being
878 acceptable. If *block* is ``True`` and *timeout* is not ``None`` then it
879 specifies a timeout in seconds. If *block* is ``False`` then *timeout* is
883 On OS/X ``sem_timedwait`` is unsupported, so timeout arguments for the
884 aforementioned :meth:`acquire` methods will be ignored on OS/X.
888 If the SIGINT signal generated by Ctrl-C arrives while the main thread is
889 blocked by a call to :meth:`BoundedSemaphore.acquire`, :meth:`Lock.acquire`,
890 :meth:`RLock.acquire`, :meth:`Semaphore.acquire`, :meth:`Condition.acquire`
891 or :meth:`Condition.wait` then the call will be immediately interrupted and
892 :exc:`KeyboardInterrupt` will be raised.
894 This differs from the behaviour of :mod:`threading` where SIGINT will be
895 ignored while the equivalent blocking calls are in progress.
898 Shared :mod:`ctypes` Objects
899 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
901 It is possible to create shared objects using shared memory which can be
902 inherited by child processes.
904 .. function:: Value(typecode_or_type, *args[, lock])
906 Return a :mod:`ctypes` object allocated from shared memory. By default the
907 return value is actually a synchronized wrapper for the object.
909 *typecode_or_type* determines the type of the returned object: it is either a
910 ctypes type or a one character typecode of the kind used by the :mod:`array`
911 module. *\*args* is passed on to the constructor for the type.
913 If *lock* is ``True`` (the default) then a new lock object is created to
914 synchronize access to the value. If *lock* is a :class:`Lock` or
915 :class:`RLock` object then that will be used to synchronize access to the
916 value. If *lock* is ``False`` then access to the returned object will not be
917 automatically protected by a lock, so it will not necessarily be
920 Note that *lock* is a keyword-only argument.
922 .. function:: Array(typecode_or_type, size_or_initializer, *, lock=True)
924 Return a ctypes array allocated from shared memory. By default the return
925 value is actually a synchronized wrapper for the array.
927 *typecode_or_type* determines the type of the elements of the returned array:
928 it is either a ctypes type or a one character typecode of the kind used by
929 the :mod:`array` module. If *size_or_initializer* is an integer, then it
930 determines the length of the array, and the array will be initially zeroed.
931 Otherwise, *size_or_initializer* is a sequence which is used to initialize
932 the array and whose length determines the length of the array.
934 If *lock* is ``True`` (the default) then a new lock object is created to
935 synchronize access to the value. If *lock* is a :class:`Lock` or
936 :class:`RLock` object then that will be used to synchronize access to the
937 value. If *lock* is ``False`` then access to the returned object will not be
938 automatically protected by a lock, so it will not necessarily be
941 Note that *lock* is a keyword only argument.
943 Note that an array of :data:`ctypes.c_char` has *value* and *raw*
944 attributes which allow one to use it to store and retrieve strings.
947 The :mod:`multiprocessing.sharedctypes` module
948 >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
950 .. module:: multiprocessing.sharedctypes
951 :synopsis: Allocate ctypes objects from shared memory.
953 The :mod:`multiprocessing.sharedctypes` module provides functions for allocating
954 :mod:`ctypes` objects from shared memory which can be inherited by child
959 Although it is possible to store a pointer in shared memory remember that
960 this will refer to a location in the address space of a specific process.
961 However, the pointer is quite likely to be invalid in the context of a second
962 process and trying to dereference the pointer from the second process may
965 .. function:: RawArray(typecode_or_type, size_or_initializer)
967 Return a ctypes array allocated from shared memory.
969 *typecode_or_type* determines the type of the elements of the returned array:
970 it is either a ctypes type or a one character typecode of the kind used by
971 the :mod:`array` module. If *size_or_initializer* is an integer then it
972 determines the length of the array, and the array will be initially zeroed.
973 Otherwise *size_or_initializer* is a sequence which is used to initialize the
974 array and whose length determines the length of the array.
976 Note that setting and getting an element is potentially non-atomic -- use
977 :func:`Array` instead to make sure that access is automatically synchronized
980 .. function:: RawValue(typecode_or_type, *args)
982 Return a ctypes object allocated from shared memory.
984 *typecode_or_type* determines the type of the returned object: it is either a
985 ctypes type or a one character typecode of the kind used by the :mod:`array`
986 module. *\*args* is passed on to the constructor for the type.
988 Note that setting and getting the value is potentially non-atomic -- use
989 :func:`Value` instead to make sure that access is automatically synchronized
992 Note that an array of :data:`ctypes.c_char` has ``value`` and ``raw``
993 attributes which allow one to use it to store and retrieve strings -- see
994 documentation for :mod:`ctypes`.
996 .. function:: Array(typecode_or_type, size_or_initializer, *args[, lock])
998 The same as :func:`RawArray` except that depending on the value of *lock* a
999 process-safe synchronization wrapper may be returned instead of a raw ctypes
1002 If *lock* is ``True`` (the default) then a new lock object is created to
1003 synchronize access to the value. If *lock* is a :class:`Lock` or
1004 :class:`RLock` object then that will be used to synchronize access to the
1005 value. If *lock* is ``False`` then access to the returned object will not be
1006 automatically protected by a lock, so it will not necessarily be
1009 Note that *lock* is a keyword-only argument.
1011 .. function:: Value(typecode_or_type, *args[, lock])
1013 The same as :func:`RawValue` except that depending on the value of *lock* a
1014 process-safe synchronization wrapper may be returned instead of a raw ctypes
1017 If *lock* is ``True`` (the default) then a new lock object is created to
1018 synchronize access to the value. If *lock* is a :class:`Lock` or
1019 :class:`RLock` object then that will be used to synchronize access to the
1020 value. If *lock* is ``False`` then access to the returned object will not be
1021 automatically protected by a lock, so it will not necessarily be
1024 Note that *lock* is a keyword-only argument.
1026 .. function:: copy(obj)
1028 Return a ctypes object allocated from shared memory which is a copy of the
1029 ctypes object *obj*.
1031 .. function:: synchronized(obj[, lock])
1033 Return a process-safe wrapper object for a ctypes object which uses *lock* to
1034 synchronize access. If *lock* is ``None`` (the default) then a
1035 :class:`multiprocessing.RLock` object is created automatically.
1037 A synchronized wrapper will have two methods in addition to those of the
1038 object it wraps: :meth:`get_obj` returns the wrapped object and
1039 :meth:`get_lock` returns the lock object used for synchronization.
1041 Note that accessing the ctypes object through the wrapper can be a lot slower
1042 than accessing the raw ctypes object.
1045 The table below compares the syntax for creating shared ctypes objects from
1046 shared memory with the normal ctypes syntax. (In the table ``MyStruct`` is some
1047 subclass of :class:`ctypes.Structure`.)
1049 ==================== ========================== ===========================
1050 ctypes sharedctypes using type sharedctypes using typecode
1051 ==================== ========================== ===========================
1052 c_double(2.4) RawValue(c_double, 2.4) RawValue('d', 2.4)
1053 MyStruct(4, 6) RawValue(MyStruct, 4, 6)
1054 (c_short * 7)() RawArray(c_short, 7) RawArray('h', 7)
1055 (c_int * 3)(9, 2, 8) RawArray(c_int, (9, 2, 8)) RawArray('i', (9, 2, 8))
1056 ==================== ========================== ===========================
1059 Below is an example where a number of ctypes objects are modified by a child
1062 from multiprocessing import Process, Lock
1063 from multiprocessing.sharedctypes import Value, Array
1064 from ctypes import Structure, c_double
1066 class Point(Structure):
1067 _fields_ = [('x', c_double), ('y', c_double)]
1069 def modify(n, x, s, A):
1072 s.value = s.value.upper()
1077 if __name__ == '__main__':
1081 x = Value(c_double, 1.0/3.0, lock=False)
1082 s = Array('c', 'hello world', lock=lock)
1083 A = Array(Point, [(1.875,-6.25), (-5.75,2.0), (2.375,9.5)], lock=lock)
1085 p = Process(target=modify, args=(n, x, s, A))
1092 print [(a.x, a.y) for a in A]
1095 .. highlightlang:: none
1097 The results printed are ::
1102 [(3.515625, 39.0625), (33.0625, 4.0), (5.640625, 90.25)]
1104 .. highlightlang:: python
1107 .. _multiprocessing-managers:
1112 Managers provide a way to create data which can be shared between different
1113 processes. A manager object controls a server process which manages *shared
1114 objects*. Other processes can access the shared objects by using proxies.
1116 .. function:: multiprocessing.Manager()
1118 Returns a started :class:`~multiprocessing.managers.SyncManager` object which
1119 can be used for sharing objects between processes. The returned manager
1120 object corresponds to a spawned child process and has methods which will
1121 create shared objects and return corresponding proxies.
1123 .. module:: multiprocessing.managers
1124 :synopsis: Share data between process with shared objects.
1126 Manager processes will be shutdown as soon as they are garbage collected or
1127 their parent process exits. The manager classes are defined in the
1128 :mod:`multiprocessing.managers` module:
1130 .. class:: BaseManager([address[, authkey]])
1132 Create a BaseManager object.
1134 Once created one should call :meth:`start` or :meth:`serve_forever` to ensure
1135 that the manager object refers to a started manager process.
1137 *address* is the address on which the manager process listens for new
1138 connections. If *address* is ``None`` then an arbitrary one is chosen.
1140 *authkey* is the authentication key which will be used to check the validity
1141 of incoming connections to the server process. If *authkey* is ``None`` then
1142 ``current_process().authkey``. Otherwise *authkey* is used and it
1145 .. method:: start([initializer[, initargs]])
1147 Start a subprocess to start the manager. If *initializer* is not ``None``
1148 then the subprocess will call ``initializer(*initargs)`` when it starts.
1150 .. method:: serve_forever()
1152 Run the server in the current process.
1154 .. method:: from_address(address, authkey)
1156 A class method which creates a manager object referring to a pre-existing
1157 server process which is using the given address and authentication key.
1159 .. method:: get_server()
1161 Returns a :class:`Server` object which represents the actual server under
1162 the control of the Manager. The :class:`Server` object supports the
1163 :meth:`serve_forever` method::
1165 >>> from multiprocessing.managers import BaseManager
1166 >>> manager = BaseManager(address=('', 50000), authkey='abc')
1167 >>> server = manager.get_server()
1168 >>> server.serve_forever()
1170 :class:`Server` additionally has an :attr:`address` attribute.
1172 .. method:: connect()
1174 Connect a local manager object to a remote manager process::
1176 >>> from multiprocessing.managers import BaseManager
1177 >>> m = BaseManager(address=('127.0.0.1', 5000), authkey='abc')
1180 .. method:: shutdown()
1182 Stop the process used by the manager. This is only available if
1183 :meth:`start` has been used to start the server process.
1185 This can be called multiple times.
1187 .. method:: register(typeid[, callable[, proxytype[, exposed[, method_to_typeid[, create_method]]]]])
1189 A classmethod which can be used for registering a type or callable with
1192 *typeid* is a "type identifier" which is used to identify a particular
1193 type of shared object. This must be a string.
1195 *callable* is a callable used for creating objects for this type
1196 identifier. If a manager instance will be created using the
1197 :meth:`from_address` classmethod or if the *create_method* argument is
1198 ``False`` then this can be left as ``None``.
1200 *proxytype* is a subclass of :class:`BaseProxy` which is used to create
1201 proxies for shared objects with this *typeid*. If ``None`` then a proxy
1202 class is created automatically.
1204 *exposed* is used to specify a sequence of method names which proxies for
1205 this typeid should be allowed to access using
1206 :meth:`BaseProxy._callMethod`. (If *exposed* is ``None`` then
1207 :attr:`proxytype._exposed_` is used instead if it exists.) In the case
1208 where no exposed list is specified, all "public methods" of the shared
1209 object will be accessible. (Here a "public method" means any attribute
1210 which has a :meth:`__call__` method and whose name does not begin with
1213 *method_to_typeid* is a mapping used to specify the return type of those
1214 exposed methods which should return a proxy. It maps method names to
1215 typeid strings. (If *method_to_typeid* is ``None`` then
1216 :attr:`proxytype._method_to_typeid_` is used instead if it exists.) If a
1217 method's name is not a key of this mapping or if the mapping is ``None``
1218 then the object returned by the method will be copied by value.
1220 *create_method* determines whether a method should be created with name
1221 *typeid* which can be used to tell the server process to create a new
1222 shared object and return a proxy for it. By default it is ``True``.
1224 :class:`BaseManager` instances also have one read-only property:
1226 .. attribute:: address
1228 The address used by the manager.
1231 .. class:: SyncManager
1233 A subclass of :class:`BaseManager` which can be used for the synchronization
1234 of processes. Objects of this type are returned by
1235 :func:`multiprocessing.Manager`.
1237 It also supports creation of shared lists and dictionaries.
1239 .. method:: BoundedSemaphore([value])
1241 Create a shared :class:`threading.BoundedSemaphore` object and return a
1244 .. method:: Condition([lock])
1246 Create a shared :class:`threading.Condition` object and return a proxy for
1249 If *lock* is supplied then it should be a proxy for a
1250 :class:`threading.Lock` or :class:`threading.RLock` object.
1254 Create a shared :class:`threading.Event` object and return a proxy for it.
1258 Create a shared :class:`threading.Lock` object and return a proxy for it.
1260 .. method:: Namespace()
1262 Create a shared :class:`Namespace` object and return a proxy for it.
1264 .. method:: Queue([maxsize])
1266 Create a shared :class:`Queue.Queue` object and return a proxy for it.
1270 Create a shared :class:`threading.RLock` object and return a proxy for it.
1272 .. method:: Semaphore([value])
1274 Create a shared :class:`threading.Semaphore` object and return a proxy for
1277 .. method:: Array(typecode, sequence)
1279 Create an array and return a proxy for it.
1281 .. method:: Value(typecode, value)
1283 Create an object with a writable ``value`` attribute and return a proxy
1290 Create a shared ``dict`` object and return a proxy for it.
1295 Create a shared ``list`` object and return a proxy for it.
1301 A namespace object has no public methods, but does have writable attributes.
1302 Its representation shows the values of its attributes.
1304 However, when using a proxy for a namespace object, an attribute beginning with
1305 ``'_'`` will be an attribute of the proxy and not an attribute of the referent:
1309 >>> manager = multiprocessing.Manager()
1310 >>> Global = manager.Namespace()
1312 >>> Global.y = 'hello'
1313 >>> Global._z = 12.3 # this is an attribute of the proxy
1315 Namespace(x=10, y='hello')
1321 To create one's own manager, one creates a subclass of :class:`BaseManager` and
1322 use the :meth:`~BaseManager.register` classmethod to register new types or
1323 callables with the manager class. For example::
1325 from multiprocessing.managers import BaseManager
1327 class MathsClass(object):
1328 def add(self, x, y):
1330 def mul(self, x, y):
1333 class MyManager(BaseManager):
1336 MyManager.register('Maths', MathsClass)
1338 if __name__ == '__main__':
1339 manager = MyManager()
1341 maths = manager.Maths()
1342 print maths.add(4, 3) # prints 7
1343 print maths.mul(7, 8) # prints 56
1346 Using a remote manager
1347 >>>>>>>>>>>>>>>>>>>>>>
1349 It is possible to run a manager server on one machine and have clients use it
1350 from other machines (assuming that the firewalls involved allow it).
1352 Running the following commands creates a server for a single shared queue which
1353 remote clients can access::
1355 >>> from multiprocessing.managers import BaseManager
1357 >>> queue = Queue.Queue()
1358 >>> class QueueManager(BaseManager): pass
1359 >>> QueueManager.register('get_queue', callable=lambda:queue)
1360 >>> m = QueueManager(address=('', 50000), authkey='abracadabra')
1361 >>> s = m.get_server()
1362 >>> s.serve_forever()
1364 One client can access the server as follows::
1366 >>> from multiprocessing.managers import BaseManager
1367 >>> class QueueManager(BaseManager): pass
1368 >>> QueueManager.register('get_queue')
1369 >>> m = QueueManager(address=('foo.bar.org', 50000), authkey='abracadabra')
1371 >>> queue = m.get_queue()
1372 >>> queue.put('hello')
1374 Another client can also use it::
1376 >>> from multiprocessing.managers import BaseManager
1377 >>> class QueueManager(BaseManager): pass
1378 >>> QueueManager.register('get_queue')
1379 >>> m = QueueManager(address=('foo.bar.org', 50000), authkey='abracadabra')
1381 >>> queue = m.get_queue()
1385 Local processes can also access that queue, using the code from above on the
1386 client to access it remotely::
1388 >>> from multiprocessing import Process, Queue
1389 >>> from multiprocessing.managers import BaseManager
1390 >>> class Worker(Process):
1391 ... def __init__(self, q):
1393 ... super(Worker, self).__init__()
1395 ... self.q.put('local hello')
1398 >>> w = Worker(queue)
1400 >>> class QueueManager(BaseManager): pass
1402 >>> QueueManager.register('get_queue', callable=lambda: queue)
1403 >>> m = QueueManager(address=('', 50000), authkey='abracadabra')
1404 >>> s = m.get_server()
1405 >>> s.serve_forever()
1410 A proxy is an object which *refers* to a shared object which lives (presumably)
1411 in a different process. The shared object is said to be the *referent* of the
1412 proxy. Multiple proxy objects may have the same referent.
1414 A proxy object has methods which invoke corresponding methods of its referent
1415 (although not every method of the referent will necessarily be available through
1416 the proxy). A proxy can usually be used in most of the same ways that its
1421 >>> from multiprocessing import Manager
1422 >>> manager = Manager()
1423 >>> l = manager.list([i*i for i in range(10)])
1425 [0, 1, 4, 9, 16, 25, 36, 49, 64, 81]
1427 <ListProxy object, typeid 'list' at 0x...>
1433 Notice that applying :func:`str` to a proxy will return the representation of
1434 the referent, whereas applying :func:`repr` will return the representation of
1437 An important feature of proxy objects is that they are picklable so they can be
1438 passed between processes. Note, however, that if a proxy is sent to the
1439 corresponding manager's process then unpickling it will produce the referent
1440 itself. This means, for example, that one shared object can contain a second:
1444 >>> a = manager.list()
1445 >>> b = manager.list()
1446 >>> a.append(b) # referent of a now contains referent of b
1449 >>> b.append('hello')
1451 [['hello']] ['hello']
1455 The proxy types in :mod:`multiprocessing` do nothing to support comparisons
1456 by value. So, for instance, we have:
1460 >>> manager.list([1,2,3]) == [1,2,3]
1463 One should just use a copy of the referent instead when making comparisons.
1465 .. class:: BaseProxy
1467 Proxy objects are instances of subclasses of :class:`BaseProxy`.
1469 .. method:: _callmethod(methodname[, args[, kwds]])
1471 Call and return the result of a method of the proxy's referent.
1473 If ``proxy`` is a proxy whose referent is ``obj`` then the expression ::
1475 proxy._callmethod(methodname, args, kwds)
1477 will evaluate the expression ::
1479 getattr(obj, methodname)(*args, **kwds)
1481 in the manager's process.
1483 The returned value will be a copy of the result of the call or a proxy to
1484 a new shared object -- see documentation for the *method_to_typeid*
1485 argument of :meth:`BaseManager.register`.
1487 If an exception is raised by the call, then then is re-raised by
1488 :meth:`_callmethod`. If some other exception is raised in the manager's
1489 process then this is converted into a :exc:`RemoteError` exception and is
1490 raised by :meth:`_callmethod`.
1492 Note in particular that an exception will be raised if *methodname* has
1495 An example of the usage of :meth:`_callmethod`:
1499 >>> l = manager.list(range(10))
1500 >>> l._callmethod('__len__')
1502 >>> l._callmethod('__getslice__', (2, 7)) # equiv to `l[2:7]`
1504 >>> l._callmethod('__getitem__', (20,)) # equiv to `l[20]`
1505 Traceback (most recent call last):
1507 IndexError: list index out of range
1509 .. method:: _getvalue()
1511 Return a copy of the referent.
1513 If the referent is unpicklable then this will raise an exception.
1515 .. method:: __repr__
1517 Return a representation of the proxy object.
1521 Return the representation of the referent.
1527 A proxy object uses a weakref callback so that when it gets garbage collected it
1528 deregisters itself from the manager which owns its referent.
1530 A shared object gets deleted from the manager process when there are no longer
1531 any proxies referring to it.
1537 .. module:: multiprocessing.pool
1538 :synopsis: Create pools of processes.
1540 One can create a pool of processes which will carry out tasks submitted to it
1541 with the :class:`Pool` class.
1543 .. class:: multiprocessing.Pool([processes[, initializer[, initargs]]])
1545 A process pool object which controls a pool of worker processes to which jobs
1546 can be submitted. It supports asynchronous results with timeouts and
1547 callbacks and has a parallel map implementation.
1549 *processes* is the number of worker processes to use. If *processes* is
1550 ``None`` then the number returned by :func:`cpu_count` is used. If
1551 *initializer* is not ``None`` then each worker process will call
1552 ``initializer(*initargs)`` when it starts.
1554 .. method:: apply(func[, args[, kwds]])
1556 Equivalent of the :func:`apply` builtin function. It blocks till the
1557 result is ready. Given this blocks - :meth:`apply_async` is better suited
1558 for performing work in parallel. Additionally, the passed
1559 in function is only executed in one of the workers of the pool.
1561 .. method:: apply_async(func[, args[, kwds[, callback]]])
1563 A variant of the :meth:`apply` method which returns a result object.
1565 If *callback* is specified then it should be a callable which accepts a
1566 single argument. When the result becomes ready *callback* is applied to
1567 it (unless the call failed). *callback* should complete immediately since
1568 otherwise the thread which handles the results will get blocked.
1570 .. method:: map(func, iterable[, chunksize])
1572 A parallel equivalent of the :func:`map` builtin function (it supports only
1573 one *iterable* argument though). It blocks till the result is ready.
1575 This method chops the iterable into a number of chunks which it submits to
1576 the process pool as separate tasks. The (approximate) size of these
1577 chunks can be specified by setting *chunksize* to a positive integer.
1579 .. method:: map_async(func, iterable[, chunksize[, callback]])
1581 A variant of the :meth:`map` method which returns a result object.
1583 If *callback* is specified then it should be a callable which accepts a
1584 single argument. When the result becomes ready *callback* is applied to
1585 it (unless the call failed). *callback* should complete immediately since
1586 otherwise the thread which handles the results will get blocked.
1588 .. method:: imap(func, iterable[, chunksize])
1590 An equivalent of :func:`itertools.imap`.
1592 The *chunksize* argument is the same as the one used by the :meth:`.map`
1593 method. For very long iterables using a large value for *chunksize* can
1594 make make the job complete **much** faster than using the default value of
1597 Also if *chunksize* is ``1`` then the :meth:`next` method of the iterator
1598 returned by the :meth:`imap` method has an optional *timeout* parameter:
1599 ``next(timeout)`` will raise :exc:`multiprocessing.TimeoutError` if the
1600 result cannot be returned within *timeout* seconds.
1602 .. method:: imap_unordered(func, iterable[, chunksize])
1604 The same as :meth:`imap` except that the ordering of the results from the
1605 returned iterator should be considered arbitrary. (Only when there is
1606 only one worker process is the order guaranteed to be "correct".)
1610 Prevents any more tasks from being submitted to the pool. Once all the
1611 tasks have been completed the worker processes will exit.
1613 .. method:: terminate()
1615 Stops the worker processes immediately without completing outstanding
1616 work. When the pool object is garbage collected :meth:`terminate` will be
1621 Wait for the worker processes to exit. One must call :meth:`close` or
1622 :meth:`terminate` before using :meth:`join`.
1625 .. class:: AsyncResult
1627 The class of the result returned by :meth:`Pool.apply_async` and
1628 :meth:`Pool.map_async`.
1630 .. method:: get([timeout])
1632 Return the result when it arrives. If *timeout* is not ``None`` and the
1633 result does not arrive within *timeout* seconds then
1634 :exc:`multiprocessing.TimeoutError` is raised. If the remote call raised
1635 an exception then that exception will be reraised by :meth:`get`.
1637 .. method:: wait([timeout])
1639 Wait until the result is available or until *timeout* seconds pass.
1643 Return whether the call has completed.
1645 .. method:: successful()
1647 Return whether the call completed without raising an exception. Will
1648 raise :exc:`AssertionError` if the result is not ready.
1650 The following example demonstrates the use of a pool::
1652 from multiprocessing import Pool
1657 if __name__ == '__main__':
1658 pool = Pool(processes=4) # start 4 worker processes
1660 result = pool.apply_async(f, (10,)) # evaluate "f(10)" asynchronously
1661 print result.get(timeout=1) # prints "100" unless your computer is *very* slow
1663 print pool.map(f, range(10)) # prints "[0, 1, 4,..., 81]"
1665 it = pool.imap(f, range(10))
1666 print it.next() # prints "0"
1667 print it.next() # prints "1"
1668 print it.next(timeout=1) # prints "4" unless your computer is *very* slow
1671 result = pool.apply_async(time.sleep, (10,))
1672 print result.get(timeout=1) # raises TimeoutError
1675 .. _multiprocessing-listeners-clients:
1677 Listeners and Clients
1678 ~~~~~~~~~~~~~~~~~~~~~
1680 .. module:: multiprocessing.connection
1681 :synopsis: API for dealing with sockets.
1683 Usually message passing between processes is done using queues or by using
1684 :class:`Connection` objects returned by :func:`Pipe`.
1686 However, the :mod:`multiprocessing.connection` module allows some extra
1687 flexibility. It basically gives a high level message oriented API for dealing
1688 with sockets or Windows named pipes, and also has support for *digest
1689 authentication* using the :mod:`hmac` module.
1692 .. function:: deliver_challenge(connection, authkey)
1694 Send a randomly generated message to the other end of the connection and wait
1697 If the reply matches the digest of the message using *authkey* as the key
1698 then a welcome message is sent to the other end of the connection. Otherwise
1699 :exc:`AuthenticationError` is raised.
1701 .. function:: answerChallenge(connection, authkey)
1703 Receive a message, calculate the digest of the message using *authkey* as the
1704 key, and then send the digest back.
1706 If a welcome message is not received, then :exc:`AuthenticationError` is
1709 .. function:: Client(address[, family[, authenticate[, authkey]]])
1711 Attempt to set up a connection to the listener which is using address
1712 *address*, returning a :class:`~multiprocessing.Connection`.
1714 The type of the connection is determined by *family* argument, but this can
1715 generally be omitted since it can usually be inferred from the format of
1716 *address*. (See :ref:`multiprocessing-address-formats`)
1718 If *authentication* is ``True`` or *authkey* is a string then digest
1719 authentication is used. The key used for authentication will be either
1720 *authkey* or ``current_process().authkey)`` if *authkey* is ``None``.
1721 If authentication fails then :exc:`AuthenticationError` is raised. See
1722 :ref:`multiprocessing-auth-keys`.
1724 .. class:: Listener([address[, family[, backlog[, authenticate[, authkey]]]]])
1726 A wrapper for a bound socket or Windows named pipe which is 'listening' for
1729 *address* is the address to be used by the bound socket or named pipe of the
1734 If an address of '0.0.0.0' is used, the address will not be a connectable
1735 end point on Windows. If you require a connectable end-point,
1736 you should use '127.0.0.1'.
1738 *family* is the type of socket (or named pipe) to use. This can be one of
1739 the strings ``'AF_INET'`` (for a TCP socket), ``'AF_UNIX'`` (for a Unix
1740 domain socket) or ``'AF_PIPE'`` (for a Windows named pipe). Of these only
1741 the first is guaranteed to be available. If *family* is ``None`` then the
1742 family is inferred from the format of *address*. If *address* is also
1743 ``None`` then a default is chosen. This default is the family which is
1744 assumed to be the fastest available. See
1745 :ref:`multiprocessing-address-formats`. Note that if *family* is
1746 ``'AF_UNIX'`` and address is ``None`` then the socket will be created in a
1747 private temporary directory created using :func:`tempfile.mkstemp`.
1749 If the listener object uses a socket then *backlog* (1 by default) is passed
1750 to the :meth:`listen` method of the socket once it has been bound.
1752 If *authenticate* is ``True`` (``False`` by default) or *authkey* is not
1753 ``None`` then digest authentication is used.
1755 If *authkey* is a string then it will be used as the authentication key;
1756 otherwise it must be *None*.
1758 If *authkey* is ``None`` and *authenticate* is ``True`` then
1759 ``current_process().authkey`` is used as the authentication key. If
1760 *authkey* is ``None`` and *authentication* is ``False`` then no
1761 authentication is done. If authentication fails then
1762 :exc:`AuthenticationError` is raised. See :ref:`multiprocessing-auth-keys`.
1764 .. method:: accept()
1766 Accept a connection on the bound socket or named pipe of the listener
1767 object and return a :class:`Connection` object. If authentication is
1768 attempted and fails, then :exc:`AuthenticationError` is raised.
1772 Close the bound socket or named pipe of the listener object. This is
1773 called automatically when the listener is garbage collected. However it
1774 is advisable to call it explicitly.
1776 Listener objects have the following read-only properties:
1778 .. attribute:: address
1780 The address which is being used by the Listener object.
1782 .. attribute:: last_accepted
1784 The address from which the last accepted connection came. If this is
1785 unavailable then it is ``None``.
1788 The module defines two exceptions:
1790 .. exception:: AuthenticationError
1792 Exception raised when there is an authentication error.
1797 The following server code creates a listener which uses ``'secret password'`` as
1798 an authentication key. It then waits for a connection and sends some data to
1801 from multiprocessing.connection import Listener
1802 from array import array
1804 address = ('localhost', 6000) # family is deduced to be 'AF_INET'
1805 listener = Listener(address, authkey='secret password')
1807 conn = listener.accept()
1808 print 'connection accepted from', listener.last_accepted
1810 conn.send([2.25, None, 'junk', float])
1812 conn.send_bytes('hello')
1814 conn.send_bytes(array('i', [42, 1729]))
1819 The following code connects to the server and receives some data from the
1822 from multiprocessing.connection import Client
1823 from array import array
1825 address = ('localhost', 6000)
1826 conn = Client(address, authkey='secret password')
1828 print conn.recv() # => [2.25, None, 'junk', float]
1830 print conn.recv_bytes() # => 'hello'
1832 arr = array('i', [0, 0, 0, 0, 0])
1833 print conn.recv_bytes_into(arr) # => 8
1834 print arr # => array('i', [42, 1729, 0, 0, 0])
1839 .. _multiprocessing-address-formats:
1844 * An ``'AF_INET'`` address is a tuple of the form ``(hostname, port)`` where
1845 *hostname* is a string and *port* is an integer.
1847 * An ``'AF_UNIX'`` address is a string representing a filename on the
1850 * An ``'AF_PIPE'`` address is a string of the form
1851 :samp:`r'\\\\.\\pipe\\{PipeName}'`. To use :func:`Client` to connect to a named
1852 pipe on a remote computer called *ServerName* one should use an address of the
1853 form :samp:`r'\\\\{ServerName}\\pipe\\{PipeName}'` instead.
1855 Note that any string beginning with two backslashes is assumed by default to be
1856 an ``'AF_PIPE'`` address rather than an ``'AF_UNIX'`` address.
1859 .. _multiprocessing-auth-keys:
1864 When one uses :meth:`Connection.recv`, the data received is automatically
1865 unpickled. Unfortunately unpickling data from an untrusted source is a security
1866 risk. Therefore :class:`Listener` and :func:`Client` use the :mod:`hmac` module
1867 to provide digest authentication.
1869 An authentication key is a string which can be thought of as a password: once a
1870 connection is established both ends will demand proof that the other knows the
1871 authentication key. (Demonstrating that both ends are using the same key does
1872 **not** involve sending the key over the connection.)
1874 If authentication is requested but do authentication key is specified then the
1875 return value of ``current_process().authkey`` is used (see
1876 :class:`~multiprocessing.Process`). This value will automatically inherited by
1877 any :class:`~multiprocessing.Process` object that the current process creates.
1878 This means that (by default) all processes of a multi-process program will share
1879 a single authentication key which can be used when setting up connections
1882 Suitable authentication keys can also be generated by using :func:`os.urandom`.
1888 Some support for logging is available. Note, however, that the :mod:`logging`
1889 package does not use process shared locks so it is possible (depending on the
1890 handler type) for messages from different processes to get mixed up.
1892 .. currentmodule:: multiprocessing
1893 .. function:: get_logger()
1895 Returns the logger used by :mod:`multiprocessing`. If necessary, a new one
1898 When first created the logger has level :data:`logging.NOTSET` and no
1899 default handler. Messages sent to this logger will not by default propagate
1902 Note that on Windows child processes will only inherit the level of the
1903 parent process's logger -- any other customization of the logger will not be
1906 .. currentmodule:: multiprocessing
1907 .. function:: log_to_stderr()
1909 This function performs a call to :func:`get_logger` but in addition to
1910 returning the logger created by get_logger, it adds a handler which sends
1911 output to :data:`sys.stderr` using format
1912 ``'[%(levelname)s/%(processName)s] %(message)s'``.
1914 Below is an example session with logging turned on::
1916 >>> import multiprocessing, logging
1917 >>> logger = multiprocessing.log_to_stderr()
1918 >>> logger.setLevel(logging.INFO)
1919 >>> logger.warning('doomed')
1920 [WARNING/MainProcess] doomed
1921 >>> m = multiprocessing.Manager()
1922 [INFO/SyncManager-...] child process calling self.run()
1923 [INFO/SyncManager-...] created temp directory /.../pymp-...
1924 [INFO/SyncManager-...] manager serving at '/.../listener-...'
1926 [INFO/MainProcess] sending shutdown message to manager
1927 [INFO/SyncManager-...] manager exiting with exitcode 0
1929 In addition to having these two logging functions, the multiprocessing also
1930 exposes two additional logging level attributes. These are :const:`SUBWARNING`
1931 and :const:`SUBDEBUG`. The table below illustrates where theses fit in the
1932 normal level hierarchy.
1934 +----------------+----------------+
1935 | Level | Numeric value |
1936 +================+================+
1937 | ``SUBWARNING`` | 25 |
1938 +----------------+----------------+
1939 | ``SUBDEBUG`` | 5 |
1940 +----------------+----------------+
1942 For a full table of logging levels, see the :mod:`logging` module.
1944 These additional logging levels are used primarily for certain debug messages
1945 within the multiprocessing module. Below is the same example as above, except
1946 with :const:`SUBDEBUG` enabled::
1948 >>> import multiprocessing, logging
1949 >>> logger = multiprocessing.log_to_stderr()
1950 >>> logger.setLevel(multiprocessing.SUBDEBUG)
1951 >>> logger.warning('doomed')
1952 [WARNING/MainProcess] doomed
1953 >>> m = multiprocessing.Manager()
1954 [INFO/SyncManager-...] child process calling self.run()
1955 [INFO/SyncManager-...] created temp directory /.../pymp-...
1956 [INFO/SyncManager-...] manager serving at '/.../pymp-djGBXN/listener-...'
1958 [SUBDEBUG/MainProcess] finalizer calling ...
1959 [INFO/MainProcess] sending shutdown message to manager
1960 [DEBUG/SyncManager-...] manager received shutdown message
1961 [SUBDEBUG/SyncManager-...] calling <Finalize object, callback=unlink, ...
1962 [SUBDEBUG/SyncManager-...] finalizer calling <built-in function unlink> ...
1963 [SUBDEBUG/SyncManager-...] calling <Finalize object, dead>
1964 [SUBDEBUG/SyncManager-...] finalizer calling <function rmtree at 0x5aa730> ...
1965 [INFO/SyncManager-...] manager exiting with exitcode 0
1967 The :mod:`multiprocessing.dummy` module
1968 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1970 .. module:: multiprocessing.dummy
1971 :synopsis: Dumb wrapper around threading.
1973 :mod:`multiprocessing.dummy` replicates the API of :mod:`multiprocessing` but is
1974 no more than a wrapper around the :mod:`threading` module.
1977 .. _multiprocessing-programming:
1979 Programming guidelines
1980 ----------------------
1982 There are certain guidelines and idioms which should be adhered to when using
1983 :mod:`multiprocessing`.
1991 As far as possible one should try to avoid shifting large amounts of data
1994 It is probably best to stick to using queues or pipes for communication
1995 between processes rather than using the lower level synchronization
1996 primitives from the :mod:`threading` module.
2000 Ensure that the arguments to the methods of proxies are picklable.
2002 Thread safety of proxies
2004 Do not use a proxy object from more than one thread unless you protect it
2007 (There is never a problem with different processes using the *same* proxy.)
2009 Joining zombie processes
2011 On Unix when a process finishes but has not been joined it becomes a zombie.
2012 There should never be very many because each time a new process starts (or
2013 :func:`active_children` is called) all completed processes which have not
2014 yet been joined will be joined. Also calling a finished process's
2015 :meth:`Process.is_alive` will join the process. Even so it is probably good
2016 practice to explicitly join all the processes that you start.
2018 Better to inherit than pickle/unpickle
2020 On Windows many types from :mod:`multiprocessing` need to be picklable so
2021 that child processes can use them. However, one should generally avoid
2022 sending shared objects to other processes using pipes or queues. Instead
2023 you should arrange the program so that a process which need access to a
2024 shared resource created elsewhere can inherit it from an ancestor process.
2026 Avoid terminating processes
2028 Using the :meth:`Process.terminate` method to stop a process is liable to
2029 cause any shared resources (such as locks, semaphores, pipes and queues)
2030 currently being used by the process to become broken or unavailable to other
2033 Therefore it is probably best to only consider using
2034 :meth:`Process.terminate` on processes which never use any shared resources.
2036 Joining processes that use queues
2038 Bear in mind that a process that has put items in a queue will wait before
2039 terminating until all the buffered items are fed by the "feeder" thread to
2040 the underlying pipe. (The child process can call the
2041 :meth:`Queue.cancel_join_thread` method of the queue to avoid this behaviour.)
2043 This means that whenever you use a queue you need to make sure that all
2044 items which have been put on the queue will eventually be removed before the
2045 process is joined. Otherwise you cannot be sure that processes which have
2046 put items on the queue will terminate. Remember also that non-daemonic
2047 processes will be automatically be joined.
2049 An example which will deadlock is the following::
2051 from multiprocessing import Process, Queue
2054 q.put('X' * 1000000)
2056 if __name__ == '__main__':
2058 p = Process(target=f, args=(queue,))
2060 p.join() # this deadlocks
2063 A fix here would be to swap the last two lines round (or simply remove the
2066 Explicitly pass resources to child processes
2068 On Unix a child process can make use of a shared resource created in a
2069 parent process using a global resource. However, it is better to pass the
2070 object as an argument to the constructor for the child process.
2072 Apart from making the code (potentially) compatible with Windows this also
2073 ensures that as long as the child process is still alive the object will not
2074 be garbage collected in the parent process. This might be important if some
2075 resource is freed when the object is garbage collected in the parent
2080 from multiprocessing import Process, Lock
2083 ... do something using "lock" ...
2085 if __name__ == '__main__':
2088 Process(target=f).start()
2090 should be rewritten as ::
2092 from multiprocessing import Process, Lock
2095 ... do something using "l" ...
2097 if __name__ == '__main__':
2100 Process(target=f, args=(lock,)).start()
2106 Since Windows lacks :func:`os.fork` it has a few extra restrictions:
2110 Ensure that all arguments to :meth:`Process.__init__` are picklable. This
2111 means, in particular, that bound or unbound methods cannot be used directly
2112 as the ``target`` argument on Windows --- just define a function and use
2115 Also, if you subclass :class:`Process` then make sure that instances will be
2116 picklable when the :meth:`Process.start` method is called.
2120 Bear in mind that if code run in a child process tries to access a global
2121 variable, then the value it sees (if any) may not be the same as the value
2122 in the parent process at the time that :meth:`Process.start` was called.
2124 However, global variables which are just module level constants cause no
2127 Safe importing of main module
2129 Make sure that the main module can be safely imported by a new Python
2130 interpreter without causing unintended side effects (such a starting a new
2133 For example, under Windows running the following module would fail with a
2134 :exc:`RuntimeError`::
2136 from multiprocessing import Process
2141 p = Process(target=foo)
2144 Instead one should protect the "entry point" of the program by using ``if
2145 __name__ == '__main__':`` as follows::
2147 from multiprocessing import Process, freeze_support
2152 if __name__ == '__main__':
2154 p = Process(target=foo)
2157 (The ``freeze_support()`` line can be omitted if the program will be run
2158 normally instead of frozen.)
2160 This allows the newly spawned Python interpreter to safely import the module
2161 and then run the module's ``foo()`` function.
2163 Similar restrictions apply if a pool or manager is created in the main
2167 .. _multiprocessing-examples:
2172 Demonstration of how to create and use customized managers and proxies:
2174 .. literalinclude:: ../includes/mp_newtype.py
2177 Using :class:`Pool`:
2179 .. literalinclude:: ../includes/mp_pool.py
2182 Synchronization types like locks, conditions and queues:
2184 .. literalinclude:: ../includes/mp_synchronize.py
2187 An showing how to use queues to feed tasks to a collection of worker process and
2188 collect the results:
2190 .. literalinclude:: ../includes/mp_workers.py
2193 An example of how a pool of worker processes can each run a
2194 :class:`SimpleHTTPServer.HttpServer` instance while sharing a single listening
2197 .. literalinclude:: ../includes/mp_webserver.py
2200 Some simple benchmarks comparing :mod:`multiprocessing` with :mod:`threading`:
2202 .. literalinclude:: ../includes/mp_benchmarks.py
2204 An example/demo of how to use the :class:`managers.SyncManager`, :class:`Process`
2205 and others to build a system which can distribute processes and work via a
2206 distributed queue to a "cluster" of machines on a network, accessible via SSH.
2207 You will need to have private key authentication for all hosts configured for
2210 .. literalinclude:: ../includes/mp_distributing.py