050090 SE Seminar Theory Parallel Programming Models (2010S)
Continuous assessment of course work
Labels
Details
max. 15 participants
Language: German
Lecturers
Classes
Currently no class schedule is known.
Information
Aims, contents and method of the course
Assessment and permitted materials
Minimum requirements and assessment criteria
Understand the PRAM model and its main variant
Understand a selection of basic algorithmic techniques (parallel prefixes, list ranking, tree operations)
Understand a fundamental lower bound and limits to parallelization
Understand a selection of basic algorithmic techniques (parallel prefixes, list ranking, tree operations)
Understand a fundamental lower bound and limits to parallelization
Examination topics
Lectures and presentations of papers and book chapters, discussions
Reading list
Selected Material, copies will be made available
Association in the course directory
Last modified: Fr 31.08.2018 08:48
Access Machine (PRAM) - an idealized model of parallel computation in which
communication costs are abstracted by unit time access to a shared
memory, and processor resources are unbounded, and therefore eminently
suited to the study of parallel algorithmic techniques, difficulty of
problems, and limitations to parallelization. PRAM research pretty
much stopped in the mid-90ties, but the lecturer remain convinced that
the lessons that can be learned from PRAM algorithmics are essential
for any serious student of parallel computing (including and
especially for multicore parallel programming).