(One intermediate revision by one other user not shown)
Line 1:
{{short description|Subfield of computer science}}
In [[computer science]], the '''analysis of parallel [[algorithms]]''' is the process of finding the [[computational complexity]] of algorithms[[algorithm]]s executed in [[Parallel computing|parallel]] – the amount of time, storage, or other [[System resource|resources]] needed to execute them. In many respects, '''analysis of [[parallel algorithms'''algorithm]]s is similar to the [[analysis of algorithms|the analysis]] of [[sequential algorithmsalgorithm]]s, but is generally more involved because one must reason about the behavior of multiple cooperating [[Thread (computing)|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.
