The analysis of parallel algorithms in computer science involves determining the computational complexity of algorithms executed in parallel. This process is similar to analyzing sequential algorithms but more complex due to the need to consider multiple threads of execution. The goal is to understand how a parallel algorithm's resource usage changes with the number of processors.
Carnegie Mellon University
Spring 2014
A comprehensive course at Carnegie Mellon University that introduces fundamental principles of programming language design and implementation from a mathematical perspective. It delves deep into the structural and dynamic aspects of programming languages, studying concepts like recursion, objects, polymorphism, and parallelism.
No concepts data
+ 38 more concepts