Tim Peters <t...@python.org> added the comment:
Note that you can consume multiple gigabytes of RAM with this simpler program
too, and for the same reasons:
"""
import concurrent.futures as cf
bucket = range(30_000_000)
def _dns_query(target):
from time import sleep
sleep(0.1)
def run():
with cf.ThreadPoolExecutor(3) as executor:
future_to_element = dict()
for element in bucket:
future = executor.submit(_dns_query, element)
future_to_element[future] = element
for future in cf.as_completed(future_to_element):
elt = future_to_element[future]
print(elt)
run()
"""
The usual way to mediate between producers and consumers that run at very
different speeds is to use a bounded queue, so that producers block when
putting new work items on the queue until consumers make progress taking work
items off. That's easy enough to do with `multiprocessing` instead, but
`concurrent.futures` doesn't support that directly.
If you don't mind doing the work in chunks, this straightforward modification
allows slashing RAM - the smaller CHUNK is, the less RAM is needed, but also
the more often the code waits for the most recent chunk to finish:
"""
CHUNK = 10_000
...
def chunkify(iterable, chunk=CHUNK):
from itertools import islice
it = iter(iterable)
while True:
piece = list(islice(it, chunk))
if piece:
yield piece
else:
return
def run():
with cf.ThreadPoolExecutor(3) as executor:
for b in chunkify(bucket):
# essentially the original code just indented
future_to_element = dict()
for element in b:
future = executor.submit(_dns_query, element)
future_to_element[future] = element
for future in cf.as_completed(future_to_element):
elt = future_to_element[future]
print(elt)
"""
----------
_______________________________________
Python tracker <rep...@bugs.python.org>
<https://bugs.python.org/issue34168>
_______________________________________
_______________________________________________
Python-bugs-list mailing list
Unsubscribe:
https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
