Search results
Results from the WOW.Com Content Network
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 .
Pointer jumping or path doubling is a design technique for parallel algorithms that operate on pointer structures, such as linked lists and directed graphs.Pointer jumping allows an algorithm to follow paths with a time complexity that is logarithmic with respect to the length of the longest path.
Kumar, V.: Scalability of Parallel Algorithms for the All-Pairs Shortest-Path Problem [dead link ]. Journal of Parallel and Distributed Programming 13, 1991. Foster, I.: Designing and Building Parallel Programs (Online). Bindell, Fall: Parallel All-Pairs Shortest Paths Applications of Parallel Computers, 2011.
This large body of parallel algorithms knowledge for the PRAM model and their relative simplicity motivated building computers whose programming can be guided by these parallel algorithms. Since productivity of parallel programmers has long been considered crucial for the success a parallel computer, simplicity of algorithms is important. Multi ...
The barrier [8] as a collective operation is a generalization of the concept of a barrier, that can be used in distributed computing. When a processing unit calls barrier, it waits until all other processing units have called barrier as well. Barrier is thus used to achieve global synchronization in distributed computing.
A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors. Distributed algorithms are used in different application areas of distributed computing , such as telecommunications , scientific computing , distributed information processing , and real-time process control .
Broadcast is a collective communication primitive in parallel programming to distribute programming instructions or data to nodes in a cluster. It is the reverse operation of reduction. [1] The broadcast operation is widely used in parallel algorithms, such as matrix-vector multiplication, [1] Gaussian elimination and shortest paths. [2]
The bulk synchronous parallel (BSP) abstract computer is a bridging model for designing parallel algorithms. It is similar to the parallel random access machine (PRAM) model, but unlike PRAM, BSP does not take communication and synchronization for granted. In fact, quantifying the requisite synchronization and communication is an important part ...