Parallel and Distributed Algorithms

The aim of the course is introducing the main concepts and methods in parallel and distribuite algorithm design, together with performance evaluation and comparison with sequential algorithms.

The student should be able to tell parallel from distributed world, apply techniques and methods presented along the course aiming to design efficient parallel and distribuite algorithms. In addition, the student should be able to analyze required computational resources, in order to assess performance and correctness of algorithms.