Differenze

Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.

--- magistraleinformaticanetworking:spd:2016:tbblab [08/05/2016 alle 22:55 (10 anni fa)] – Massimo Coppola
+++ magistraleinformaticanetworking:spd:2016:tbblab [09/05/2016 alle 10:12 (10 anni fa)] (versione attuale) – Massimo Coppola
@@ Linea 53: / Linea 53: @@
 You can compute on points in the stream and recycle them if the computation takes too long. Use the parallel_do methods to reinsert in the loop those points that are not completed, and let those that are completed flow out of the do_loop.
-  * Basic use of parallel do implies the grain is always 1. Design a data structure that can aggregate more points into a single parallel_do task. Minimize data copying required by the structure,
+  * does this require a parallel_do that generates new tasks?
+  * Basic use of parallel do implies the grain is always 1. Design a data structure that can aggregate more points into a single parallel_do task. Minimize data copying required by managing the structure, design a way to repack unfinished data points into new tasks while allowing finished computations to exit the loop. Does the new structure require inserting new tasks in the parallel_do?
+  * examine two solutions:
+    - the new tasks are inserted from within the loop itself, requiring a specific kind of parallel_do
+    - the new tasks are generated outside of the loop; how can you manage the synchronization between the loop and the task generators in order to prevent the loop from exiting when new tasks are about to be added?
 == Extensions ==