Sumários
Programming with MPI: All-Pairs Shortest Paths (aula online)
16 abril 2020, 11:00 • José Monteiro
Implementation of the Sieve of Erastothenes. Optimizations: computational time; replacing communication by redundant computations; improving cache usage.
All-Pairs Shortest Paths, Floyd's algorithm: partitioning; input / output.
Project Review (aula online)
13 abril 2020, 11:00 • Amândio Ribeiro Faustino
Review of the OpenMP part of the class project.
Programming with MPI: The Sieve of Erastothenes (aula online)
13 abril 2020, 09:30 • José Monteiro
MPI, routines for collective communication. Basic MPI application, circuit satisfiability problem: MPI implementation; compiling and running; performance analysis. Second application, the Sieve of Eratosthenes: data decomposition options, global vs local array indexes.