Analysis of parallel algorithms
In computer science, the 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 (speed, space, etc.) changes as the number of processors is changed.
- Comment
- enIn computer science, the 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 (speed, space, etc.) changes as the number of processors is changed.
- Has abstract
- enIn computer science, the 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 (speed, space, etc.) changes as the number of processors is changed.
- Is primary topic of
- Analysis of parallel algorithms
- Label
- enAnalysis of parallel algorithms
- Link from a Wikipage to another Wikipage
- Algorithms
- Analysis of algorithms
- Big O notation
- Category:Analysis of parallel algorithms
- Computational complexity
- Data dependency
- Memory hierarchy
- Parallel random-access machine
- Scalability
- Speedup
- Time complexity
- SameAs
- 2Hyys
- m.012px918
- Q24282658
- Аналіз паралельних алгоритмів
- Subject
- Category:Analysis of parallel algorithms
- WasDerivedFrom
- Analysis of parallel algorithms?oldid=1070378063&ns=0
- WikiPageLength
- 9291
- Wikipage page ID
- 45209429
- Wikipage revision ID
- 1070378063
- WikiPageUsesTemplate
- Template:=
- Template:Math
- Template:Mvar
- Template:Parallel Computing
- Template:Reflist