Semestr: Winter
Range: 2P+2S
Completion:
Credits: 4
Programme type:
Study form:
Course language:
Design and analysis of time-, and cost-efficient PRAM algorithms and parallel algorithms for distributed memory machines. The collection of algorithms includes: advanced parallel scan algorithms, distributed list ranking, Cole's MergeSort, optimal mesh sort, connected components, tree contraction and tree evaluation, pattern matching in texts.
J. H. Reif, ed. Synthesis of parallel algorithms, Morgan Kaufmann Publ., 1993, ISBN 1-55860-135-X