magistraleinformaticanetworking:spm:spm1213code
Differenze
Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.
| Entrambe le parti precedenti la revisioneRevisione precedenteProssima revisione | Revisione precedente | ||
| magistraleinformaticanetworking:spm:spm1213code [16/04/2013 alle 16:05 (12 anni fa)] – Marco Danelutto | magistraleinformaticanetworking:spm:spm1213code [30/04/2013 alle 16:54 (12 anni fa)] (versione attuale) – Marco Danelutto | ||
|---|---|---|---|
| Linea 12: | Linea 12: | ||
| * [[spm1213_c_ff_false_sharing_fs2|Code]] for the map with false sharing | * [[spm1213_c_ff_false_sharing_fs2|Code]] for the map with false sharing | ||
| * [[spm1213_c_ff_false_sharing_fs3|Code]] for the map without false sharing | * [[spm1213_c_ff_false_sharing_fs3|Code]] for the map without false sharing | ||
| + | |||
| + | === Lesson: April 22, 2013 === | ||
| + | * [[spm1213_c_omp_load_balancing|Code]] testing OpenMP schedule strategies (compile with -DSCHED=xxx xxx in {static, dynamic, guided}) | ||
| + | * [[spm1213_c_ff_load_balancing|Code]] used to compare FastFlow | ||
| + | |||
| + | === Lesson: April 23, 2013 === | ||
| + | * FastFlow [[spm1213_c_ff_load_balancing_chunk|Code]] computing the unbalanced map in chunks | ||
| + | * SKEPU sample code | ||
| + | * [[spm1213_c_skepu_containers|Containers]] | ||
| + | * [[spm1213_c_skepu_map|Map]] | ||
| + | * [[spm1213_c_skepu_reduce|Reduce]] | ||
| + | |||
| + | === Lesson: April 29, 2013 === | ||
| + | * FastFlow [[spm1213_c_ff_with_skepu|code]] using SkePu to implement a map | ||
| + | |||
| + | === Lesson: April 30, 2013 === | ||
| + | * OpenMP code relative to map fusion [[spm1213_c_omp_fused|Map fused]] | ||
| + | * FastFlow [[spm1213_c_ff_mixskepumap|code]] mixing sequential farm workers and skepu workers computing the same map | ||
| + | |||
| + | |||
magistraleinformaticanetworking/spm/spm1213code.1366128343.txt.gz · Ultima modifica: 16/04/2013 alle 16:05 (12 anni fa) da Marco Danelutto