- that corresponds to the non-parallelizable part of the computation.
-
- Before calling SD_task_schedulel or SD_task_schedulev, the
- SD_task_distribute_comp_amdahl function has to be called with the
- desired number of workstations. The filling of computation_amount and
- communication_amount (actually empty) structures is then done
- seamlessly.
+ that corresponds to the non-parallelizable part of the computation.
+ SD_TASK_COMM_PAR_MXN_1D_BLOCK represents a complex data redistribution
+ between two sets of workstations assuming a 1D block distribution (each
+ workstation owns a similar share of data) on both sides.
+
+ These tasks can be scheduled with SD_task_schedulel or SD_task_schedulev.
+ Data redistribution will be automatically scheduled once parent and child
+ are both scheduled. The filling of computation_amount and
+ communication_amount structures is now done seamlessly thanks to the chosen
+ assumptions.