|
- Parallel programming model - Wikipedia
Parallel programming model In computing, a parallel programming model is an abstraction of parallel computer architecture, with which it is convenient to express algorithms and their composition in programs
- List of concurrent and parallel programming languages - Wikipedia
This article lists concurrent and parallel programming languages, categorizing them by a defining paradigm Concurrent and parallel programming languages involve multiple timelines Such languages provide synchronization constructs whose behavior is defined by a parallel execution model
- Distributed computing - Wikipedia
Distributed computing is a field of computer science that studies distributed systems, defined as computer systems whose inter-communicating components are located on different networked computers [1][2] The components of a distributed system communicate and coordinate their actions by passing messages to one another in order to achieve a common goal Three challenges of distributed systems
- Algorithmic skeleton - Wikipedia
Algorithmic skeleton In computing, algorithmic skeletons, or parallelism patterns, are a high-level parallel programming model for parallel and distributed computing Algorithmic skeletons take advantage of common programming patterns to hide the complexity of parallel and distributed applications
- Single program, multiple data - Wikipedia
On distributed memory computer architectures, SPMD implementations usually employ message passing programming A distributed memory computer consists of a collection of interconnected, independent computers, called nodes For parallel execution, each node starts its own program and communicates with other nodes by sending and receiving messages, calling send receive routines for that purpose
- MapReduce - Wikipedia
MapReduce is a programming model and an associated implementation for processing and generating big data sets with a parallel and distributed algorithm on a cluster [1][2][3] A MapReduce program is composed of a map procedure, which performs filtering and sorting (such as sorting students by first name into queues, one queue for each name), and a reduce method, which performs a summary
- Parallel computing - Wikipedia
Parallel computing is a type of computation in which many calculations or processes are carried out simultaneously [1] Large problems can often be divided into smaller ones, which can then be solved at the same time There are several different forms of parallel computing: bit-level, instruction-level, data, and task parallelism
- Bulk synchronous parallel - Wikipedia
The BSP model was developed by Leslie Valiant of Harvard University during the 1980s The definitive article was published in 1990 [1] Between 1990 and 1992, Leslie Valiant and Bill McColl of Oxford University worked on ideas for a distributed memory BSP programming model, in Princeton and at Harvard Between 1992 and 1997, McColl led a large research team at Oxford that developed various BSP
|
|
|