canvas.rst 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872
  1. .. _guide-canvas:
  2. =============================
  3. Canvas: Designing Workflows
  4. =============================
  5. .. contents::
  6. :local:
  7. :depth: 2
  8. .. _canvas-subtasks:
  9. Subtasks
  10. ========
  11. .. versionadded:: 2.0
  12. You just learned how to call a task using the tasks ``delay`` method
  13. in the :ref:`calling <calling>` guide, and this is often all you need,
  14. but sometimes you may want to pass the signature of a task invocation to
  15. another process or as an argument to another function, for this Celery uses
  16. something called *subtasks*.
  17. A :func:`~celery.subtask` wraps the arguments, keyword arguments, and execution options
  18. of a single task invocation in a way such that it can be passed to functions
  19. or even serialized and sent across the wire.
  20. - You can create a subtask for the ``add`` task using its name like this::
  21. >>> from celery import subtask
  22. >>> subtask('tasks.add', args=(2, 2), countdown=10)
  23. tasks.add(2, 2)
  24. This subtask has a signature of arity 2 (two arguments): ``(2, 2)``,
  25. and sets the countdown execution option to 10.
  26. - or you can create one using the task's ``subtask`` method::
  27. >>> add.subtask((2, 2), countdown=10)
  28. tasks.add(2, 2)
  29. - There is also a shortcut using star arguments::
  30. >>> add.s(2, 2)
  31. tasks.add(2, 2)
  32. - Keyword arguments are also supported::
  33. >>> add.s(2, 2, debug=True)
  34. tasks.add(2, 2, debug=True)
  35. - From any subtask instance you can inspect the different fields::
  36. >>> s = add.subtask((2, 2), {'debug': True}, countdown=10)
  37. >>> s.args
  38. (2, 2)
  39. >>> s.kwargs
  40. {'debug': True}
  41. >>> s.options
  42. {'countdown': 10}
  43. - It supports the "Calling API" which means it takes the same arguments
  44. as the :meth:`~@Task.apply_async` method::
  45. >>> add.apply_async(args, kwargs, **options)
  46. >>> add.subtask(args, kwargs, **options).apply_async()
  47. >>> add.apply_async((2, 2), countdown=1)
  48. >>> add.subtask((2, 2), countdown=1).apply_async()
  49. - You can't define options with :meth:`~@Task.s`, but a chaining
  50. ``set`` call takes care of that::
  51. >>> add.s(2, 2).set(countdown=1)
  52. proj.tasks.add(2, 2)
  53. Partials
  54. --------
  55. A subtask can be applied too::
  56. >>> add.s(2, 2).delay()
  57. >>> add.s(2, 2).apply_async(countdown=1)
  58. Specifying additional args, kwargs or options to ``apply_async``/``delay``
  59. creates partials:
  60. - Any arguments added will be prepended to the args in the signature::
  61. >>> partial = add.s(2) # incomplete signature
  62. >>> partial.delay(4) # 2 + 4
  63. >>> partial.apply_async((4, )) # same
  64. - Any keyword arguments added will be merged with the kwargs in the signature,
  65. with the new keyword arguments taking precedence::
  66. >>> s = add.s(2, 2)
  67. >>> s.delay(debug=True) # -> add(2, 2, debug=True)
  68. >>> s.apply_async(kwargs={'debug': True}) # same
  69. - Any options added will be merged with the options in the signature,
  70. with the new options taking precedence::
  71. >>> s = add.subtask((2, 2), countdown=10)
  72. >>> s.apply_async(countdown=1) # countdown is now 1
  73. You can also clone subtasks to augment these::
  74. >>> s = add.s(2)
  75. proj.tasks.add(2)
  76. >>> s.clone(args=(4, ), kwargs={'debug': True})
  77. proj.tasks.add(2, 4, debug=True)
  78. Immutability
  79. ------------
  80. .. versionadded:: 3.0
  81. Partials are meant to be used with callbacks, any tasks linked or chord
  82. callbacks will be applied with the result of the parent task.
  83. Sometimes you want to specify a callback that does not take
  84. additional arguments, and in that case you can set the subtask
  85. to be immutable::
  86. >>> add.apply_async((2, 2), link=reset_buffers.subtask(immutable=True))
  87. The ``.si()`` shortcut can also be used to create immutable subtasks::
  88. >>> add.apply_async((2, 2), link=reset_buffers.si())
  89. Only the execution options can be set when a subtask is immutable,
  90. so it's not possible to call the subtask with partial args/kwargs.
  91. .. note::
  92. In this tutorial I sometimes use the prefix operator `~` to subtasks.
  93. You probably shouldn't use it in your production code, but it's a handy shortcut
  94. when experimenting in the Python shell::
  95. >>> ~subtask
  96. >>> # is the same as
  97. >>> subtask.delay().get()
  98. .. _canvas-callbacks:
  99. Callbacks
  100. ---------
  101. .. versionadded:: 3.0
  102. Callbacks can be added to any task using the ``link`` argument
  103. to ``apply_async``::
  104. add.apply_async((2, 2), link=other_task.subtask())
  105. The callback will only be applied if the task exited successfully,
  106. and it will be applied with the return value of the parent task as argument.
  107. As I mentioned earlier, any arguments you add to `subtask`,
  108. will be prepended to the arguments specified by the subtask itself!
  109. If you have the subtask::
  110. >>> add.subtask(args=(10, ))
  111. `subtask.delay(result)` becomes::
  112. >>> add.apply_async(args=(result, 10))
  113. ...
  114. Now let's call our ``add`` task with a callback using partial
  115. arguments::
  116. >>> add.apply_async((2, 2), link=add.subtask((8, )))
  117. As expected this will first launch one task calculating :math:`2 + 2`, then
  118. another task calculating :math:`4 + 8`.
  119. The Primitives
  120. ==============
  121. .. versionadded:: 3.0
  122. .. topic:: Overview
  123. - ``group``
  124. The group primitive is a subtask that takes a list of tasks that should
  125. be applied in parallel.
  126. - ``chain``
  127. The chain primitive lets us link together subtasks so that one is called
  128. after the other, essentially forming a *chain* of callbacks.
  129. - ``chord``
  130. A chord is just like a group but with a callback. A group consists
  131. of a header group and a body, where the body is a task that should execute
  132. after all of the tasks in the header is complete.
  133. - ``map``
  134. The map primitive works like the built-in ``map`` function, but creates
  135. a temporary task where a list of arguments is applied to the task.
  136. E.g. ``task.map([1, 2])`` results in a single task
  137. being called, applying the arguments in order to the task function so
  138. that the result is::
  139. res = [task(1), task(2)]
  140. - ``starmap``
  141. Works exactly like map except the arguments are applied as ``*args``.
  142. For example ``add.starmap([(2, 2), (4, 4)])`` results in a single
  143. task calling::
  144. res = [add(2, 2), add(4, 4)]
  145. - ``chunks``
  146. Chunking splits a long list of arguments into parts, e.g the operation::
  147. >>> add.chunks(zip(xrange(1000), xrange(1000), 10))
  148. will create 10 tasks that apply 100 items each.
  149. The primitives are also subtasks themselves, so that they can be combined
  150. in any number of ways to compose complex workflows.
  151. Here's some examples:
  152. - Simple chain
  153. Here's a simple chain, the first task executes passing its return value
  154. to the next task in the chain, and so on.
  155. .. code-block:: python
  156. >>> from celery import chain
  157. # 2 + 2 + 4 + 8
  158. >>> res = chain(add.s(2, 2), add.s(4), add.s(8))()
  159. >>> res.get()
  160. 16
  161. This can also be written using pipes::
  162. >>> (add.s(2, 2) | add.s(4) | add.s(8))().get()
  163. 16
  164. - Immutable subtasks
  165. Signatures can be partial so arguments can be
  166. added to the existing arguments, but you may not always want that,
  167. for example if you don't want the result of the previous task in a chain.
  168. In that case you can mark the subtask as immutable, so that the arguments
  169. cannot be changed::
  170. >>> add.subtask((2, 2), immutable=True)
  171. There's also an ``.si`` shortcut for this::
  172. >>> add.si(2, 2)
  173. Now you can create a chain of independent tasks instead::
  174. >>> res = (add.si(2, 2), add.si(4, 4), add.s(8, 8))()
  175. >>> res.get()
  176. 16
  177. >>> res.parent.get()
  178. 8
  179. >>> res.parent.parent.get()
  180. 4
  181. - Simple group
  182. You can easily create a group of tasks to execute in parallel::
  183. >>> from celery import group
  184. >>> res = group(add.s(i, i) for i in xrange(10))()
  185. >>> res.get(timeout=1)
  186. [0, 2, 4, 6, 8, 10, 12, 14, 16, 18]
  187. - For primitives `.apply_async` is special...
  188. as it will create a temporary task to apply the tasks in,
  189. for example by *applying the group*::
  190. >>> g = group(add.s(i, i) for i in xrange(10))
  191. >>> g() # << applying
  192. the act of sending the messages for the tasks in the group
  193. will happen in the current process,
  194. but with ``.apply_async`` this happens in a temporary task
  195. instead::
  196. >>> g = group(add.s(i, i) for i in xrange(10))
  197. >>> g.apply_async()
  198. This is useful because you can e.g. specify a time for the
  199. messages in the group to be called::
  200. >>> g.apply_async(countdown=10)
  201. - Simple chord
  202. The chord primitive enables us to add callback to be called when
  203. all of the tasks in a group has finished executing, which is often
  204. required for algorithms that aren't embarrassingly parallel::
  205. >>> from celery import chord
  206. >>> res = chord((add.s(i, i) for i in xrange(10)), xsum.s())()
  207. >>> res.get()
  208. 90
  209. The above example creates 10 task that all start in parallel,
  210. and when all of them is complete the return values is combined
  211. into a list and sent to the ``xsum`` task.
  212. The body of a chord can also be immutable, so that the return value
  213. of the group is not passed on to the callback::
  214. >>> chord((import_contact.s(c) for c in contacts),
  215. ... notify_complete.si(import_id)).apply_async()
  216. Note the use of ``.si`` above which creates an immutable subtask.
  217. - Blow your mind by combining
  218. Chains can be partial too::
  219. >>> c1 = (add.s(4) | mul.s(8))
  220. # (16 + 4) * 8
  221. >>> res = c1(16)
  222. >>> res.get()
  223. 160
  224. Which means that you can combine chains::
  225. # ((4 + 16) * 2 + 4) * 8
  226. >>> c2 = (add.s(4, 16) | mul.s(2) | (add.s(4) | mul.s(8)))
  227. >>> res = c2()
  228. >>> res.get()
  229. 352
  230. Chaining a group together with another task will automatically
  231. upgrade it to be a chord::
  232. >>> c3 = (group(add.s(i, i) for i in xrange(10) | xsum.s()))
  233. >>> res = c3()
  234. >>> res.get()
  235. 90
  236. Groups and chords accepts partial arguments too, so in a chain
  237. the return value of the previous task is forwarded to all tasks in the group::
  238. >>> new_user_workflow = (create_user.s() | group(
  239. ... import_contacts.s(),
  240. ... send_welcome_email.s()))
  241. ... new_user_workflow.delay(username='artv',
  242. ... first='Art',
  243. ... last='Vandelay',
  244. ... email='art@vandelay.com')
  245. If you don't want to forward arguments to the group then
  246. you can make the subtasks in the group immutable::
  247. >>> res = (add.s(4, 4) | group(add.si(i, i) for i in xrange(10)))()
  248. >>> res.get()
  249. <GroupResult: de44df8c-821d-4c84-9a6a-44769c738f98 [
  250. bc01831b-9486-4e51-b046-480d7c9b78de,
  251. 2650a1b8-32bf-4771-a645-b0a35dcc791b,
  252. dcbee2a5-e92d-4b03-b6eb-7aec60fd30cf,
  253. 59f92e0a-23ea-41ce-9fad-8645a0e7759c,
  254. 26e1e707-eccf-4bf4-bbd8-1e1729c3cce3,
  255. 2d10a5f4-37f0-41b2-96ac-a973b1df024d,
  256. e13d3bdb-7ae3-4101-81a4-6f17ee21df2d,
  257. 104b2be0-7b75-44eb-ac8e-f9220bdfa140,
  258. c5c551a5-0386-4973-aa37-b65cbeb2624b,
  259. 83f72d71-4b71-428e-b604-6f16599a9f37]>
  260. >>> res.parent.get()
  261. 8
  262. .. _canvas-chain:
  263. Chains
  264. ------
  265. .. versionadded:: 3.0
  266. Tasks can be linked together, which in practice means adding
  267. a callback task::
  268. >>> res = add.apply_async((2, 2), link=mul.s(16))
  269. >>> res.get()
  270. 4
  271. The linked task will be applied with the result of its parent
  272. task as the first argument, which in the above case will result
  273. in ``mul(4, 16)`` since the result is 4.
  274. The results will keep track of what subtasks a task applies,
  275. and this can be accessed from the result instance::
  276. >>> res.children
  277. [<AsyncResult: 8c350acf-519d-4553-8a53-4ad3a5c5aeb4>]
  278. >>> res.children[0].get()
  279. 64
  280. The result instance also has a :meth:`~@AsyncResult.collect` method
  281. that treats the result as a graph, enabling you to iterate over
  282. the results::
  283. >>> list(res.collect())
  284. [(<AsyncResult: 7b720856-dc5f-4415-9134-5c89def5664e>, 4),
  285. (<AsyncResult: 8c350acf-519d-4553-8a53-4ad3a5c5aeb4>, 64)]
  286. By default :meth:`~@AsyncResult.collect` will raise an
  287. :exc:`~@IncompleteStream` exception if the graph is not fully
  288. formed (one of the tasks has not completed yet),
  289. but you can get an intermediate representation of the graph
  290. too::
  291. >>> for result, value in res.collect(intermediate=True)):
  292. ....
  293. You can link together as many tasks as you like,
  294. and subtasks can be linked too::
  295. >>> s = add.s(2, 2)
  296. >>> s.link(mul.s(4))
  297. >>> s.link(log_result.s())
  298. You can also add *error callbacks* using the ``link_error`` argument::
  299. >>> add.apply_async((2, 2), link_error=log_error.s())
  300. >>> add.subtask((2, 2), link_error=log_error.s())
  301. Since exceptions can only be serialized when pickle is used
  302. the error callbacks take the id of the parent task as argument instead:
  303. .. code-block:: python
  304. from proj.celery import celery
  305. @celery.task
  306. def log_error(task_id):
  307. result = celery.AsyncResult(task_id)
  308. result.get(propagate=False) # make sure result written.
  309. with open('/var/errors/%s' % (task_id, )) as fh:
  310. fh.write('--\n\n%s %s %s' % (
  311. task_id, result.result, result.traceback))
  312. To make it even easier to link tasks together there is
  313. a special subtask called :class:`~celery.chain` that lets
  314. you chain tasks together:
  315. .. code-block:: python
  316. >>> from celery import chain
  317. >>> from proj.tasks import add, mul
  318. # (4 + 4) * 8 * 10
  319. >>> res = chain(add.s(4, 4), mul.s(8), mul.s(10))
  320. proj.tasks.add(4, 4) | proj.tasks.mul(8) | proj.tasks.mul(10)
  321. Calling the chain will call the tasks in the current process
  322. and return the result of the last task in the chain::
  323. >>> res = chain(add.s(4, 4), mul.s(8), mul.s(10))()
  324. >>> res.get()
  325. 640
  326. And calling ``apply_async`` will create a dedicated
  327. task so that the act of calling the chain happens
  328. in a worker::
  329. >>> res = chain(add.s(4, 4), mul.s(8), mul.s(10)).apply_async()
  330. >>> res.get()
  331. 640
  332. It also sets ``parent`` attributes so that you can
  333. work your way up the chain to get intermediate results::
  334. >>> res.parent.get()
  335. 64
  336. >>> res.parent.parent.get()
  337. 8
  338. >>> res.parent.parent
  339. <AsyncResult: eeaad925-6778-4ad1-88c8-b2a63d017933>
  340. Chains can also be made using the ``|`` (pipe) operator::
  341. >>> (add.s(2, 2) | mul.s(8) | mul.s(10)).apply_async()
  342. Graphs
  343. ~~~~~~
  344. In addition you can work with the result graph as a
  345. :class:`~celery.datastructures.DependencyGraph`:
  346. .. code-block:: python
  347. >>> res = chain(add.s(4, 4), mul.s(8), mul.s(10))()
  348. >>> res.parent.parent.graph
  349. 285fa253-fcf8-42ef-8b95-0078897e83e6(1)
  350. 463afec2-5ed4-4036-b22d-ba067ec64f52(0)
  351. 872c3995-6fa0-46ca-98c2-5a19155afcf0(2)
  352. 285fa253-fcf8-42ef-8b95-0078897e83e6(1)
  353. 463afec2-5ed4-4036-b22d-ba067ec64f52(0)
  354. You can even convert these graphs to *dot* format::
  355. >>> with open('graph.dot', 'w') as fh:
  356. ... res.parent.parent.graph.to_dot(fh)
  357. and create images:
  358. .. code-block:: bash
  359. $ dot -Tpng graph.dot -o graph.png
  360. .. image:: ../images/graph.png
  361. .. _canvas-group:
  362. Groups
  363. ------
  364. .. versionadded:: 3.0
  365. A group can be used to execute several tasks in parallel.
  366. The :class:`~celery.group` function takes a list of subtasks::
  367. >>> from celery import group
  368. >>> from proj.tasks import add
  369. >>> group(add.s(2, 2), add.s(4, 4))
  370. (proj.tasks.add(2, 2), proj.tasks.add(4, 4))
  371. If you **call** the group, the tasks will be applied
  372. one after one in the current process, and a :class:`~@TaskSetResult`
  373. instance is returned which can be used to keep track of the results,
  374. or tell how many tasks are ready and so on::
  375. >>> g = group(add.s(2, 2), add.s(4, 4))
  376. >>> res = g()
  377. >>> res.get()
  378. [4, 8]
  379. However, if you call ``apply_async`` on the group it will
  380. send a special grouping task, so that the action of calling
  381. the tasks happens in a worker instead of the current process::
  382. >>> res = g.apply_async()
  383. >>> res.get()
  384. [4, 8]
  385. Group also supports iterators::
  386. >>> group(add.s(i, i) for i in xrange(100))()
  387. A group is a subclass instance, so it can be used in combination
  388. with other subtasks.
  389. Group Results
  390. ~~~~~~~~~~~~~
  391. The group task returns a special result too,
  392. this result works just like normal task results, except
  393. that it works on the group as a whole::
  394. >>> from celery import group
  395. >>> from tasks import add
  396. >>> job = group([
  397. ... add.subtask((2, 2)),
  398. ... add.subtask((4, 4)),
  399. ... add.subtask((8, 8)),
  400. ... add.subtask((16, 16)),
  401. ... add.subtask((32, 32)),
  402. ... ])
  403. >>> result = job.apply_async()
  404. >>> result.ready() # have all subtasks completed?
  405. True
  406. >>> result.successful() # were all subtasks successful?
  407. True
  408. >>> result.join()
  409. [4, 8, 16, 32, 64]
  410. The :class:`~celery.result.GroupResult` takes a list of
  411. :class:`~celery.result.AsyncResult` instances and operates on them as
  412. if it was a single task.
  413. It supports the following operations:
  414. * :meth:`~celery.result.GroupResult.successful`
  415. Returns :const:`True` if all of the subtasks finished
  416. successfully (e.g. did not raise an exception).
  417. * :meth:`~celery.result.GroupResult.failed`
  418. Returns :const:`True` if any of the subtasks failed.
  419. * :meth:`~celery.result.GroupResult.waiting`
  420. Returns :const:`True` if any of the subtasks
  421. is not ready yet.
  422. * :meth:`~celery.result.GroupResult.ready`
  423. Return :const:`True` if all of the subtasks
  424. are ready.
  425. * :meth:`~celery.result.GroupResult.completed_count`
  426. Returns the number of completed subtasks.
  427. * :meth:`~celery.result.GroupResult.revoke`
  428. Revokes all of the subtasks.
  429. * :meth:`~celery.result.GroupResult.iterate`
  430. Iterates over the return values of the subtasks
  431. as they finish, one by one.
  432. * :meth:`~celery.result.GroupResult.join`
  433. Gather the results for all of the subtasks
  434. and return a list with them ordered by the order of which they
  435. were called.
  436. .. _canvas-chord:
  437. Chords
  438. ------
  439. .. versionadded:: 2.3
  440. A chord is a task that only executes after all of the tasks in a taskset has
  441. finished executing.
  442. Let's calculate the sum of the expression
  443. :math:`1 + 1 + 2 + 2 + 3 + 3 ... n + n` up to a hundred digits.
  444. First you need two tasks, :func:`add` and :func:`tsum` (:func:`sum` is
  445. already a standard function):
  446. .. code-block:: python
  447. @celery.task
  448. def add(x, y):
  449. return x + y
  450. @celery.task
  451. def tsum(numbers):
  452. return sum(numbers)
  453. Now you can use a chord to calculate each addition step in parallel, and then
  454. get the sum of the resulting numbers::
  455. >>> from celery import chord
  456. >>> from tasks import add, tsum
  457. >>> chord(add.subtask((i, i))
  458. ... for i in xrange(100))(tsum.subtask()).get()
  459. 9900
  460. This is obviously a very contrived example, the overhead of messaging and
  461. synchronization makes this a lot slower than its Python counterpart::
  462. sum(i + i for i in xrange(100))
  463. The synchronization step is costly, so you should avoid using chords as much
  464. as possible. Still, the chord is a powerful primitive to have in your toolbox
  465. as synchronization is a required step for many parallel algorithms.
  466. Let's break the chord expression down::
  467. >>> callback = tsum.subtask()
  468. >>> header = [add.subtask((i, i)) for i in xrange(100)]
  469. >>> result = chord(header)(callback)
  470. >>> result.get()
  471. 9900
  472. Remember, the callback can only be executed after all of the tasks in the
  473. header has returned. Each step in the header is executed as a task, in
  474. parallel, possibly on different nodes. The callback is then applied with
  475. the return value of each task in the header. The task id returned by
  476. :meth:`chord` is the id of the callback, so you can wait for it to complete
  477. and get the final return value (but remember to :ref:`never have a task wait
  478. for other tasks <task-synchronous-subtasks>`)
  479. .. _chord-important-notes:
  480. Important Notes
  481. ~~~~~~~~~~~~~~~
  482. By default the synchronization step is implemented by having a recurring task
  483. poll the completion of the taskset every second, calling the subtask when
  484. ready.
  485. Example implementation:
  486. .. code-block:: python
  487. def unlock_chord(taskset, callback, interval=1, max_retries=None):
  488. if taskset.ready():
  489. return subtask(callback).delay(taskset.join())
  490. raise unlock_chord.retry(countdown=interval, max_retries=max_retries)
  491. This is used by all result backends except Redis and Memcached, which
  492. increment a counter after each task in the header, then applying the callback
  493. when the counter exceeds the number of tasks in the set. *Note:* chords do not
  494. properly work with Redis before version 2.2; you will need to upgrade to at
  495. least 2.2 to use them.
  496. The Redis and Memcached approach is a much better solution, but not easily
  497. implemented in other backends (suggestions welcome!).
  498. .. note::
  499. If you are using chords with the Redis result backend and also overriding
  500. the :meth:`Task.after_return` method, you need to make sure to call the
  501. super method or else the chord callback will not be applied.
  502. .. code-block:: python
  503. def after_return(self, *args, **kwargs):
  504. do_something()
  505. super(MyTask, self).after_return(*args, **kwargs)
  506. .. _canvas-map:
  507. Map & Starmap
  508. -------------
  509. :class:`~celery.map` and :class:`~celery.starmap` are built-in tasks
  510. that calls the task for every element in a sequence.
  511. They differ from group in that
  512. - only one task message is sent
  513. - the operation is sequential.
  514. For example using ``map``:
  515. .. code-block:: python
  516. >>> from proj.tasks import add
  517. >>> ~xsum.map([range(10), range(100)])
  518. [45, 4950]
  519. is the same as having a task doing:
  520. .. code-block:: python
  521. @celery.task
  522. def temp():
  523. return [xsum(range(10)), xsum(range(100))]
  524. and using ``starmap``::
  525. >>> ~add.starmap(zip(range(10), range(10)))
  526. [0, 2, 4, 6, 8, 10, 12, 14, 16, 18]
  527. is the same as having a task doing:
  528. .. code-block:: python
  529. @celery.task
  530. def temp():
  531. return [add(i, i) for i in range(10)]
  532. Both ``map`` and ``starmap`` are subtasks, so they can be used as
  533. other subtasks and combined in groups etc., for example
  534. to call the starmap after 10 seconds::
  535. >>> add.starmap(zip(range(10), range(10))).apply_async(countdown=10)
  536. .. _canvas-chunks:
  537. Chunks
  538. ------
  539. Chunking lets you divide an iterable of work into pieces, so that if
  540. you have one million objects, you can create 10 tasks with hundred
  541. thousand objects each.
  542. Some may worry that chunking your tasks results in a degradation
  543. of parallelism, but this is rarely true for a busy cluster
  544. and in practice since you are avoiding the overhead of messaging
  545. it may considerably increase performance.
  546. To create a chunks subtask you can use :meth:`@Task.chunks`:
  547. .. code-block:: python
  548. >>> add.chunks(zip(range(100), range(100)), 10)
  549. As with :class:`~celery.group` the act of **calling**
  550. the chunks will call the tasks in the current process:
  551. .. code-block:: python
  552. >>> from proj.tasks import add
  553. >>> res = add.chunks(zip(range(100), range(100)), 10)()
  554. >>> res.get()
  555. [[0, 2, 4, 6, 8, 10, 12, 14, 16, 18],
  556. [20, 22, 24, 26, 28, 30, 32, 34, 36, 38],
  557. [40, 42, 44, 46, 48, 50, 52, 54, 56, 58],
  558. [60, 62, 64, 66, 68, 70, 72, 74, 76, 78],
  559. [80, 82, 84, 86, 88, 90, 92, 94, 96, 98],
  560. [100, 102, 104, 106, 108, 110, 112, 114, 116, 118],
  561. [120, 122, 124, 126, 128, 130, 132, 134, 136, 138],
  562. [140, 142, 144, 146, 148, 150, 152, 154, 156, 158],
  563. [160, 162, 164, 166, 168, 170, 172, 174, 176, 178],
  564. [180, 182, 184, 186, 188, 190, 192, 194, 196, 198]]
  565. while calling ``.apply_async`` will create a dedicated
  566. task so that the individual tasks are applied in a worker
  567. instead::
  568. >>> add.chunks(zip(range(100), range(100), 10)).apply_async()
  569. You can also convert chunks to a group::
  570. >>> group = add.chunks(zip(range(100), range(100), 10)).group()
  571. and with the group skew the countdown of each task by increments
  572. of one::
  573. >>> group.skew(start=1, stop=10)()
  574. which means that the first task will have a countdown of 1, the second
  575. a countdown of 2 and so on.