Examples of Concurrent Solution Design:
Lectures for instructor demonstration. These lectures cover the workload partitioning methods for the typical program constructs of iteration, function (call) as well as the sub-tasking application scenario. The examples used for case study are known numeric algorithm of Least Square Estimation, encryption algorithm Huffman Coding and implementation of a Spell Checker. The examples in this module will enrich case study base that are currently in use for standard concurrent/parallel programming curricula.
Lizenzvertrag:
Creative Commons License
| Anhang | Größe |
|---|---|
Herunterladen course_materials-ExamplesofConcurrentSolutionDesign.zip | 1.66 MB |