Parallel Scientific Computing

Computationally complex problems cannot be solved in a single computer either because they are combinatiorially complex (NP-Hard) or because they are large involving much data such as very large matrices or much computation. The framework we use to solve these kinds of problems in parallel is called MPI, short for Message Passing Interface. We examine combinatorial problems such as Boolean Satisfiability, Set Partitioning, Traveling Salesman and large problems such as might be in matrix multiplication or simulated annealing.

Offer as needed