This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Parallel algorithm" – news · newspapers · books · scholar · JSTOR(November 2012) (Learn how and when to remove this message)
In computer science, a parallel algorithm, as opposed to a traditional serial algorithm, is an algorithm which can do multiple operations in a given time. It has been a tradition of computer science to describe serial algorithms in abstract machine models, often the one known as random-access machine. Similarly, many computer science researchers have used a so-called parallel random-access machine (PRAM) as a parallel abstract machine (shared-memory).[1][2]
Many parallel algorithms are executed concurrently – though in general concurrent algorithms are a distinct concept – and thus these concepts are often conflated, with which aspect of an algorithm is parallel and which is concurrent not being clearly distinguished. Further, non-parallel, non-concurrent algorithms are often referred to as "sequential algorithms", by contrast with concurrent algorithms.
^Blelloch, Guy E.; Maggs, Bruce M. "Parallel Algorithms" (PDF). USA: School of Computer Science, Carnegie Mellon University. Retrieved 2015-07-27.
^Vishkin, Uzi (2009). "Thinking in Parallel: Some Basic Data-Parallel Algorithms and Techniques, 104 pages" (PDF). Class notes of courses on parallel algorithms taught since 1992 at the University of Maryland, College Park, Tel Aviv University and the Technion.
and 22 Related for: Parallel algorithm information
In computer science, a parallelalgorithm, as opposed to a traditional serial algorithm, is an algorithm which can do multiple operations in a given time...
variation of Kahn's algorithm that breaks ties lexicographically forms a key component of the Coffman–Graham algorithm for parallel scheduling and layered...
graph. Many different algorithms have been designed for multiplying matrices on different types of hardware, including parallel and distributed systems...
science, the analysis of parallelalgorithms is the process of finding the computational complexity of algorithms executed in parallel – the amount of time...
mergesort) is an efficient, general-purpose, and comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the relative...
minimum spanning tree, parallel connectivity, and set maxima algorithms", Proc. 13th ACM-SIAM Symposium on Discrete Algorithms (SODA '02), San Francisco...
An algorithm designed for such an environment is called a serial algorithm, as opposed to parallelalgorithms or distributed algorithms. Parallel algorithms...
Algorithms for calculating variance play a major role in computational statistics. A key difficulty in the design of good algorithms for this problem is...
traditional uses of the terms parallel and distributed algorithm that do not quite match the above definitions of parallel and distributed systems (see...
studied in parallelalgorithms, both as a test problem to be solved and as a useful primitive to be used as a subroutine in other parallelalgorithms. Abstractly...
genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA)....
sequential-algorithm designers to model algorithmic performance (such as time complexity), the PRAM is used by parallel-algorithm designers to model parallel algorithmic...
large numbers of processing elements. The potential speedup of an algorithm on a parallel computing platform is given by Amdahl's law S latency ( s ) = 1...
In computer science, a selection algorithm is an algorithm for finding the k {\displaystyle k} th smallest value in a collection of ordered values, such...
heap-based algorithm; in practice, it may be about as fast or slow as the heap-based algorithm. A parallel version of the binary merge algorithm can serve...
these algorithms are sometimes called sequential coloring algorithms. The maximum (worst) number of colors that can be obtained by the greedy algorithm, by...
"Just Join for Parallel Ordered Sets", Symposium on ParallelAlgorithms and Architectures, Proc. of 28th ACM Symp. ParallelAlgorithms and Architectures...
concurrently or in parallel. The term is primarily used to contrast with concurrent algorithm or parallelalgorithm; most standard computer algorithms are sequential...
mergesort is a parallelalgorithm for sorting. It is also used as a construction method for building a sorting network. The algorithm was devised by Ken...
In computer science, a deterministic algorithm is an algorithm that, given a particular input, will always produce the same output, with the underlying...
of parallel computer algorithms, refers to a measure of how effectively parallel computing can be used to solve a particular problem. A parallel algorithm...
Global Information