Explore: Algorithmes Parallèles

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

science, analysis of parallel algorithms is the process of finding the computational complexity of algorithms executed in parallel – the amount of time

variation of Kahn's algorithm that breaks ties lexicographically forms a key component of the Coffman–Graham algorithm for parallel scheduling and layered

genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA).

In mathematics and computer science, an algorithm (/ˈælɡərɪðəm/ ) is a finite sequence of mathematically rigorous instructions, typically used to solve

sequential-algorithm designers to model algorithmic performance (such as time complexity), the PRAM is used by parallel-algorithm designers to model parallel algorithmic

14 July 2014. Rünger, Gudula (2006). "Parallel Programming Models for Irregular Algorithms". Parallel Algorithms and Cluster Computing. Lecture Notes in

graph. Many different algorithms have been designed for multiplying matrices on different types of hardware, including parallel and distributed systems

O(log n)-time parallel algorithm using n2 processors for the hidden-line problem under the concurrent read, exclusive write (CREW) parallel random-access

merge algorithm is again executed in parallel until the base case of the recursion is reached. The following pseudocode shows the modified parallel merge