Everything About ___
Live briefing

Everything about Analysis of parallel algorithms

Subfield of computer science

In computer science, analysis of parallel algorithms is the process of finding the computational complexity of algorithms executed in parallel – the amount of time, storage, or other resources needed to execute them. In many respects, analysis of parallel algorithms is similar to the analysis of sequential algorithms, but is generally more involved because one must reason about the behavior of multiple cooperating threads of execution. One of the primary goals of parallel analysis is to understand how a parallel algorithm's use of resources changes as the number of processors is changed. Wikipedia →

đź§­ Start here: a 6-step reading path

  1. Read the overview: Analysis of parallel algorithmsA 5-minute orientation
  2. Skim a recent paper: A Unified Analysis Framework for Iterative Parallel-in-Time AlgorithmsInfluential work since 2022
  3. Pick up a classic book: Parallel Processing and Applied MathematicsThe most-reprinted book on the subject
  4. Read the landmark paper: Towards an Architecture-Independent Analysis of Parallel AlgorithmsCited 258 times
  5. Go sideways: Explicit multi-threadingA closely related topic
  6. Go sideways: Uzi VishkinA closely related topic

đź“– Definitions

No dictionary entry for this exact phrase.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

đź”— Related topics