| Entrambe le parti precedenti la revisione
Revisione precedente
|
|
magistraleinformaticanetworking:spd:lezioni16.17 [05/08/2017 alle 18:35 (7 anni fa)]
Massimo Coppola [Journal] |
magistraleinformaticanetworking:spd:lezioni16.17 [05/08/2017 alle 18:49 (7 anni fa)]
Massimo Coppola [Journal] update to lesson list |
| * 17/05/2017 Project intro -- Introduction to available project topics. Stream mining with TBB / MPI / FastFlow; stream based computations on GPU : stream computation of aggregate / accumulation functions in window and pane-based models. | * 17/05/2017 Project intro -- Introduction to available project topics. Stream mining with TBB / MPI / FastFlow; stream based computations on GPU : stream computation of aggregate / accumulation functions in window and pane-based models. |
| * 19/05/2017 ** Lab Time ** -- K-means algorithm in MPI, porting to TBB \\ ** OpenCL ** OpenCL 2.2: OpenCL C, C++ (static subset of the C++14 standard). Features missing wrt the C++14. The SYCL model for single-source OpenCL / parallel C++ code. SPIR-V as a common representation of code that allows the integration of existing technology into a unified toolchain (LLVM-based compilers, GLSL, device drivers, format translators). Integration of OpenCL C++ within the SPIR-V SW ecosystem, convergence with Vulkan. | * 19/05/2017 ** Lab Time ** -- K-means algorithm in MPI, porting to TBB \\ ** OpenCL ** OpenCL 2.2: OpenCL C, C++ (static subset of the C++14 standard). Features missing wrt the C++14. The SYCL model for single-source OpenCL / parallel C++ code. SPIR-V as a common representation of code that allows the integration of existing technology into a unified toolchain (LLVM-based compilers, GLSL, device drivers, format translators). Integration of OpenCL C++ within the SPIR-V SW ecosystem, convergence with Vulkan. |
| * 22/05/2017 ** TBB Lab time ** K-Means -- **Parallel algorithms** Introduction to some parallel algorithms based on implicit tree expansion : combinatorial exploration algorithms (N-queens), Divide and Conquer, Branch and Bound optimization methods. | * 22/05/2017 ** TBB Lab time ** K-Means algorithm development. -- **Parallel algorithms** A selection of parallel algorithms based on implicit tree expansion - combinatorial exploration algorithms (example: N-queens), Divide and Conquer, Branch and Bound optimization methods. Interaction among different parallel visit orders, computational grain size and available parallelism. Impact of inter-worker synchronization in the B&B case. |
| * 24/05/2017 OpenCL -- Lab Time | * 25/05/2017 Parallel B&B, parallel D&C. Different parallelism exploitation at different tree levels. An example of D&C algorithm in Data Mining : parallelisation options for the C4.5 algorithm mining classification trees. ** OpenCL ** -- Lab Time: OpenCL Linux installation. |
| * //26/05/2017// | * 26/05/2017 ** OpenCL ** Lab Time: Different implementations of 2d matrix multiplication algorithms (exploiting 2D and 1D work item distributions with 0D and 1D work items, global and local memory, local synchronizations among thread groups, access patterns). |
| * 29/05/2017 | * 29/05/2017 The Flowshop problem as an example of parallelizable B&B problem; parallel implementation choices with TBB/MPI. |
| * //30/05/2017// | * 30/05/2017 Stream computation of aggregate measures: the General Incremental Sliding-Window Aggregation algorithm and its parallelization. |
| |
| |
