Jump to content
Wikipedia The Free Encyclopedia

Sequential algorithm

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Jlwoodwa (talk | contribs) at 23:31, 14 September 2024 (Adding short description: "Type of algorithm"). The present address (URL) is a permanent link to this version.Revision as of 23:31, 14 September 2024 by Jlwoodwa (talk | contribs) (Adding short description: "Type of algorithm")
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Type of algorithm

In computer science, a sequential algorithm or serial algorithm is an algorithm that is executed sequentially – once through, from start to finish, without other processing executing – as opposed to concurrently or in parallel. The term is primarily used to contrast with concurrent algorithm or parallel algorithm; most standard computer algorithms are sequential algorithms, and not specifically identified as such, as sequentialness is a background assumption. Concurrency and parallelism are in general distinct concepts, but they often overlap – many distributed algorithms are both concurrent and parallel – and thus "sequential" is used to contrast with both, without distinguishing which one. If these need to be distinguished, the opposing pairs sequential/concurrent and serial/parallel may be used.

"Sequential algorithm" may also refer specifically to an algorithm for decoding a convolutional code.[1]

See also

[edit ]

References

[edit ]


Stub icon

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

AltStyle によって変換されたページ (->オリジナル) /