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
  1. ^ "A Dictionary of Computing at Encyclopedia.com".


Stub icon

This algorithms or data structures-related article is a stub. You can help Wikipedia by adding missing information.

📚 Artikel Terkait di Wikipedia

Maximal independent set

Between the totally sequential and the totally parallel algorithms, there is a continuum of algorithms that are partly sequential and partly parallel

Prim's algorithm

In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a

Connected-component labeling

connected-component algorithms in image analysis applications, due to the bottleneck of sequentially processing each pixel. The interest to the algorithm arises again

Lexicographic optimization

and developed a lexicographic simplex algorithm. In contrast to the sequential algorithm, this simplex algorithm considers all objective functions simultaneously

Parallel algorithm

algorithms are often referred to as "sequential algorithms", by contrast with concurrent algorithms. Algorithms vary significantly in how parallelizable

Algorithm

ISBN 978-0-312-10409-2., ISBN 0-312-10409-X Yuri Gurevich, Sequential Abstract State Machines Capture Sequential Algorithms, ACM Transactions on Computational Logic, Vol

Sequential pattern mining

string processing algorithms and itemset mining which is typically based on association rule learning. Local process models extend sequential pattern mining

Kruskal's algorithm

which runs the sequential algorithm on p subgraphs, then merges those subgraphs until only one, the final MST, remains. Dijkstra's algorithm Greedy geometric