Linux cpanel.rrshost.in 5.15.0-25-generic #25-Ubuntu SMP Wed Mar 30 15:54:22 UTC 2022 x86_64
Apache
: 109.123.238.221 | : 172.70.127.65
128 Domain
8.2.28
aev999
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
HASH IDENTIFIER
README
+ Create Folder
+ Create File
/
usr /
share /
doc /
python2.7 /
html /
_sources /
library /
[ HOME SHELL ]
Name
Size
Permission
Action
2to3.rst.txt
14.3
KB
-rw-r--r--
__builtin__.rst.txt
1.46
KB
-rw-r--r--
__future__.rst.txt
4.84
KB
-rw-r--r--
__main__.rst.txt
535
B
-rw-r--r--
_winreg.rst.txt
22.77
KB
-rw-r--r--
abc.rst.txt
7.05
KB
-rw-r--r--
aepack.rst.txt
4.16
KB
-rw-r--r--
aetools.rst.txt
3.45
KB
-rw-r--r--
aetypes.rst.txt
4.16
KB
-rw-r--r--
aifc.rst.txt
6.92
KB
-rw-r--r--
al.rst.txt
5.18
KB
-rw-r--r--
allos.rst.txt
695
B
-rw-r--r--
anydbm.rst.txt
4.01
KB
-rw-r--r--
archiving.rst.txt
424
B
-rw-r--r--
argparse.rst.txt
72.93
KB
-rw-r--r--
array.rst.txt
10.28
KB
-rw-r--r--
ast.rst.txt
10.23
KB
-rw-r--r--
asynchat.rst.txt
8.99
KB
-rw-r--r--
asyncore.rst.txt
12.63
KB
-rw-r--r--
atexit.rst.txt
3.82
KB
-rw-r--r--
audioop.rst.txt
10.15
KB
-rw-r--r--
autogil.rst.txt
1015
B
-rw-r--r--
base64.rst.txt
6.11
KB
-rw-r--r--
basehttpserver.rst.txt
10.16
KB
-rw-r--r--
bastion.rst.txt
2.55
KB
-rw-r--r--
bdb.rst.txt
12.16
KB
-rw-r--r--
binascii.rst.txt
6.36
KB
-rw-r--r--
binhex.rst.txt
1.87
KB
-rw-r--r--
bisect.rst.txt
5.29
KB
-rw-r--r--
bsddb.rst.txt
7.4
KB
-rw-r--r--
bz2.rst.txt
7.88
KB
-rw-r--r--
calendar.rst.txt
11.02
KB
-rw-r--r--
carbon.rst.txt
15.58
KB
-rw-r--r--
cd.rst.txt
11.69
KB
-rw-r--r--
cgi.rst.txt
22.32
KB
-rw-r--r--
cgihttpserver.rst.txt
2.72
KB
-rw-r--r--
cgitb.rst.txt
2.81
KB
-rw-r--r--
chunk.rst.txt
4.84
KB
-rw-r--r--
cmath.rst.txt
7.47
KB
-rw-r--r--
cmd.rst.txt
8.36
KB
-rw-r--r--
code.rst.txt
6.95
KB
-rw-r--r--
codecs.rst.txt
65.4
KB
-rw-r--r--
codeop.rst.txt
3.69
KB
-rw-r--r--
collections.rst.txt
40.48
KB
-rw-r--r--
colorpicker.rst.txt
913
B
-rw-r--r--
colorsys.rst.txt
1.78
KB
-rw-r--r--
commands.rst.txt
2.53
KB
-rw-r--r--
compileall.rst.txt
4.57
KB
-rw-r--r--
compiler.rst.txt
36.59
KB
-rw-r--r--
configparser.rst.txt
19.15
KB
-rw-r--r--
constants.rst.txt
2.27
KB
-rw-r--r--
contextlib.rst.txt
5.87
KB
-rw-r--r--
cookie.rst.txt
9.32
KB
-rw-r--r--
cookielib.rst.txt
27.22
KB
-rw-r--r--
copy.rst.txt
3.27
KB
-rw-r--r--
copy_reg.rst.txt
2.27
KB
-rw-r--r--
crypt.rst.txt
2.24
KB
-rw-r--r--
crypto.rst.txt
355
B
-rw-r--r--
csv.rst.txt
22.22
KB
-rw-r--r--
ctypes.rst.txt
88.39
KB
-rw-r--r--
curses.ascii.rst.txt
8.83
KB
-rw-r--r--
curses.panel.rst.txt
2.68
KB
-rw-r--r--
curses.rst.txt
73.12
KB
-rw-r--r--
custominterp.rst.txt
570
B
-rw-r--r--
datatypes.rst.txt
864
B
-rw-r--r--
datetime.rst.txt
72.93
KB
-rw-r--r--
dbhash.rst.txt
3.77
KB
-rw-r--r--
dbm.rst.txt
3.04
KB
-rw-r--r--
debug.rst.txt
446
B
-rw-r--r--
decimal.rst.txt
69.26
KB
-rw-r--r--
development.rst.txt
640
B
-rw-r--r--
difflib.rst.txt
30
KB
-rw-r--r--
dircache.rst.txt
1.77
KB
-rw-r--r--
dis.rst.txt
22.7
KB
-rw-r--r--
distribution.rst.txt
426
B
-rw-r--r--
distutils.rst.txt
1.91
KB
-rw-r--r--
dl.rst.txt
3.31
KB
-rw-r--r--
doctest.rst.txt
72.25
KB
-rw-r--r--
docxmlrpcserver.rst.txt
3.71
KB
-rw-r--r--
dumbdbm.rst.txt
2.77
KB
-rw-r--r--
dummy_thread.rst.txt
1.03
KB
-rw-r--r--
dummy_threading.rst.txt
799
B
-rw-r--r--
easydialogs.rst.txt
10.1
KB
-rw-r--r--
email-examples.rst.txt
1.24
KB
-rw-r--r--
email.charset.rst.txt
9.43
KB
-rw-r--r--
email.encoders.rst.txt
2.32
KB
-rw-r--r--
email.errors.rst.txt
3.91
KB
-rw-r--r--
email.generator.rst.txt
5.99
KB
-rw-r--r--
email.header.rst.txt
7.35
KB
-rw-r--r--
email.iterators.rst.txt
2.36
KB
-rw-r--r--
email.message.rst.txt
24.63
KB
-rw-r--r--
email.mime.rst.txt
9.68
KB
-rw-r--r--
email.parser.rst.txt
10.08
KB
-rw-r--r--
email.rst.txt
15.73
KB
-rw-r--r--
email.utils.rst.txt
6.32
KB
-rw-r--r--
ensurepip.rst.txt
4.9
KB
-rw-r--r--
errno.rst.txt
6.55
KB
-rw-r--r--
exceptions.rst.txt
18.03
KB
-rw-r--r--
fcntl.rst.txt
7.19
KB
-rw-r--r--
filecmp.rst.txt
5.22
KB
-rw-r--r--
fileformats.rst.txt
302
B
-rw-r--r--
fileinput.rst.txt
7.24
KB
-rw-r--r--
filesys.rst.txt
806
B
-rw-r--r--
fl.rst.txt
17.23
KB
-rw-r--r--
fm.rst.txt
2.64
KB
-rw-r--r--
fnmatch.rst.txt
3.03
KB
-rw-r--r--
formatter.rst.txt
12.93
KB
-rw-r--r--
fpectl.rst.txt
4.07
KB
-rw-r--r--
fpformat.rst.txt
1.71
KB
-rw-r--r--
fractions.rst.txt
5.17
KB
-rw-r--r--
framework.rst.txt
11.18
KB
-rw-r--r--
frameworks.rst.txt
378
B
-rw-r--r--
ftplib.rst.txt
15.35
KB
-rw-r--r--
functions.rst.txt
73.75
KB
-rw-r--r--
functools.rst.txt
7.27
KB
-rw-r--r--
future_builtins.rst.txt
1.96
KB
-rw-r--r--
gc.rst.txt
8.8
KB
-rw-r--r--
gdbm.rst.txt
4.77
KB
-rw-r--r--
gensuitemodule.rst.txt
3.04
KB
-rw-r--r--
getopt.rst.txt
6.51
KB
-rw-r--r--
getpass.rst.txt
1.83
KB
-rw-r--r--
gettext.rst.txt
28.36
KB
-rw-r--r--
gl.rst.txt
5.87
KB
-rw-r--r--
glob.rst.txt
2.36
KB
-rw-r--r--
grp.rst.txt
2.2
KB
-rw-r--r--
gzip.rst.txt
4.71
KB
-rw-r--r--
hashlib.rst.txt
7.21
KB
-rw-r--r--
heapq.rst.txt
12.88
KB
-rw-r--r--
hmac.rst.txt
3
KB
-rw-r--r--
hotshot.rst.txt
4.19
KB
-rw-r--r--
htmllib.rst.txt
7.21
KB
-rw-r--r--
htmlparser.rst.txt
11.37
KB
-rw-r--r--
httplib.rst.txt
36.58
KB
-rw-r--r--
i18n.rst.txt
409
B
-rw-r--r--
ic.rst.txt
4.89
KB
-rw-r--r--
idle.rst.txt
21.66
KB
-rw-r--r--
imageop.rst.txt
3.91
KB
-rw-r--r--
imaplib.rst.txt
16.82
KB
-rw-r--r--
imgfile.rst.txt
2.7
KB
-rw-r--r--
imghdr.rst.txt
2.57
KB
-rw-r--r--
imp.rst.txt
12.3
KB
-rw-r--r--
importlib.rst.txt
1.1
KB
-rw-r--r--
imputil.rst.txt
6.86
KB
-rw-r--r--
index.rst.txt
2.23
KB
-rw-r--r--
inspect.rst.txt
27.49
KB
-rw-r--r--
internet.rst.txt
950
B
-rw-r--r--
intro.rst.txt
2.74
KB
-rw-r--r--
io.rst.txt
38.11
KB
-rw-r--r--
ipc.rst.txt
630
B
-rw-r--r--
itertools.rst.txt
35.67
KB
-rw-r--r--
jpeg.rst.txt
3.77
KB
-rw-r--r--
json.rst.txt
24.95
KB
-rw-r--r--
keyword.rst.txt
617
B
-rw-r--r--
language.rst.txt
523
B
-rw-r--r--
linecache.rst.txt
1.84
KB
-rw-r--r--
locale.rst.txt
24.39
KB
-rw-r--r--
logging.config.rst.txt
30.82
KB
-rw-r--r--
logging.handlers.rst.txt
27.49
KB
-rw-r--r--
logging.rst.txt
45.78
KB
-rw-r--r--
mac.rst.txt
791
B
-rw-r--r--
macos.rst.txt
3.73
KB
-rw-r--r--
macosa.rst.txt
3.87
KB
-rw-r--r--
macostools.rst.txt
3.92
KB
-rw-r--r--
macpath.rst.txt
650
B
-rw-r--r--
mailbox.rst.txt
66.53
KB
-rw-r--r--
mailcap.rst.txt
3.59
KB
-rw-r--r--
markup.rst.txt
1.22
KB
-rw-r--r--
marshal.rst.txt
5.56
KB
-rw-r--r--
math.rst.txt
10.66
KB
-rw-r--r--
md5.rst.txt
2.75
KB
-rw-r--r--
mhlib.rst.txt
3.87
KB
-rw-r--r--
mimetools.rst.txt
4.4
KB
-rw-r--r--
mimetypes.rst.txt
9.61
KB
-rw-r--r--
mimewriter.rst.txt
3.28
KB
-rw-r--r--
mimify.rst.txt
3.44
KB
-rw-r--r--
miniaeframe.rst.txt
2.5
KB
-rw-r--r--
misc.rst.txt
248
B
-rw-r--r--
mm.rst.txt
447
B
-rw-r--r--
mmap.rst.txt
10.24
KB
-rw-r--r--
modulefinder.rst.txt
3.3
KB
-rw-r--r--
modules.rst.txt
382
B
-rw-r--r--
msilib.rst.txt
18.62
KB
-rw-r--r--
msvcrt.rst.txt
4.24
KB
-rw-r--r--
multifile.rst.txt
6.46
KB
-rw-r--r--
multiprocessing.rst.txt
90.45
KB
-rw-r--r--
mutex.rst.txt
1.89
KB
-rw-r--r--
netdata.rst.txt
432
B
-rw-r--r--
netrc.rst.txt
3.05
KB
-rw-r--r--
new.rst.txt
2.59
KB
-rw-r--r--
nis.rst.txt
2.06
KB
-rw-r--r--
nntplib.rst.txt
14.19
KB
-rw-r--r--
numbers.rst.txt
7.82
KB
-rw-r--r--
numeric.rst.txt
751
B
-rw-r--r--
operator.rst.txt
21.57
KB
-rw-r--r--
optparse.rst.txt
75.29
KB
-rw-r--r--
os.path.rst.txt
12.79
KB
-rw-r--r--
os.rst.txt
80.64
KB
-rw-r--r--
ossaudiodev.rst.txt
16.9
KB
-rw-r--r--
othergui.rst.txt
2.66
KB
-rw-r--r--
parser.rst.txt
15.02
KB
-rw-r--r--
pdb.rst.txt
15.67
KB
-rw-r--r--
persistence.rst.txt
826
B
-rw-r--r--
pickle.rst.txt
36.39
KB
-rw-r--r--
pickletools.rst.txt
1.95
KB
-rw-r--r--
pipes.rst.txt
3.7
KB
-rw-r--r--
pkgutil.rst.txt
7.53
KB
-rw-r--r--
platform.rst.txt
9.33
KB
-rw-r--r--
plistlib.rst.txt
4.04
KB
-rw-r--r--
popen2.rst.txt
6.86
KB
-rw-r--r--
poplib.rst.txt
6.07
KB
-rw-r--r--
posix.rst.txt
3.54
KB
-rw-r--r--
posixfile.rst.txt
7.03
KB
-rw-r--r--
pprint.rst.txt
8.86
KB
-rw-r--r--
profile.rst.txt
27.99
KB
-rw-r--r--
pty.rst.txt
1.72
KB
-rw-r--r--
pwd.rst.txt
2.66
KB
-rw-r--r--
py_compile.rst.txt
2.42
KB
-rw-r--r--
pyclbr.rst.txt
3.22
KB
-rw-r--r--
pydoc.rst.txt
3.99
KB
-rw-r--r--
pyexpat.rst.txt
28.21
KB
-rw-r--r--
python.rst.txt
514
B
-rw-r--r--
queue.rst.txt
6.87
KB
-rw-r--r--
quopri.rst.txt
2.61
KB
-rw-r--r--
random.rst.txt
13.01
KB
-rw-r--r--
re.rst.txt
53.81
KB
-rw-r--r--
readline.rst.txt
10.27
KB
-rw-r--r--
repr.rst.txt
4.61
KB
-rw-r--r--
resource.rst.txt
9.37
KB
-rw-r--r--
restricted.rst.txt
3.25
KB
-rw-r--r--
rexec.rst.txt
11.47
KB
-rw-r--r--
rfc822.rst.txt
13.71
KB
-rw-r--r--
rlcompleter.rst.txt
2.44
KB
-rw-r--r--
robotparser.rst.txt
2.14
KB
-rw-r--r--
runpy.rst.txt
6.78
KB
-rw-r--r--
sched.rst.txt
4.54
KB
-rw-r--r--
scrolledtext.rst.txt
1.35
KB
-rw-r--r--
select.rst.txt
20.26
KB
-rw-r--r--
sets.rst.txt
14.62
KB
-rw-r--r--
sgi.rst.txt
322
B
-rw-r--r--
sgmllib.rst.txt
10.41
KB
-rw-r--r--
sha.rst.txt
2.74
KB
-rw-r--r--
shelve.rst.txt
8.12
KB
-rw-r--r--
shlex.rst.txt
11.05
KB
-rw-r--r--
shutil.rst.txt
13.17
KB
-rw-r--r--
signal.rst.txt
10.47
KB
-rw-r--r--
simplehttpserver.rst.txt
4.45
KB
-rw-r--r--
simplexmlrpcserver.rst.txt
10.63
KB
-rw-r--r--
site.rst.txt
7.7
KB
-rw-r--r--
smtpd.rst.txt
2.41
KB
-rw-r--r--
smtplib.rst.txt
14.56
KB
-rw-r--r--
sndhdr.rst.txt
1.72
KB
-rw-r--r--
socket.rst.txt
39.81
KB
-rw-r--r--
socketserver.rst.txt
21.98
KB
-rw-r--r--
someos.rst.txt
599
B
-rw-r--r--
spwd.rst.txt
2.76
KB
-rw-r--r--
sqlite3.rst.txt
34.62
KB
-rw-r--r--
ssl.rst.txt
74.91
KB
-rw-r--r--
stat.rst.txt
7.6
KB
-rw-r--r--
statvfs.rst.txt
1.27
KB
-rw-r--r--
stdtypes.rst.txt
119.78
KB
-rw-r--r--
string.rst.txt
43.05
KB
-rw-r--r--
stringio.rst.txt
4.07
KB
-rw-r--r--
stringprep.rst.txt
4.14
KB
-rw-r--r--
strings.rst.txt
746
B
-rw-r--r--
struct.rst.txt
16.7
KB
-rw-r--r--
subprocess.rst.txt
32.86
KB
-rw-r--r--
sun.rst.txt
249
B
-rw-r--r--
sunau.rst.txt
6.96
KB
-rw-r--r--
sunaudio.rst.txt
5.71
KB
-rw-r--r--
symbol.rst.txt
975
B
-rw-r--r--
symtable.rst.txt
4.95
KB
-rw-r--r--
sys.rst.txt
46.4
KB
-rw-r--r--
sysconfig.rst.txt
7.46
KB
-rw-r--r--
syslog.rst.txt
3.84
KB
-rw-r--r--
tabnanny.rst.txt
1.95
KB
-rw-r--r--
tarfile.rst.txt
27.55
KB
-rw-r--r--
telnetlib.rst.txt
7.31
KB
-rw-r--r--
tempfile.rst.txt
10.26
KB
-rw-r--r--
termios.rst.txt
3.65
KB
-rw-r--r--
test.rst.txt
17.34
KB
-rw-r--r--
textwrap.rst.txt
8.47
KB
-rw-r--r--
thread.rst.txt
6.43
KB
-rw-r--r--
threading.rst.txt
31.77
KB
-rw-r--r--
time.rst.txt
25.41
KB
-rw-r--r--
timeit.rst.txt
11.33
KB
-rw-r--r--
tix.rst.txt
22.16
KB
-rw-r--r--
tk.rst.txt
1.57
KB
-rw-r--r--
tkinter.rst.txt
32.72
KB
-rw-r--r--
token.rst.txt
2.39
KB
-rw-r--r--
tokenize.rst.txt
5.44
KB
-rw-r--r--
trace.rst.txt
6.57
KB
-rw-r--r--
traceback.rst.txt
10.46
KB
-rw-r--r--
ttk.rst.txt
56.07
KB
-rw-r--r--
tty.rst.txt
1011
B
-rw-r--r--
turtle.rst.txt
62.59
KB
-rw-r--r--
types.rst.txt
6.05
KB
-rw-r--r--
undoc.rst.txt
6.4
KB
-rw-r--r--
unicodedata.rst.txt
5.59
KB
-rw-r--r--
unittest.rst.txt
81.01
KB
-rw-r--r--
unix.rst.txt
490
B
-rw-r--r--
urllib.rst.txt
24.38
KB
-rw-r--r--
urllib2.rst.txt
34.39
KB
-rw-r--r--
urlparse.rst.txt
16.56
KB
-rw-r--r--
user.rst.txt
2.68
KB
-rw-r--r--
userdict.rst.txt
9.07
KB
-rw-r--r--
uu.rst.txt
2.31
KB
-rw-r--r--
uuid.rst.txt
8.18
KB
-rw-r--r--
warnings.rst.txt
19.6
KB
-rw-r--r--
wave.rst.txt
4.93
KB
-rw-r--r--
weakref.rst.txt
12.62
KB
-rw-r--r--
webbrowser.rst.txt
9.63
KB
-rw-r--r--
whichdb.rst.txt
931
B
-rw-r--r--
windows.rst.txt
273
B
-rw-r--r--
winsound.rst.txt
4.95
KB
-rw-r--r--
wsgiref.rst.txt
29.85
KB
-rw-r--r--
xdrlib.rst.txt
7.89
KB
-rw-r--r--
xml.dom.minidom.rst.txt
10.95
KB
-rw-r--r--
xml.dom.pulldom.rst.txt
1.53
KB
-rw-r--r--
xml.dom.rst.txt
39.24
KB
-rw-r--r--
xml.etree.elementtree.rst.txt
34.87
KB
-rw-r--r--
xml.rst.txt
5.95
KB
-rw-r--r--
xml.sax.handler.rst.txt
15.01
KB
-rw-r--r--
xml.sax.reader.rst.txt
11.97
KB
-rw-r--r--
xml.sax.rst.txt
6.31
KB
-rw-r--r--
xml.sax.utils.rst.txt
3.48
KB
-rw-r--r--
xmlrpclib.rst.txt
22.03
KB
-rw-r--r--
zipfile.rst.txt
18.43
KB
-rw-r--r--
zipimport.rst.txt
5.82
KB
-rw-r--r--
zlib.rst.txt
12.47
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : multiprocessing.rst.txt
:mod:`multiprocessing` --- Process-based "threading" interface ============================================================== .. module:: multiprocessing :synopsis: Process-based "threading" interface. .. versionadded:: 2.6 Introduction ---------------------- :mod:`multiprocessing` is a package that supports spawning processes using an API similar to the :mod:`threading` module. The :mod:`multiprocessing` package offers both local and remote concurrency, effectively side-stepping the :term:`Global Interpreter Lock` by using subprocesses instead of threads. Due to this, the :mod:`multiprocessing` module allows the programmer to fully leverage multiple processors on a given machine. It runs on both Unix and Windows. The :mod:`multiprocessing` module also introduces APIs which do not have analogs in the :mod:`threading` module. A prime example of this is the :class:`Pool` object which offers a convenient means of parallelizing the execution of a function across multiple input values, distributing the input data across processes (data parallelism). The following example demonstrates the common practice of defining such functions in a module so that child processes can successfully import that module. This basic example of data parallelism using :class:`Pool`, :: from multiprocessing import Pool def f(x): return x*x if __name__ == '__main__': p = Pool(5) print(p.map(f, [1, 2, 3])) will print to standard output :: [1, 4, 9] The :class:`Process` class ~~~~~~~~~~~~~~~~~~~~~~~~~~ In :mod:`multiprocessing`, processes are spawned by creating a :class:`Process` object and then calling its :meth:`~Process.start` method. :class:`Process` follows the API of :class:`threading.Thread`. A trivial example of a multiprocess program is :: from multiprocessing import Process def f(name): print 'hello', name if __name__ == '__main__': p = Process(target=f, args=('bob',)) p.start() p.join() To show the individual process IDs involved, here is an expanded example:: from multiprocessing import Process import os def info(title): print title print 'module name:', __name__ if hasattr(os, 'getppid'): # only available on Unix print 'parent process:', os.getppid() print 'process id:', os.getpid() def f(name): info('function f') print 'hello', name if __name__ == '__main__': info('main line') p = Process(target=f, args=('bob',)) p.start() p.join() For an explanation of why (on Windows) the ``if __name__ == '__main__'`` part is necessary, see :ref:`multiprocessing-programming`. Exchanging objects between processes ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ :mod:`multiprocessing` supports two types of communication channel between processes: **Queues** The :class:`~multiprocessing.Queue` class is a near clone of :class:`Queue.Queue`. For example:: from multiprocessing import Process, Queue def f(q): q.put([42, None, 'hello']) if __name__ == '__main__': q = Queue() p = Process(target=f, args=(q,)) p.start() print q.get() # prints "[42, None, 'hello']" p.join() Queues are thread and process safe. **Pipes** The :func:`Pipe` function returns a pair of connection objects connected by a pipe which by default is duplex (two-way). For example:: from multiprocessing import Process, Pipe def f(conn): conn.send([42, None, 'hello']) conn.close() if __name__ == '__main__': parent_conn, child_conn = Pipe() p = Process(target=f, args=(child_conn,)) p.start() print parent_conn.recv() # prints "[42, None, 'hello']" p.join() The two connection objects returned by :func:`Pipe` represent the two ends of the pipe. Each connection object has :meth:`~Connection.send` and :meth:`~Connection.recv` methods (among others). Note that data in a pipe may become corrupted if two processes (or threads) try to read from or write to the *same* end of the pipe at the same time. Of course there is no risk of corruption from processes using different ends of the pipe at the same time. Synchronization between processes ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ :mod:`multiprocessing` contains equivalents of all the synchronization primitives from :mod:`threading`. For instance one can use a lock to ensure that only one process prints to standard output at a time:: from multiprocessing import Process, Lock def f(l, i): l.acquire() print 'hello world', i l.release() if __name__ == '__main__': lock = Lock() for num in range(10): Process(target=f, args=(lock, num)).start() Without using the lock output from the different processes is liable to get all mixed up. Sharing state between processes ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ As mentioned above, when doing concurrent programming it is usually best to avoid using shared state as far as possible. This is particularly true when using multiple processes. However, if you really do need to use some shared data then :mod:`multiprocessing` provides a couple of ways of doing so. **Shared memory** Data can be stored in a shared memory map using :class:`Value` or :class:`Array`. For example, the following code :: from multiprocessing import Process, Value, Array def f(n, a): n.value = 3.1415927 for i in range(len(a)): a[i] = -a[i] if __name__ == '__main__': num = Value('d', 0.0) arr = Array('i', range(10)) p = Process(target=f, args=(num, arr)) p.start() p.join() print num.value print arr[:] will print :: 3.1415927 [0, -1, -2, -3, -4, -5, -6, -7, -8, -9] The ``'d'`` and ``'i'`` arguments used when creating ``num`` and ``arr`` are typecodes of the kind used by the :mod:`array` module: ``'d'`` indicates a double precision float and ``'i'`` indicates a signed integer. These shared objects will be process and thread-safe. For more flexibility in using shared memory one can use the :mod:`multiprocessing.sharedctypes` module which supports the creation of arbitrary ctypes objects allocated from shared memory. **Server process** A manager object returned by :func:`Manager` controls a server process which holds Python objects and allows other processes to manipulate them using proxies. A manager returned by :func:`Manager` will support types :class:`list`, :class:`dict`, :class:`~managers.Namespace`, :class:`Lock`, :class:`RLock`, :class:`Semaphore`, :class:`BoundedSemaphore`, :class:`Condition`, :class:`Event`, :class:`~multiprocessing.Queue`, :class:`Value` and :class:`Array`. For example, :: from multiprocessing import Process, Manager def f(d, l): d[1] = '1' d['2'] = 2 d[0.25] = None l.reverse() if __name__ == '__main__': manager = Manager() d = manager.dict() l = manager.list(range(10)) p = Process(target=f, args=(d, l)) p.start() p.join() print d print l will print :: {0.25: None, 1: '1', '2': 2} [9, 8, 7, 6, 5, 4, 3, 2, 1, 0] Server process managers are more flexible than using shared memory objects because they can be made to support arbitrary object types. Also, a single manager can be shared by processes on different computers over a network. They are, however, slower than using shared memory. Using a pool of workers ~~~~~~~~~~~~~~~~~~~~~~~ The :class:`~multiprocessing.pool.Pool` class represents a pool of worker processes. It has methods which allows tasks to be offloaded to the worker processes in a few different ways. For example:: from multiprocessing import Pool, TimeoutError import time import os def f(x): return x*x if __name__ == '__main__': pool = Pool(processes=4) # start 4 worker processes # print "[0, 1, 4,..., 81]" print pool.map(f, range(10)) # print same numbers in arbitrary order for i in pool.imap_unordered(f, range(10)): print i # evaluate "f(20)" asynchronously res = pool.apply_async(f, (20,)) # runs in *only* one process print res.get(timeout=1) # prints "400" # evaluate "os.getpid()" asynchronously res = pool.apply_async(os.getpid, ()) # runs in *only* one process print res.get(timeout=1) # prints the PID of that process # launching multiple evaluations asynchronously *may* use more processes multiple_results = [pool.apply_async(os.getpid, ()) for i in range(4)] print [res.get(timeout=1) for res in multiple_results] # make a single worker sleep for 10 secs res = pool.apply_async(time.sleep, (10,)) try: print res.get(timeout=1) except TimeoutError: print "We lacked patience and got a multiprocessing.TimeoutError" Note that the methods of a pool should only ever be used by the process which created it. .. note:: Functionality within this package requires that the ``__main__`` module be importable by the children. This is covered in :ref:`multiprocessing-programming` however it is worth pointing out here. This means that some examples, such as the :class:`Pool` examples will not work in the interactive interpreter. For example:: >>> from multiprocessing import Pool >>> p = Pool(5) >>> def f(x): ... return x*x ... >>> p.map(f, [1,2,3]) Process PoolWorker-1: Process PoolWorker-2: Process PoolWorker-3: Traceback (most recent call last): Traceback (most recent call last): Traceback (most recent call last): AttributeError: 'module' object has no attribute 'f' AttributeError: 'module' object has no attribute 'f' AttributeError: 'module' object has no attribute 'f' (If you try this it will actually output three full tracebacks interleaved in a semi-random fashion, and then you may have to stop the master process somehow.) Reference --------- The :mod:`multiprocessing` package mostly replicates the API of the :mod:`threading` module. :class:`Process` and exceptions ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ .. class:: Process(group=None, target=None, name=None, args=(), kwargs={}) Process objects represent activity that is run in a separate process. The :class:`Process` class has equivalents of all the methods of :class:`threading.Thread`. The constructor should always be called with keyword arguments. *group* should always be ``None``; it exists solely for compatibility with :class:`threading.Thread`. *target* is the callable object to be invoked by the :meth:`run()` method. It defaults to ``None``, meaning nothing is called. *name* is the process name. By default, a unique name is constructed of the form 'Process-N\ :sub:`1`:N\ :sub:`2`:...:N\ :sub:`k`' where N\ :sub:`1`,N\ :sub:`2`,...,N\ :sub:`k` is a sequence of integers whose length is determined by the *generation* of the process. *args* is the argument tuple for the target invocation. *kwargs* is a dictionary of keyword arguments for the target invocation. By default, no arguments are passed to *target*. If a subclass overrides the constructor, it must make sure it invokes the base class constructor (:meth:`Process.__init__`) before doing anything else to the process. .. method:: run() Method representing the process's activity. You may override this method in a subclass. The standard :meth:`run` method invokes the callable object passed to the object's constructor as the target argument, if any, with sequential and keyword arguments taken from the *args* and *kwargs* arguments, respectively. .. method:: start() Start the process's activity. This must be called at most once per process object. It arranges for the object's :meth:`run` method to be invoked in a separate process. .. method:: join([timeout]) Block the calling thread until the process whose :meth:`join` method is called terminates or until the optional timeout occurs. If *timeout* is ``None`` then there is no timeout. A process can be joined many times. A process cannot join itself because this would cause a deadlock. It is an error to attempt to join a process before it has been started. .. attribute:: name The process's name. The name is a string used for identification purposes only. It has no semantics. Multiple processes may be given the same name. The initial name is set by the constructor. .. method:: is_alive Return whether the process is alive. Roughly, a process object is alive from the moment the :meth:`start` method returns until the child process terminates. .. attribute:: daemon The process's daemon flag, a Boolean value. This must be set before :meth:`start` is called. The initial value is inherited from the creating process. When a process exits, it attempts to terminate all of its daemonic child processes. Note that a daemonic process is not allowed to create child processes. Otherwise a daemonic process would leave its children orphaned if it gets terminated when its parent process exits. Additionally, these are **not** Unix daemons or services, they are normal processes that will be terminated (and not joined) if non-daemonic processes have exited. In addition to the :class:`threading.Thread` API, :class:`Process` objects also support the following attributes and methods: .. attribute:: pid Return the process ID. Before the process is spawned, this will be ``None``. .. attribute:: exitcode The child's exit code. This will be ``None`` if the process has not yet terminated. A negative value *-N* indicates that the child was terminated by signal *N*. .. attribute:: authkey The process's authentication key (a byte string). When :mod:`multiprocessing` is initialized the main process is assigned a random string using :func:`os.urandom`. When a :class:`Process` object is created, it will inherit the authentication key of its parent process, although this may be changed by setting :attr:`authkey` to another byte string. See :ref:`multiprocessing-auth-keys`. .. method:: terminate() Terminate the process. On Unix this is done using the ``SIGTERM`` signal; on Windows :c:func:`TerminateProcess` is used. Note that exit handlers and finally clauses, etc., will not be executed. Note that descendant processes of the process will *not* be terminated -- they will simply become orphaned. .. warning:: If this method is used when the associated process is using a pipe or queue then the pipe or queue is liable to become corrupted and may become unusable by other process. Similarly, if the process has acquired a lock or semaphore etc. then terminating it is liable to cause other processes to deadlock. Note that the :meth:`start`, :meth:`join`, :meth:`is_alive`, :meth:`terminate` and :attr:`exitcode` methods should only be called by the process that created the process object. Example usage of some of the methods of :class:`Process`: .. doctest:: >>> import multiprocessing, time, signal >>> p = multiprocessing.Process(target=time.sleep, args=(1000,)) >>> print p, p.is_alive() <Process(Process-1, initial)> False >>> p.start() >>> print p, p.is_alive() <Process(Process-1, started)> True >>> p.terminate() >>> time.sleep(0.1) >>> print p, p.is_alive() <Process(Process-1, stopped[SIGTERM])> False >>> p.exitcode == -signal.SIGTERM True .. exception:: BufferTooShort Exception raised by :meth:`Connection.recv_bytes_into()` when the supplied buffer object is too small for the message read. If ``e`` is an instance of :exc:`BufferTooShort` then ``e.args[0]`` will give the message as a byte string. Pipes and Queues ~~~~~~~~~~~~~~~~ When using multiple processes, one generally uses message passing for communication between processes and avoids having to use any synchronization primitives like locks. For passing messages one can use :func:`Pipe` (for a connection between two processes) or a queue (which allows multiple producers and consumers). The :class:`~multiprocessing.Queue`, :class:`multiprocessing.queues.SimpleQueue` and :class:`JoinableQueue` types are multi-producer, multi-consumer FIFO queues modelled on the :class:`Queue.Queue` class in the standard library. They differ in that :class:`~multiprocessing.Queue` lacks the :meth:`~Queue.Queue.task_done` and :meth:`~Queue.Queue.join` methods introduced into Python 2.5's :class:`Queue.Queue` class. If you use :class:`JoinableQueue` then you **must** call :meth:`JoinableQueue.task_done` for each task removed from the queue or else the semaphore used to count the number of unfinished tasks may eventually overflow, raising an exception. Note that one can also create a shared queue by using a manager object -- see :ref:`multiprocessing-managers`. .. note:: :mod:`multiprocessing` uses the usual :exc:`Queue.Empty` and :exc:`Queue.Full` exceptions to signal a timeout. They are not available in the :mod:`multiprocessing` namespace so you need to import them from :mod:`Queue`. .. note:: When an object is put on a queue, the object is pickled and a background thread later flushes the pickled data to an underlying pipe. This has some consequences which are a little surprising, but should not cause any practical difficulties -- if they really bother you then you can instead use a queue created with a :ref:`manager <multiprocessing-managers>`. (1) After putting an object on an empty queue there may be an infinitesimal delay before the queue's :meth:`~Queue.empty` method returns :const:`False` and :meth:`~Queue.get_nowait` can return without raising :exc:`Queue.Empty`. (2) If multiple processes are enqueuing objects, it is possible for the objects to be received at the other end out-of-order. However, objects enqueued by the same process will always be in the expected order with respect to each other. .. warning:: If a process is killed using :meth:`Process.terminate` or :func:`os.kill` while it is trying to use a :class:`~multiprocessing.Queue`, then the data in the queue is likely to become corrupted. This may cause any other process to get an exception when it tries to use the queue later on. .. warning:: As mentioned above, if a child process has put items on a queue (and it has not used :meth:`JoinableQueue.cancel_join_thread <multiprocessing.Queue.cancel_join_thread>`), then that process will not terminate until all buffered items have been flushed to the pipe. This means that if you try joining that process you may get a deadlock unless you are sure that all items which have been put on the queue have been consumed. Similarly, if the child process is non-daemonic then the parent process may hang on exit when it tries to join all its non-daemonic children. Note that a queue created using a manager does not have this issue. See :ref:`multiprocessing-programming`. For an example of the usage of queues for interprocess communication see :ref:`multiprocessing-examples`. .. function:: Pipe([duplex]) Returns a pair ``(conn1, conn2)`` of :class:`Connection` objects representing the ends of a pipe. If *duplex* is ``True`` (the default) then the pipe is bidirectional. If *duplex* is ``False`` then the pipe is unidirectional: ``conn1`` can only be used for receiving messages and ``conn2`` can only be used for sending messages. .. class:: Queue([maxsize]) Returns a process shared queue implemented using a pipe and a few locks/semaphores. When a process first puts an item on the queue a feeder thread is started which transfers objects from a buffer into the pipe. The usual :exc:`Queue.Empty` and :exc:`Queue.Full` exceptions from the standard library's :mod:`Queue` module are raised to signal timeouts. :class:`~multiprocessing.Queue` implements all the methods of :class:`Queue.Queue` except for :meth:`~Queue.Queue.task_done` and :meth:`~Queue.Queue.join`. .. method:: qsize() Return the approximate size of the queue. Because of multithreading/multiprocessing semantics, this number is not reliable. Note that this may raise :exc:`NotImplementedError` on Unix platforms like Mac OS X where ``sem_getvalue()`` is not implemented. .. method:: empty() Return ``True`` if the queue is empty, ``False`` otherwise. Because of multithreading/multiprocessing semantics, this is not reliable. .. method:: full() Return ``True`` if the queue is full, ``False`` otherwise. Because of multithreading/multiprocessing semantics, this is not reliable. .. method:: put(obj[, block[, timeout]]) Put obj into the queue. If the optional argument *block* is ``True`` (the default) and *timeout* is ``None`` (the default), block if necessary until a free slot is available. If *timeout* is a positive number, it blocks at most *timeout* seconds and raises the :exc:`Queue.Full` exception if no free slot was available within that time. Otherwise (*block* is ``False``), put an item on the queue if a free slot is immediately available, else raise the :exc:`Queue.Full` exception (*timeout* is ignored in that case). .. method:: put_nowait(obj) Equivalent to ``put(obj, False)``. .. method:: get([block[, timeout]]) Remove and return an item from the queue. If optional args *block* is ``True`` (the default) and *timeout* is ``None`` (the default), block if necessary until an item is available. If *timeout* is a positive number, it blocks at most *timeout* seconds and raises the :exc:`Queue.Empty` exception if no item was available within that time. Otherwise (block is ``False``), return an item if one is immediately available, else raise the :exc:`Queue.Empty` exception (*timeout* is ignored in that case). .. method:: get_nowait() Equivalent to ``get(False)``. :class:`~multiprocessing.Queue` has a few additional methods not found in :class:`Queue.Queue`. These methods are usually unnecessary for most code: .. method:: close() Indicate that no more data will be put on this queue by the current process. The background thread will quit once it has flushed all buffered data to the pipe. This is called automatically when the queue is garbage collected. .. method:: join_thread() Join the background thread. This can only be used after :meth:`close` has been called. It blocks until the background thread exits, ensuring that all data in the buffer has been flushed to the pipe. By default if a process is not the creator of the queue then on exit it will attempt to join the queue's background thread. The process can call :meth:`cancel_join_thread` to make :meth:`join_thread` do nothing. .. method:: cancel_join_thread() Prevent :meth:`join_thread` from blocking. In particular, this prevents the background thread from being joined automatically when the process exits -- see :meth:`join_thread`. A better name for this method might be ``allow_exit_without_flush()``. It is likely to cause enqueued data to lost, and you almost certainly will not need to use it. It is really only there if you need the current process to exit immediately without waiting to flush enqueued data to the underlying pipe, and you don't care about lost data. .. note:: This class's functionality requires a functioning shared semaphore implementation on the host operating system. Without one, the functionality in this class will be disabled, and attempts to instantiate a :class:`Queue` will result in an :exc:`ImportError`. See :issue:`3770` for additional information. The same holds true for any of the specialized queue types listed below. .. class:: multiprocessing.queues.SimpleQueue() It is a simplified :class:`~multiprocessing.Queue` type, very close to a locked :class:`Pipe`. .. method:: empty() Return ``True`` if the queue is empty, ``False`` otherwise. .. method:: get() Remove and return an item from the queue. .. method:: put(item) Put *item* into the queue. .. class:: JoinableQueue([maxsize]) :class:`JoinableQueue`, a :class:`~multiprocessing.Queue` subclass, is a queue which additionally has :meth:`task_done` and :meth:`join` methods. .. method:: task_done() Indicate that a formerly enqueued task is complete. Used by queue consumer threads. For each :meth:`~Queue.get` used to fetch a task, a subsequent call to :meth:`task_done` tells the queue that the processing on the task is complete. If a :meth:`~Queue.Queue.join` is currently blocking, it will resume when all items have been processed (meaning that a :meth:`task_done` call was received for every item that had been :meth:`~Queue.put` into the queue). Raises a :exc:`ValueError` if called more times than there were items placed in the queue. .. method:: join() Block until all items in the queue have been gotten and processed. The count of unfinished tasks goes up whenever an item is added to the queue. The count goes down whenever a consumer thread calls :meth:`task_done` to indicate that the item was retrieved and all work on it is complete. When the count of unfinished tasks drops to zero, :meth:`~Queue.Queue.join` unblocks. Miscellaneous ~~~~~~~~~~~~~ .. function:: active_children() Return list of all live children of the current process. Calling this has the side effect of "joining" any processes which have already finished. .. function:: cpu_count() Return the number of CPUs in the system. May raise :exc:`NotImplementedError`. .. function:: current_process() Return the :class:`Process` object corresponding to the current process. An analogue of :func:`threading.current_thread`. .. function:: freeze_support() Add support for when a program which uses :mod:`multiprocessing` has been frozen to produce a Windows executable. (Has been tested with **py2exe**, **PyInstaller** and **cx_Freeze**.) One needs to call this function straight after the ``if __name__ == '__main__'`` line of the main module. For example:: from multiprocessing import Process, freeze_support def f(): print 'hello world!' if __name__ == '__main__': freeze_support() Process(target=f).start() If the ``freeze_support()`` line is omitted then trying to run the frozen executable will raise :exc:`RuntimeError`. Calling ``freeze_support()`` has no effect when invoked on any operating system other than Windows. In addition, if the module is being run normally by the Python interpreter on Windows (the program has not been frozen), then ``freeze_support()`` has no effect. .. function:: set_executable() Sets the path of the Python interpreter to use when starting a child process. (By default :data:`sys.executable` is used). Embedders will probably need to do some thing like :: set_executable(os.path.join(sys.exec_prefix, 'pythonw.exe')) before they can create child processes. (Windows only) .. note:: :mod:`multiprocessing` contains no analogues of :func:`threading.active_count`, :func:`threading.enumerate`, :func:`threading.settrace`, :func:`threading.setprofile`, :class:`threading.Timer`, or :class:`threading.local`. Connection Objects ~~~~~~~~~~~~~~~~~~ .. currentmodule:: None Connection objects allow the sending and receiving of picklable objects or strings. They can be thought of as message oriented connected sockets. Connection objects are usually created using :func:`Pipe <multiprocessing.Pipe>` -- see also :ref:`multiprocessing-listeners-clients`. .. class:: Connection .. method:: send(obj) Send an object to the other end of the connection which should be read using :meth:`recv`. The object must be picklable. Very large pickles (approximately 32 MB+, though it depends on the OS) may raise a :exc:`ValueError` exception. .. method:: recv() Return an object sent from the other end of the connection using :meth:`send`. Blocks until there is something to receive. Raises :exc:`EOFError` if there is nothing left to receive and the other end was closed. .. method:: fileno() Return the file descriptor or handle used by the connection. .. method:: close() Close the connection. This is called automatically when the connection is garbage collected. .. method:: poll([timeout]) Return whether there is any data available to be read. If *timeout* is not specified then it will return immediately. If *timeout* is a number then this specifies the maximum time in seconds to block. If *timeout* is ``None`` then an infinite timeout is used. .. method:: send_bytes(buffer[, offset[, size]]) Send byte data from an object supporting the buffer interface as a complete message. If *offset* is given then data is read from that position in *buffer*. If *size* is given then that many bytes will be read from buffer. Very large buffers (approximately 32 MB+, though it depends on the OS) may raise a :exc:`ValueError` exception .. method:: recv_bytes([maxlength]) Return a complete message of byte data sent from the other end of the connection as a string. Blocks until there is something to receive. Raises :exc:`EOFError` if there is nothing left to receive and the other end has closed. If *maxlength* is specified and the message is longer than *maxlength* then :exc:`IOError` is raised and the connection will no longer be readable. .. method:: recv_bytes_into(buffer[, offset]) Read into *buffer* a complete message of byte data sent from the other end of the connection and return the number of bytes in the message. Blocks until there is something to receive. Raises :exc:`EOFError` if there is nothing left to receive and the other end was closed. *buffer* must be an object satisfying the writable buffer interface. If *offset* is given then the message will be written into the buffer from that position. Offset must be a non-negative integer less than the length of *buffer* (in bytes). If the buffer is too short then a :exc:`BufferTooShort` exception is raised and the complete message is available as ``e.args[0]`` where ``e`` is the exception instance. For example: .. doctest:: >>> from multiprocessing import Pipe >>> a, b = Pipe() >>> a.send([1, 'hello', None]) >>> b.recv() [1, 'hello', None] >>> b.send_bytes('thank you') >>> a.recv_bytes() 'thank you' >>> import array >>> arr1 = array.array('i', range(5)) >>> arr2 = array.array('i', [0] * 10) >>> a.send_bytes(arr1) >>> count = b.recv_bytes_into(arr2) >>> assert count == len(arr1) * arr1.itemsize >>> arr2 array('i', [0, 1, 2, 3, 4, 0, 0, 0, 0, 0]) .. warning:: The :meth:`Connection.recv` method automatically unpickles the data it receives, which can be a security risk unless you can trust the process which sent the message. Therefore, unless the connection object was produced using :func:`Pipe` you should only use the :meth:`~Connection.recv` and :meth:`~Connection.send` methods after performing some sort of authentication. See :ref:`multiprocessing-auth-keys`. .. warning:: If a process is killed while it is trying to read or write to a pipe then the data in the pipe is likely to become corrupted, because it may become impossible to be sure where the message boundaries lie. Synchronization primitives ~~~~~~~~~~~~~~~~~~~~~~~~~~ .. currentmodule:: multiprocessing Generally synchronization primitives are not as necessary in a multiprocess program as they are in a multithreaded program. See the documentation for :mod:`threading` module. Note that one can also create synchronization primitives by using a manager object -- see :ref:`multiprocessing-managers`. .. class:: BoundedSemaphore([value]) A bounded semaphore object: a close analog of :class:`threading.BoundedSemaphore`. A solitary difference from its close analog exists: its ``acquire`` method's first argument is named *block* and it supports an optional second argument *timeout*, as is consistent with :meth:`Lock.acquire`. .. note:: On Mac OS X, this is indistinguishable from :class:`Semaphore` because ``sem_getvalue()`` is not implemented on that platform. .. class:: Condition([lock]) A condition variable: a clone of :class:`threading.Condition`. If *lock* is specified then it should be a :class:`Lock` or :class:`RLock` object from :mod:`multiprocessing`. .. class:: Event() A clone of :class:`threading.Event`. This method returns the state of the internal semaphore on exit, so it will always return ``True`` except if a timeout is given and the operation times out. .. versionchanged:: 2.7 Previously, the method always returned ``None``. .. class:: Lock() A non-recursive lock object: a close analog of :class:`threading.Lock`. Once a process or thread has acquired a lock, subsequent attempts to acquire it from any process or thread will block until it is released; any process or thread may release it. The concepts and behaviors of :class:`threading.Lock` as it applies to threads are replicated here in :class:`multiprocessing.Lock` as it applies to either processes or threads, except as noted. Note that :class:`Lock` is actually a factory function which returns an instance of ``multiprocessing.synchronize.Lock`` initialized with a default context. :class:`Lock` supports the :term:`context manager` protocol and thus may be used in :keyword:`with` statements. .. method:: acquire(block=True, timeout=None) Acquire a lock, blocking or non-blocking. With the *block* argument set to ``True`` (the default), the method call will block until the lock is in an unlocked state, then set it to locked and return ``True``. Note that the name of this first argument differs from that in :meth:`threading.Lock.acquire`. With the *block* argument set to ``False``, the method call does not block. If the lock is currently in a locked state, return ``False``; otherwise set the lock to a locked state and return ``True``. When invoked with a positive, floating-point value for *timeout*, block for at most the number of seconds specified by *timeout* as long as the lock can not be acquired. Invocations with a negative value for *timeout* are equivalent to a *timeout* of zero. Invocations with a *timeout* value of ``None`` (the default) set the timeout period to infinite. The *timeout* argument has no practical implications if the *block* argument is set to ``False`` and is thus ignored. Returns ``True`` if the lock has been acquired or ``False`` if the timeout period has elapsed. Note that the *timeout* argument does not exist in this method's analog, :meth:`threading.Lock.acquire`. .. method:: release() Release a lock. This can be called from any process or thread, not only the process or thread which originally acquired the lock. Behavior is the same as in :meth:`threading.Lock.release` except that when invoked on an unlocked lock, a :exc:`ValueError` is raised. .. class:: RLock() A recursive lock object: a close analog of :class:`threading.RLock`. A recursive lock must be released by the process or thread that acquired it. Once a process or thread has acquired a recursive lock, the same process or thread may acquire it again without blocking; that process or thread must release it once for each time it has been acquired. Note that :class:`RLock` is actually a factory function which returns an instance of ``multiprocessing.synchronize.RLock`` initialized with a default context. :class:`RLock` supports the :term:`context manager` protocol and thus may be used in :keyword:`with` statements. .. method:: acquire(block=True, timeout=None) Acquire a lock, blocking or non-blocking. When invoked with the *block* argument set to ``True``, block until the lock is in an unlocked state (not owned by any process or thread) unless the lock is already owned by the current process or thread. The current process or thread then takes ownership of the lock (if it does not already have ownership) and the recursion level inside the lock increments by one, resulting in a return value of ``True``. Note that there are several differences in this first argument's behavior compared to the implementation of :meth:`threading.RLock.acquire`, starting with the name of the argument itself. When invoked with the *block* argument set to ``False``, do not block. If the lock has already been acquired (and thus is owned) by another process or thread, the current process or thread does not take ownership and the recursion level within the lock is not changed, resulting in a return value of ``False``. If the lock is in an unlocked state, the current process or thread takes ownership and the recursion level is incremented, resulting in a return value of ``True``. Use and behaviors of the *timeout* argument are the same as in :meth:`Lock.acquire`. Note that the *timeout* argument does not exist in this method's analog, :meth:`threading.RLock.acquire`. .. method:: release() Release a lock, decrementing the recursion level. If after the decrement the recursion level is zero, reset the lock to unlocked (not owned by any process or thread) and if any other processes or threads are blocked waiting for the lock to become unlocked, allow exactly one of them to proceed. If after the decrement the recursion level is still nonzero, the lock remains locked and owned by the calling process or thread. Only call this method when the calling process or thread owns the lock. An :exc:`AssertionError` is raised if this method is called by a process or thread other than the owner or if the lock is in an unlocked (unowned) state. Note that the type of exception raised in this situation differs from the implemented behavior in :meth:`threading.RLock.release`. .. class:: Semaphore([value]) A semaphore object: a close analog of :class:`threading.Semaphore`. A solitary difference from its close analog exists: its ``acquire`` method's first argument is named *block* and it supports an optional second argument *timeout*, as is consistent with :meth:`Lock.acquire`. .. note:: The :meth:`acquire` method of :class:`BoundedSemaphore`, :class:`Lock`, :class:`RLock` and :class:`Semaphore` has a timeout parameter not supported by the equivalents in :mod:`threading`. The signature is ``acquire(block=True, timeout=None)`` with keyword parameters being acceptable. If *block* is ``True`` and *timeout* is not ``None`` then it specifies a timeout in seconds. If *block* is ``False`` then *timeout* is ignored. On Mac OS X, ``sem_timedwait`` is unsupported, so calling ``acquire()`` with a timeout will emulate that function's behavior using a sleeping loop. .. note:: If the SIGINT signal generated by :kbd:`Ctrl-C` arrives while the main thread is blocked by a call to :meth:`BoundedSemaphore.acquire`, :meth:`Lock.acquire`, :meth:`RLock.acquire`, :meth:`Semaphore.acquire`, :meth:`Condition.acquire` or :meth:`Condition.wait` then the call will be immediately interrupted and :exc:`KeyboardInterrupt` will be raised. This differs from the behaviour of :mod:`threading` where SIGINT will be ignored while the equivalent blocking calls are in progress. .. note:: Some of this package's functionality requires a functioning shared semaphore implementation on the host operating system. Without one, the :mod:`multiprocessing.synchronize` module will be disabled, and attempts to import it will result in an :exc:`ImportError`. See :issue:`3770` for additional information. Shared :mod:`ctypes` Objects ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ It is possible to create shared objects using shared memory which can be inherited by child processes. .. function:: Value(typecode_or_type, *args[, lock]) Return a :mod:`ctypes` object allocated from shared memory. By default the return value is actually a synchronized wrapper for the object. *typecode_or_type* determines the type of the returned object: it is either a ctypes type or a one character typecode of the kind used by the :mod:`array` module. *\*args* is passed on to the constructor for the type. If *lock* is ``True`` (the default) then a new recursive lock object is created to synchronize access to the value. If *lock* is a :class:`Lock` or :class:`RLock` object then that will be used to synchronize access to the value. If *lock* is ``False`` then access to the returned object will not be automatically protected by a lock, so it will not necessarily be "process-safe". Operations like ``+=`` which involve a read and write are not atomic. So if, for instance, you want to atomically increment a shared value it is insufficient to just do :: counter.value += 1 Assuming the associated lock is recursive (which it is by default) you can instead do :: with counter.get_lock(): counter.value += 1 Note that *lock* is a keyword-only argument. .. function:: Array(typecode_or_type, size_or_initializer, *, lock=True) Return a ctypes array allocated from shared memory. By default the return value is actually a synchronized wrapper for the array. *typecode_or_type* determines the type of the elements of the returned array: it is either a ctypes type or a one character typecode of the kind used by the :mod:`array` module. If *size_or_initializer* is an integer, then it determines the length of the array, and the array will be initially zeroed. Otherwise, *size_or_initializer* is a sequence which is used to initialize the array and whose length determines the length of the array. If *lock* is ``True`` (the default) then a new lock object is created to synchronize access to the value. If *lock* is a :class:`Lock` or :class:`RLock` object then that will be used to synchronize access to the value. If *lock* is ``False`` then access to the returned object will not be automatically protected by a lock, so it will not necessarily be "process-safe". Note that *lock* is a keyword only argument. Note that an array of :data:`ctypes.c_char` has *value* and *raw* attributes which allow one to use it to store and retrieve strings. The :mod:`multiprocessing.sharedctypes` module >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> .. module:: multiprocessing.sharedctypes :synopsis: Allocate ctypes objects from shared memory. The :mod:`multiprocessing.sharedctypes` module provides functions for allocating :mod:`ctypes` objects from shared memory which can be inherited by child processes. .. note:: Although it is possible to store a pointer in shared memory remember that this will refer to a location in the address space of a specific process. However, the pointer is quite likely to be invalid in the context of a second process and trying to dereference the pointer from the second process may cause a crash. .. function:: RawArray(typecode_or_type, size_or_initializer) Return a ctypes array allocated from shared memory. *typecode_or_type* determines the type of the elements of the returned array: it is either a ctypes type or a one character typecode of the kind used by the :mod:`array` module. If *size_or_initializer* is an integer then it determines the length of the array, and the array will be initially zeroed. Otherwise *size_or_initializer* is a sequence which is used to initialize the array and whose length determines the length of the array. Note that setting and getting an element is potentially non-atomic -- use :func:`Array` instead to make sure that access is automatically synchronized using a lock. .. function:: RawValue(typecode_or_type, *args) Return a ctypes object allocated from shared memory. *typecode_or_type* determines the type of the returned object: it is either a ctypes type or a one character typecode of the kind used by the :mod:`array` module. *\*args* is passed on to the constructor for the type. Note that setting and getting the value is potentially non-atomic -- use :func:`Value` instead to make sure that access is automatically synchronized using a lock. Note that an array of :data:`ctypes.c_char` has ``value`` and ``raw`` attributes which allow one to use it to store and retrieve strings -- see documentation for :mod:`ctypes`. .. function:: Array(typecode_or_type, size_or_initializer, *args[, lock]) The same as :func:`RawArray` except that depending on the value of *lock* a process-safe synchronization wrapper may be returned instead of a raw ctypes array. If *lock* is ``True`` (the default) then a new lock object is created to synchronize access to the value. If *lock* is a :class:`~multiprocessing.Lock` or :class:`~multiprocessing.RLock` object then that will be used to synchronize access to the value. If *lock* is ``False`` then access to the returned object will not be automatically protected by a lock, so it will not necessarily be "process-safe". Note that *lock* is a keyword-only argument. .. function:: Value(typecode_or_type, *args[, lock]) The same as :func:`RawValue` except that depending on the value of *lock* a process-safe synchronization wrapper may be returned instead of a raw ctypes object. If *lock* is ``True`` (the default) then a new lock object is created to synchronize access to the value. If *lock* is a :class:`~multiprocessing.Lock` or :class:`~multiprocessing.RLock` object then that will be used to synchronize access to the value. If *lock* is ``False`` then access to the returned object will not be automatically protected by a lock, so it will not necessarily be "process-safe". Note that *lock* is a keyword-only argument. .. function:: copy(obj) Return a ctypes object allocated from shared memory which is a copy of the ctypes object *obj*. .. function:: synchronized(obj[, lock]) Return a process-safe wrapper object for a ctypes object which uses *lock* to synchronize access. If *lock* is ``None`` (the default) then a :class:`multiprocessing.RLock` object is created automatically. A synchronized wrapper will have two methods in addition to those of the object it wraps: :meth:`get_obj` returns the wrapped object and :meth:`get_lock` returns the lock object used for synchronization. Note that accessing the ctypes object through the wrapper can be a lot slower than accessing the raw ctypes object. The table below compares the syntax for creating shared ctypes objects from shared memory with the normal ctypes syntax. (In the table ``MyStruct`` is some subclass of :class:`ctypes.Structure`.) ==================== ========================== =========================== ctypes sharedctypes using type sharedctypes using typecode ==================== ========================== =========================== c_double(2.4) RawValue(c_double, 2.4) RawValue('d', 2.4) MyStruct(4, 6) RawValue(MyStruct, 4, 6) (c_short * 7)() RawArray(c_short, 7) RawArray('h', 7) (c_int * 3)(9, 2, 8) RawArray(c_int, (9, 2, 8)) RawArray('i', (9, 2, 8)) ==================== ========================== =========================== Below is an example where a number of ctypes objects are modified by a child process:: from multiprocessing import Process, Lock from multiprocessing.sharedctypes import Value, Array from ctypes import Structure, c_double class Point(Structure): _fields_ = [('x', c_double), ('y', c_double)] def modify(n, x, s, A): n.value **= 2 x.value **= 2 s.value = s.value.upper() for a in A: a.x **= 2 a.y **= 2 if __name__ == '__main__': lock = Lock() n = Value('i', 7) x = Value(c_double, 1.0/3.0, lock=False) s = Array('c', 'hello world', lock=lock) A = Array(Point, [(1.875,-6.25), (-5.75,2.0), (2.375,9.5)], lock=lock) p = Process(target=modify, args=(n, x, s, A)) p.start() p.join() print n.value print x.value print s.value print [(a.x, a.y) for a in A] .. highlightlang:: none The results printed are :: 49 0.1111111111111111 HELLO WORLD [(3.515625, 39.0625), (33.0625, 4.0), (5.640625, 90.25)] .. highlightlang:: python .. _multiprocessing-managers: Managers ~~~~~~~~ Managers provide a way to create data which can be shared between different processes. A manager object controls a server process which manages *shared objects*. Other processes can access the shared objects by using proxies. .. function:: multiprocessing.Manager() Returns a started :class:`~multiprocessing.managers.SyncManager` object which can be used for sharing objects between processes. The returned manager object corresponds to a spawned child process and has methods which will create shared objects and return corresponding proxies. .. module:: multiprocessing.managers :synopsis: Share data between process with shared objects. Manager processes will be shutdown as soon as they are garbage collected or their parent process exits. The manager classes are defined in the :mod:`multiprocessing.managers` module: .. class:: BaseManager([address[, authkey]]) Create a BaseManager object. Once created one should call :meth:`start` or ``get_server().serve_forever()`` to ensure that the manager object refers to a started manager process. *address* is the address on which the manager process listens for new connections. If *address* is ``None`` then an arbitrary one is chosen. *authkey* is the authentication key which will be used to check the validity of incoming connections to the server process. If *authkey* is ``None`` then ``current_process().authkey``. Otherwise *authkey* is used and it must be a string. .. method:: start([initializer[, initargs]]) Start a subprocess to start the manager. If *initializer* is not ``None`` then the subprocess will call ``initializer(*initargs)`` when it starts. .. method:: get_server() Returns a :class:`Server` object which represents the actual server under the control of the Manager. The :class:`Server` object supports the :meth:`serve_forever` method:: >>> from multiprocessing.managers import BaseManager >>> manager = BaseManager(address=('', 50000), authkey='abc') >>> server = manager.get_server() >>> server.serve_forever() :class:`Server` additionally has an :attr:`address` attribute. .. method:: connect() Connect a local manager object to a remote manager process:: >>> from multiprocessing.managers import BaseManager >>> m = BaseManager(address=('127.0.0.1', 5000), authkey='abc') >>> m.connect() .. method:: shutdown() Stop the process used by the manager. This is only available if :meth:`start` has been used to start the server process. This can be called multiple times. .. method:: register(typeid[, callable[, proxytype[, exposed[, method_to_typeid[, create_method]]]]]) A classmethod which can be used for registering a type or callable with the manager class. *typeid* is a "type identifier" which is used to identify a particular type of shared object. This must be a string. *callable* is a callable used for creating objects for this type identifier. If a manager instance will be created using the :meth:`from_address` classmethod or if the *create_method* argument is ``False`` then this can be left as ``None``. *proxytype* is a subclass of :class:`BaseProxy` which is used to create proxies for shared objects with this *typeid*. If ``None`` then a proxy class is created automatically. *exposed* is used to specify a sequence of method names which proxies for this typeid should be allowed to access using :meth:`BaseProxy._callmethod`. (If *exposed* is ``None`` then :attr:`proxytype._exposed_` is used instead if it exists.) In the case where no exposed list is specified, all "public methods" of the shared object will be accessible. (Here a "public method" means any attribute which has a :meth:`~object.__call__` method and whose name does not begin with ``'_'``.) *method_to_typeid* is a mapping used to specify the return type of those exposed methods which should return a proxy. It maps method names to typeid strings. (If *method_to_typeid* is ``None`` then :attr:`proxytype._method_to_typeid_` is used instead if it exists.) If a method's name is not a key of this mapping or if the mapping is ``None`` then the object returned by the method will be copied by value. *create_method* determines whether a method should be created with name *typeid* which can be used to tell the server process to create a new shared object and return a proxy for it. By default it is ``True``. :class:`BaseManager` instances also have one read-only property: .. attribute:: address The address used by the manager. .. class:: SyncManager A subclass of :class:`BaseManager` which can be used for the synchronization of processes. Objects of this type are returned by :func:`multiprocessing.Manager`. It also supports creation of shared lists and dictionaries. .. method:: BoundedSemaphore([value]) Create a shared :class:`threading.BoundedSemaphore` object and return a proxy for it. .. method:: Condition([lock]) Create a shared :class:`threading.Condition` object and return a proxy for it. If *lock* is supplied then it should be a proxy for a :class:`threading.Lock` or :class:`threading.RLock` object. .. method:: Event() Create a shared :class:`threading.Event` object and return a proxy for it. .. method:: Lock() Create a shared :class:`threading.Lock` object and return a proxy for it. .. method:: Namespace() Create a shared :class:`Namespace` object and return a proxy for it. .. method:: Queue([maxsize]) Create a shared :class:`Queue.Queue` object and return a proxy for it. .. method:: RLock() Create a shared :class:`threading.RLock` object and return a proxy for it. .. method:: Semaphore([value]) Create a shared :class:`threading.Semaphore` object and return a proxy for it. .. method:: Array(typecode, sequence) Create an array and return a proxy for it. .. method:: Value(typecode, value) Create an object with a writable ``value`` attribute and return a proxy for it. .. method:: dict() dict(mapping) dict(sequence) Create a shared ``dict`` object and return a proxy for it. .. method:: list() list(sequence) Create a shared ``list`` object and return a proxy for it. .. note:: Modifications to mutable values or items in dict and list proxies will not be propagated through the manager, because the proxy has no way of knowing when its values or items are modified. To modify such an item, you can re-assign the modified object to the container proxy:: # create a list proxy and append a mutable object (a dictionary) lproxy = manager.list() lproxy.append({}) # now mutate the dictionary d = lproxy[0] d['a'] = 1 d['b'] = 2 # at this point, the changes to d are not yet synced, but by # reassigning the dictionary, the proxy is notified of the change lproxy[0] = d .. class:: Namespace A type that can register with :class:`SyncManager`. A namespace object has no public methods, but does have writable attributes. Its representation shows the values of its attributes. However, when using a proxy for a namespace object, an attribute beginning with ``'_'`` will be an attribute of the proxy and not an attribute of the referent: .. doctest:: >>> manager = multiprocessing.Manager() >>> Global = manager.Namespace() >>> Global.x = 10 >>> Global.y = 'hello' >>> Global._z = 12.3 # this is an attribute of the proxy >>> print Global Namespace(x=10, y='hello') Customized managers >>>>>>>>>>>>>>>>>>> To create one's own manager, one creates a subclass of :class:`BaseManager` and uses the :meth:`~BaseManager.register` classmethod to register new types or callables with the manager class. For example:: from multiprocessing.managers import BaseManager class MathsClass(object): def add(self, x, y): return x + y def mul(self, x, y): return x * y class MyManager(BaseManager): pass MyManager.register('Maths', MathsClass) if __name__ == '__main__': manager = MyManager() manager.start() maths = manager.Maths() print maths.add(4, 3) # prints 7 print maths.mul(7, 8) # prints 56 Using a remote manager >>>>>>>>>>>>>>>>>>>>>> It is possible to run a manager server on one machine and have clients use it from other machines (assuming that the firewalls involved allow it). Running the following commands creates a server for a single shared queue which remote clients can access:: >>> from multiprocessing.managers import BaseManager >>> import Queue >>> queue = Queue.Queue() >>> class QueueManager(BaseManager): pass >>> QueueManager.register('get_queue', callable=lambda:queue) >>> m = QueueManager(address=('', 50000), authkey='abracadabra') >>> s = m.get_server() >>> s.serve_forever() One client can access the server as follows:: >>> from multiprocessing.managers import BaseManager >>> class QueueManager(BaseManager): pass >>> QueueManager.register('get_queue') >>> m = QueueManager(address=('foo.bar.org', 50000), authkey='abracadabra') >>> m.connect() >>> queue = m.get_queue() >>> queue.put('hello') Another client can also use it:: >>> from multiprocessing.managers import BaseManager >>> class QueueManager(BaseManager): pass >>> QueueManager.register('get_queue') >>> m = QueueManager(address=('foo.bar.org', 50000), authkey='abracadabra') >>> m.connect() >>> queue = m.get_queue() >>> queue.get() 'hello' Local processes can also access that queue, using the code from above on the client to access it remotely:: >>> from multiprocessing import Process, Queue >>> from multiprocessing.managers import BaseManager >>> class Worker(Process): ... def __init__(self, q): ... self.q = q ... super(Worker, self).__init__() ... def run(self): ... self.q.put('local hello') ... >>> queue = Queue() >>> w = Worker(queue) >>> w.start() >>> class QueueManager(BaseManager): pass ... >>> QueueManager.register('get_queue', callable=lambda: queue) >>> m = QueueManager(address=('', 50000), authkey='abracadabra') >>> s = m.get_server() >>> s.serve_forever() Proxy Objects ~~~~~~~~~~~~~ A proxy is an object which *refers* to a shared object which lives (presumably) in a different process. The shared object is said to be the *referent* of the proxy. Multiple proxy objects may have the same referent. A proxy object has methods which invoke corresponding methods of its referent (although not every method of the referent will necessarily be available through the proxy). A proxy can usually be used in most of the same ways that its referent can: .. doctest:: >>> from multiprocessing import Manager >>> manager = Manager() >>> l = manager.list([i*i for i in range(10)]) >>> print l [0, 1, 4, 9, 16, 25, 36, 49, 64, 81] >>> print repr(l) <ListProxy object, typeid 'list' at 0x...> >>> l[4] 16 >>> l[2:5] [4, 9, 16] Notice that applying :func:`str` to a proxy will return the representation of the referent, whereas applying :func:`repr` will return the representation of the proxy. An important feature of proxy objects is that they are picklable so they can be passed between processes. Note, however, that if a proxy is sent to the corresponding manager's process then unpickling it will produce the referent itself. This means, for example, that one shared object can contain a second: .. doctest:: >>> a = manager.list() >>> b = manager.list() >>> a.append(b) # referent of a now contains referent of b >>> print a, b [[]] [] >>> b.append('hello') >>> print a, b [['hello']] ['hello'] .. note:: The proxy types in :mod:`multiprocessing` do nothing to support comparisons by value. So, for instance, we have: .. doctest:: >>> manager.list([1,2,3]) == [1,2,3] False One should just use a copy of the referent instead when making comparisons. .. class:: BaseProxy Proxy objects are instances of subclasses of :class:`BaseProxy`. .. method:: _callmethod(methodname[, args[, kwds]]) Call and return the result of a method of the proxy's referent. If ``proxy`` is a proxy whose referent is ``obj`` then the expression :: proxy._callmethod(methodname, args, kwds) will evaluate the expression :: getattr(obj, methodname)(*args, **kwds) in the manager's process. The returned value will be a copy of the result of the call or a proxy to a new shared object -- see documentation for the *method_to_typeid* argument of :meth:`BaseManager.register`. If an exception is raised by the call, then is re-raised by :meth:`_callmethod`. If some other exception is raised in the manager's process then this is converted into a :exc:`RemoteError` exception and is raised by :meth:`_callmethod`. Note in particular that an exception will be raised if *methodname* has not been *exposed*. An example of the usage of :meth:`_callmethod`: .. doctest:: >>> l = manager.list(range(10)) >>> l._callmethod('__len__') 10 >>> l._callmethod('__getslice__', (2, 7)) # equiv to `l[2:7]` [2, 3, 4, 5, 6] >>> l._callmethod('__getitem__', (20,)) # equiv to `l[20]` Traceback (most recent call last): ... IndexError: list index out of range .. method:: _getvalue() Return a copy of the referent. If the referent is unpicklable then this will raise an exception. .. method:: __repr__ Return a representation of the proxy object. .. method:: __str__ Return the representation of the referent. Cleanup >>>>>>> A proxy object uses a weakref callback so that when it gets garbage collected it deregisters itself from the manager which owns its referent. A shared object gets deleted from the manager process when there are no longer any proxies referring to it. Process Pools ~~~~~~~~~~~~~ .. module:: multiprocessing.pool :synopsis: Create pools of processes. One can create a pool of processes which will carry out tasks submitted to it with the :class:`Pool` class. .. class:: multiprocessing.Pool([processes[, initializer[, initargs[, maxtasksperchild]]]]) A process pool object which controls a pool of worker processes to which jobs can be submitted. It supports asynchronous results with timeouts and callbacks and has a parallel map implementation. *processes* is the number of worker processes to use. If *processes* is ``None`` then the number returned by :func:`cpu_count` is used. If *initializer* is not ``None`` then each worker process will call ``initializer(*initargs)`` when it starts. Note that the methods of the pool object should only be called by the process which created the pool. .. versionadded:: 2.7 *maxtasksperchild* is the number of tasks a worker process can complete before it will exit and be replaced with a fresh worker process, to enable unused resources to be freed. The default *maxtasksperchild* is ``None``, which means worker processes will live as long as the pool. .. note:: Worker processes within a :class:`Pool` typically live for the complete duration of the Pool's work queue. A frequent pattern found in other systems (such as Apache, mod_wsgi, etc) to free resources held by workers is to allow a worker within a pool to complete only a set amount of work before being exiting, being cleaned up and a new process spawned to replace the old one. The *maxtasksperchild* argument to the :class:`Pool` exposes this ability to the end user. .. method:: apply(func[, args[, kwds]]) Equivalent of the :func:`apply` built-in function. It blocks until the result is ready, so :meth:`apply_async` is better suited for performing work in parallel. Additionally, *func* is only executed in one of the workers of the pool. .. method:: apply_async(func[, args[, kwds[, callback]]]) A variant of the :meth:`apply` method which returns a result object. If *callback* is specified then it should be a callable which accepts a single argument. When the result becomes ready *callback* is applied to it (unless the call failed). *callback* should complete immediately since otherwise the thread which handles the results will get blocked. .. method:: map(func, iterable[, chunksize]) A parallel equivalent of the :func:`map` built-in function (it supports only one *iterable* argument though). It blocks until the result is ready. This method chops the iterable into a number of chunks which it submits to the process pool as separate tasks. The (approximate) size of these chunks can be specified by setting *chunksize* to a positive integer. .. method:: map_async(func, iterable[, chunksize[, callback]]) A variant of the :meth:`.map` method which returns a result object. If *callback* is specified then it should be a callable which accepts a single argument. When the result becomes ready *callback* is applied to it (unless the call failed). *callback* should complete immediately since otherwise the thread which handles the results will get blocked. .. method:: imap(func, iterable[, chunksize]) An equivalent of :func:`itertools.imap`. The *chunksize* argument is the same as the one used by the :meth:`.map` method. For very long iterables using a large value for *chunksize* can make the job complete **much** faster than using the default value of ``1``. Also if *chunksize* is ``1`` then the :meth:`!next` method of the iterator returned by the :meth:`imap` method has an optional *timeout* parameter: ``next(timeout)`` will raise :exc:`multiprocessing.TimeoutError` if the result cannot be returned within *timeout* seconds. .. method:: imap_unordered(func, iterable[, chunksize]) The same as :meth:`imap` except that the ordering of the results from the returned iterator should be considered arbitrary. (Only when there is only one worker process is the order guaranteed to be "correct".) .. method:: close() Prevents any more tasks from being submitted to the pool. Once all the tasks have been completed the worker processes will exit. .. method:: terminate() Stops the worker processes immediately without completing outstanding work. When the pool object is garbage collected :meth:`terminate` will be called immediately. .. method:: join() Wait for the worker processes to exit. One must call :meth:`close` or :meth:`terminate` before using :meth:`join`. .. class:: AsyncResult The class of the result returned by :meth:`Pool.apply_async` and :meth:`Pool.map_async`. .. method:: get([timeout]) Return the result when it arrives. If *timeout* is not ``None`` and the result does not arrive within *timeout* seconds then :exc:`multiprocessing.TimeoutError` is raised. If the remote call raised an exception then that exception will be reraised by :meth:`get`. .. method:: wait([timeout]) Wait until the result is available or until *timeout* seconds pass. .. method:: ready() Return whether the call has completed. .. method:: successful() Return whether the call completed without raising an exception. Will raise :exc:`AssertionError` if the result is not ready. The following example demonstrates the use of a pool:: from multiprocessing import Pool import time def f(x): return x*x if __name__ == '__main__': pool = Pool(processes=4) # start 4 worker processes result = pool.apply_async(f, (10,)) # evaluate "f(10)" asynchronously in a single process print result.get(timeout=1) # prints "100" unless your computer is *very* slow print pool.map(f, range(10)) # prints "[0, 1, 4,..., 81]" it = pool.imap(f, range(10)) print it.next() # prints "0" print it.next() # prints "1" print it.next(timeout=1) # prints "4" unless your computer is *very* slow result = pool.apply_async(time.sleep, (10,)) print result.get(timeout=1) # raises multiprocessing.TimeoutError .. _multiprocessing-listeners-clients: Listeners and Clients ~~~~~~~~~~~~~~~~~~~~~ .. module:: multiprocessing.connection :synopsis: API for dealing with sockets. Usually message passing between processes is done using queues or by using :class:`Connection` objects returned by :func:`~multiprocessing.Pipe`. However, the :mod:`multiprocessing.connection` module allows some extra flexibility. It basically gives a high level message oriented API for dealing with sockets or Windows named pipes, and also has support for *digest authentication* using the :mod:`hmac` module. .. function:: deliver_challenge(connection, authkey) Send a randomly generated message to the other end of the connection and wait for a reply. If the reply matches the digest of the message using *authkey* as the key then a welcome message is sent to the other end of the connection. Otherwise :exc:`AuthenticationError` is raised. .. function:: answer_challenge(connection, authkey) Receive a message, calculate the digest of the message using *authkey* as the key, and then send the digest back. If a welcome message is not received, then :exc:`AuthenticationError` is raised. .. function:: Client(address[, family[, authenticate[, authkey]]]) Attempt to set up a connection to the listener which is using address *address*, returning a :class:`Connection`. The type of the connection is determined by *family* argument, but this can generally be omitted since it can usually be inferred from the format of *address*. (See :ref:`multiprocessing-address-formats`) If *authenticate* is ``True`` or *authkey* is a string then digest authentication is used. The key used for authentication will be either *authkey* or ``current_process().authkey)`` if *authkey* is ``None``. If authentication fails then :exc:`AuthenticationError` is raised. See :ref:`multiprocessing-auth-keys`. .. class:: Listener([address[, family[, backlog[, authenticate[, authkey]]]]]) A wrapper for a bound socket or Windows named pipe which is 'listening' for connections. *address* is the address to be used by the bound socket or named pipe of the listener object. .. note:: If an address of '0.0.0.0' is used, the address will not be a connectable end point on Windows. If you require a connectable end-point, you should use '127.0.0.1'. *family* is the type of socket (or named pipe) to use. This can be one of the strings ``'AF_INET'`` (for a TCP socket), ``'AF_UNIX'`` (for a Unix domain socket) or ``'AF_PIPE'`` (for a Windows named pipe). Of these only the first is guaranteed to be available. If *family* is ``None`` then the family is inferred from the format of *address*. If *address* is also ``None`` then a default is chosen. This default is the family which is assumed to be the fastest available. See :ref:`multiprocessing-address-formats`. Note that if *family* is ``'AF_UNIX'`` and address is ``None`` then the socket will be created in a private temporary directory created using :func:`tempfile.mkstemp`. If the listener object uses a socket then *backlog* (1 by default) is passed to the :meth:`~socket.socket.listen` method of the socket once it has been bound. If *authenticate* is ``True`` (``False`` by default) or *authkey* is not ``None`` then digest authentication is used. If *authkey* is a string then it will be used as the authentication key; otherwise it must be ``None``. If *authkey* is ``None`` and *authenticate* is ``True`` then ``current_process().authkey`` is used as the authentication key. If *authkey* is ``None`` and *authenticate* is ``False`` then no authentication is done. If authentication fails then :exc:`AuthenticationError` is raised. See :ref:`multiprocessing-auth-keys`. .. method:: accept() Accept a connection on the bound socket or named pipe of the listener object and return a :class:`Connection` object. If authentication is attempted and fails, then :exc:`~multiprocessing.AuthenticationError` is raised. .. method:: close() Close the bound socket or named pipe of the listener object. This is called automatically when the listener is garbage collected. However it is advisable to call it explicitly. Listener objects have the following read-only properties: .. attribute:: address The address which is being used by the Listener object. .. attribute:: last_accepted The address from which the last accepted connection came. If this is unavailable then it is ``None``. The module defines the following exceptions: .. exception:: ProcessError The base class of all :mod:`multiprocessing` exceptions. .. exception:: BufferTooShort Exception raised by :meth:`Connection.recv_bytes_into()` when the supplied buffer object is too small for the message read. .. exception:: AuthenticationError Raised when there is an authentication error. .. exception:: TimeoutError Raised by methods with a timeout when the timeout expires. **Examples** The following server code creates a listener which uses ``'secret password'`` as an authentication key. It then waits for a connection and sends some data to the client:: from multiprocessing.connection import Listener from array import array address = ('localhost', 6000) # family is deduced to be 'AF_INET' listener = Listener(address, authkey='secret password') conn = listener.accept() print 'connection accepted from', listener.last_accepted conn.send([2.25, None, 'junk', float]) conn.send_bytes('hello') conn.send_bytes(array('i', [42, 1729])) conn.close() listener.close() The following code connects to the server and receives some data from the server:: from multiprocessing.connection import Client from array import array address = ('localhost', 6000) conn = Client(address, authkey='secret password') print conn.recv() # => [2.25, None, 'junk', float] print conn.recv_bytes() # => 'hello' arr = array('i', [0, 0, 0, 0, 0]) print conn.recv_bytes_into(arr) # => 8 print arr # => array('i', [42, 1729, 0, 0, 0]) conn.close() .. _multiprocessing-address-formats: Address Formats >>>>>>>>>>>>>>> * An ``'AF_INET'`` address is a tuple of the form ``(hostname, port)`` where *hostname* is a string and *port* is an integer. * An ``'AF_UNIX'`` address is a string representing a filename on the filesystem. * An ``'AF_PIPE'`` address is a string of the form :samp:`r'\\\\.\\pipe\\{PipeName}'`. To use :func:`Client` to connect to a named pipe on a remote computer called *ServerName* one should use an address of the form :samp:`r'\\\\{ServerName}\\pipe\\{PipeName}'` instead. Note that any string beginning with two backslashes is assumed by default to be an ``'AF_PIPE'`` address rather than an ``'AF_UNIX'`` address. .. _multiprocessing-auth-keys: Authentication keys ~~~~~~~~~~~~~~~~~~~ When one uses :meth:`Connection.recv`, the data received is automatically unpickled. Unfortunately unpickling data from an untrusted source is a security risk. Therefore :class:`Listener` and :func:`Client` use the :mod:`hmac` module to provide digest authentication. An authentication key is a string which can be thought of as a password: once a connection is established both ends will demand proof that the other knows the authentication key. (Demonstrating that both ends are using the same key does **not** involve sending the key over the connection.) If authentication is requested but no authentication key is specified then the return value of ``current_process().authkey`` is used (see :class:`~multiprocessing.Process`). This value will be automatically inherited by any :class:`~multiprocessing.Process` object that the current process creates. This means that (by default) all processes of a multi-process program will share a single authentication key which can be used when setting up connections between themselves. Suitable authentication keys can also be generated by using :func:`os.urandom`. Logging ~~~~~~~ Some support for logging is available. Note, however, that the :mod:`logging` package does not use process shared locks so it is possible (depending on the handler type) for messages from different processes to get mixed up. .. currentmodule:: multiprocessing .. function:: get_logger() Returns the logger used by :mod:`multiprocessing`. If necessary, a new one will be created. When first created the logger has level :data:`logging.NOTSET` and no default handler. Messages sent to this logger will not by default propagate to the root logger. Note that on Windows child processes will only inherit the level of the parent process's logger -- any other customization of the logger will not be inherited. .. currentmodule:: multiprocessing .. function:: log_to_stderr() This function performs a call to :func:`get_logger` but in addition to returning the logger created by get_logger, it adds a handler which sends output to :data:`sys.stderr` using format ``'[%(levelname)s/%(processName)s] %(message)s'``. Below is an example session with logging turned on:: >>> import multiprocessing, logging >>> logger = multiprocessing.log_to_stderr() >>> logger.setLevel(logging.INFO) >>> logger.warning('doomed') [WARNING/MainProcess] doomed >>> m = multiprocessing.Manager() [INFO/SyncManager-...] child process calling self.run() [INFO/SyncManager-...] created temp directory /.../pymp-... [INFO/SyncManager-...] manager serving at '/.../listener-...' >>> del m [INFO/MainProcess] sending shutdown message to manager [INFO/SyncManager-...] manager exiting with exitcode 0 In addition to having these two logging functions, the multiprocessing also exposes two additional logging level attributes. These are :const:`SUBWARNING` and :const:`SUBDEBUG`. The table below illustrates where theses fit in the normal level hierarchy. +----------------+----------------+ | Level | Numeric value | +================+================+ | ``SUBWARNING`` | 25 | +----------------+----------------+ | ``SUBDEBUG`` | 5 | +----------------+----------------+ For a full table of logging levels, see the :mod:`logging` module. These additional logging levels are used primarily for certain debug messages within the multiprocessing module. Below is the same example as above, except with :const:`SUBDEBUG` enabled:: >>> import multiprocessing, logging >>> logger = multiprocessing.log_to_stderr() >>> logger.setLevel(multiprocessing.SUBDEBUG) >>> logger.warning('doomed') [WARNING/MainProcess] doomed >>> m = multiprocessing.Manager() [INFO/SyncManager-...] child process calling self.run() [INFO/SyncManager-...] created temp directory /.../pymp-... [INFO/SyncManager-...] manager serving at '/.../pymp-djGBXN/listener-...' >>> del m [SUBDEBUG/MainProcess] finalizer calling ... [INFO/MainProcess] sending shutdown message to manager [DEBUG/SyncManager-...] manager received shutdown message [SUBDEBUG/SyncManager-...] calling <Finalize object, callback=unlink, ... [SUBDEBUG/SyncManager-...] finalizer calling <built-in function unlink> ... [SUBDEBUG/SyncManager-...] calling <Finalize object, dead> [SUBDEBUG/SyncManager-...] finalizer calling <function rmtree at 0x5aa730> ... [INFO/SyncManager-...] manager exiting with exitcode 0 The :mod:`multiprocessing.dummy` module ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ .. module:: multiprocessing.dummy :synopsis: Dumb wrapper around threading. :mod:`multiprocessing.dummy` replicates the API of :mod:`multiprocessing` but is no more than a wrapper around the :mod:`threading` module. .. _multiprocessing-programming: Programming guidelines ---------------------- There are certain guidelines and idioms which should be adhered to when using :mod:`multiprocessing`. All platforms ~~~~~~~~~~~~~ Avoid shared state As far as possible one should try to avoid shifting large amounts of data between processes. It is probably best to stick to using queues or pipes for communication between processes rather than using the lower level synchronization primitives from the :mod:`threading` module. Picklability Ensure that the arguments to the methods of proxies are picklable. Thread safety of proxies Do not use a proxy object from more than one thread unless you protect it with a lock. (There is never a problem with different processes using the *same* proxy.) Joining zombie processes On Unix when a process finishes but has not been joined it becomes a zombie. There should never be very many because each time a new process starts (or :func:`~multiprocessing.active_children` is called) all completed processes which have not yet been joined will be joined. Also calling a finished process's :meth:`Process.is_alive <multiprocessing.Process.is_alive>` will join the process. Even so it is probably good practice to explicitly join all the processes that you start. Better to inherit than pickle/unpickle On Windows many types from :mod:`multiprocessing` need to be picklable so that child processes can use them. However, one should generally avoid sending shared objects to other processes using pipes or queues. Instead you should arrange the program so that a process which needs access to a shared resource created elsewhere can inherit it from an ancestor process. Avoid terminating processes Using the :meth:`Process.terminate <multiprocessing.Process.terminate>` method to stop a process is liable to cause any shared resources (such as locks, semaphores, pipes and queues) currently being used by the process to become broken or unavailable to other processes. Therefore it is probably best to only consider using :meth:`Process.terminate <multiprocessing.Process.terminate>` on processes which never use any shared resources. Joining processes that use queues Bear in mind that a process that has put items in a queue will wait before terminating until all the buffered items are fed by the "feeder" thread to the underlying pipe. (The child process can call the :meth:`~multiprocessing.Queue.cancel_join_thread` method of the queue to avoid this behaviour.) This means that whenever you use a queue you need to make sure that all items which have been put on the queue will eventually be removed before the process is joined. Otherwise you cannot be sure that processes which have put items on the queue will terminate. Remember also that non-daemonic processes will be joined automatically. An example which will deadlock is the following:: from multiprocessing import Process, Queue def f(q): q.put('X' * 1000000) if __name__ == '__main__': queue = Queue() p = Process(target=f, args=(queue,)) p.start() p.join() # this deadlocks obj = queue.get() A fix here would be to swap the last two lines (or simply remove the ``p.join()`` line). Explicitly pass resources to child processes On Unix a child process can make use of a shared resource created in a parent process using a global resource. However, it is better to pass the object as an argument to the constructor for the child process. Apart from making the code (potentially) compatible with Windows this also ensures that as long as the child process is still alive the object will not be garbage collected in the parent process. This might be important if some resource is freed when the object is garbage collected in the parent process. So for instance :: from multiprocessing import Process, Lock def f(): ... do something using "lock" ... if __name__ == '__main__': lock = Lock() for i in range(10): Process(target=f).start() should be rewritten as :: from multiprocessing import Process, Lock def f(l): ... do something using "l" ... if __name__ == '__main__': lock = Lock() for i in range(10): Process(target=f, args=(lock,)).start() Beware of replacing :data:`sys.stdin` with a "file like object" :mod:`multiprocessing` originally unconditionally called:: os.close(sys.stdin.fileno()) in the :meth:`multiprocessing.Process._bootstrap` method --- this resulted in issues with processes-in-processes. This has been changed to:: sys.stdin.close() sys.stdin = open(os.devnull) Which solves the fundamental issue of processes colliding with each other resulting in a bad file descriptor error, but introduces a potential danger to applications which replace :func:`sys.stdin` with a "file-like object" with output buffering. This danger is that if multiple processes call :meth:`~io.IOBase.close()` on this file-like object, it could result in the same data being flushed to the object multiple times, resulting in corruption. If you write a file-like object and implement your own caching, you can make it fork-safe by storing the pid whenever you append to the cache, and discarding the cache when the pid changes. For example:: @property def cache(self): pid = os.getpid() if pid != self._pid: self._pid = pid self._cache = [] return self._cache For more information, see :issue:`5155`, :issue:`5313` and :issue:`5331` Windows ~~~~~~~ Since Windows lacks :func:`os.fork` it has a few extra restrictions: More picklability Ensure that all arguments to :meth:`Process.__init__` are picklable. This means, in particular, that bound or unbound methods cannot be used directly as the ``target`` argument on Windows --- just define a function and use that instead. Also, if you subclass :class:`~multiprocessing.Process` then make sure that instances will be picklable when the :meth:`Process.start <multiprocessing.Process.start>` method is called. Global variables Bear in mind that if code run in a child process tries to access a global variable, then the value it sees (if any) may not be the same as the value in the parent process at the time that :meth:`Process.start <multiprocessing.Process.start>` was called. However, global variables which are just module level constants cause no problems. Safe importing of main module Make sure that the main module can be safely imported by a new Python interpreter without causing unintended side effects (such a starting a new process). For example, under Windows running the following module would fail with a :exc:`RuntimeError`:: from multiprocessing import Process def foo(): print 'hello' p = Process(target=foo) p.start() Instead one should protect the "entry point" of the program by using ``if __name__ == '__main__':`` as follows:: from multiprocessing import Process, freeze_support def foo(): print 'hello' if __name__ == '__main__': freeze_support() p = Process(target=foo) p.start() (The ``freeze_support()`` line can be omitted if the program will be run normally instead of frozen.) This allows the newly spawned Python interpreter to safely import the module and then run the module's ``foo()`` function. Similar restrictions apply if a pool or manager is created in the main module. .. _multiprocessing-examples: Examples -------- Demonstration of how to create and use customized managers and proxies: .. literalinclude:: ../includes/mp_newtype.py Using :class:`~multiprocessing.pool.Pool`: .. literalinclude:: ../includes/mp_pool.py Synchronization types like locks, conditions and queues: .. literalinclude:: ../includes/mp_synchronize.py An example showing how to use queues to feed tasks to a collection of worker processes and collect the results: .. literalinclude:: ../includes/mp_workers.py An example of how a pool of worker processes can each run a :class:`SimpleHTTPServer.HttpServer` instance while sharing a single listening socket. .. literalinclude:: ../includes/mp_webserver.py Some simple benchmarks comparing :mod:`multiprocessing` with :mod:`threading`: .. literalinclude:: ../includes/mp_benchmarks.py
Close
