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
- Read the overview: Analysis of parallel algorithmsA 5-minute orientation
- Skim a recent paper: A Unified Analysis Framework for Iterative Parallel-in-Time AlgorithmsInfluential work since 2022
- Pick up a classic book: Parallel Processing and Applied MathematicsThe most-reprinted book on the subject
- Read the landmark paper: Towards an Architecture-Independent Analysis of Parallel AlgorithmsCited 258 times
- Go sideways: Explicit multi-threadingA closely related topic
- Go sideways: Uzi VishkinA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Towards an Architecture-Independent Analysis of Parallel Algorithms
Parallel Maximum Clique Algorithms with Applications to Network Analysis
Bottlenecks in parallel algorithms for power system stability analysis
Design and analysis of migration in parallel evolutionary algorithms
Design and Analysis of Parallel Monte Carlo Algorithms
On performance analysis of heterogeneous parallel algorithms
An Experimental Analysis of Parallel Sorting Algorithms
Parallel asynchronous team algorithms: convergence and performance analysis
🆕 Influential since 2022
A Unified Analysis Framework for Iterative Parallel-in-Time Algorithms
Convergence Analysis of Some Finite Element Parallel Algorithms for the Stationary Incompressible MHD Equations
Performance Analysis of Enhanced AES-128 and Blowfish Algorithms Through Parallel-Pipelined-Memory Techniques
Survey on distributed parallel genetic algorithms for large-scale data analysis
A Comprehensive Empirical and Theoretical Analysis of Batching Algorithms for Efficient, Safe, Parallel Mutation Analysis in Rust
📚 Books worth reading
Parallel Processing and Applied MathematicsRoman Wyrzykowski · 2003
Algorithms and Architectures for Parallel ProcessingYang Xiang · 2011
Algorithms for Parallel ProcessingMichael T. Heath · 1999
Transactional Memory. Foundations, Algorithms, Tools, and ApplicationsRachid Guerraoui, Paolo Romano · 2014
Transactions On Petri Nets And Other Models Of Concurrency VKurt Jensen · 2012
Algorithms And Architectures For Parallel Processing 11th International Conference Ica3pp 2011 Melbourne Australia October 2426 2011 ProceedingsYang Xiang · 2011- 📕OpenSHMEM and related technologiesMd.) OpenSHMEM 2014 (1st 2014 Annapolis · 2014
Algorithms and Architectures for Parallel ProcessingYang Xiang · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Explicit multi-threading Explicit Multi-Threading (XMT) is a computer science paradigm for building and programming parallel computers designed around the parallel random-access…
- Uzi Vishkin Uzi Vishkin (Hebrew: עוזי וישקין; born 1953) is a computer scientist at the University of Maryland, College Park, where he is Professor of Electrical and…
- Speedup Look up speedup in Wiktionary, the free dictionary. In computer architecture, speedup is a number that measures the relative performance of two systems…
- Work stealing In parallel computing, work stealing is a scheduling strategy for multithreaded computer programs. It solves the problem of executing a dynamically multithreade…
- Parallel RAM In computer science, a parallel random-access machine (parallel RAM or PRAM) is a shared-memory abstract machine. As its name indicates, the PRAM is intended…
- Gustafson's law In computer architecture, Gustafson's law (or Gustafson–Barsis's law) gives the speedup in the execution time of a task that theoretically gains from parallel…
- Amdahl's law In computer architecture, Amdahl's law (or Amdahl's argument) is a formula limiting the speedup of a task as resources are added to the system executing…
- Sun–Ni law Within theoretical computer science, the Sun–Ni law (or Sun and Ni's law, also known as memory-bounded speedup) is a memory-bounded speedup model which…