Revision as of 08:41, 17 January 2025 edit OlliverWithDoubleL (talk \| contribs) Extended confirmed users 25,371 edits short description, links Tags: Mobile edit Mobile app edit iOS app edit App section source ← Previous edit		Latest revision as of 11:51, 27 January 2025 edit undo John of Reading (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 787,571 edits m →top: Typo fixing, fixed "the the" Tag: AWB
Line 1: {{short description\|Subfield of computer science}} In [[computer science]], '''analysis of parallel algorithms''' is the process of finding the [[computational complexity]] of [[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 algorithm]]s is similar to ~~the~~ [[analysis of algorithms\|the analysis]] of [[sequential algorithm]]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. ==Background==

Analysis of parallel algorithms: Difference between revisions