Live briefing
Everything about Explicit parallelism
Parallelism expressed within computations
In computer programming, explicit parallelism is the representation of concurrent computations using primitives in the form of operators, function calls or special-purpose directives. Most parallel primitives are related to process synchronization, communication and process partitioning. As they rarely contribute to actually carry out the intended computation of the program but, rather, structure it, their computational cost is often considered as overhead. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Explicit parallelismA 5-minute orientation
- Pick up a classic book: The death of ChristThe most-reprinted book on the subject
- Read the landmark paper: Explicit Absolute Parallelism for 2-Nondegenerate Real Hypersurfaces $$M^5 \subset \mathbb {C}^3$$ of Constant Levi Rank 1Cited 18 times
- Go sideways: Concurrent computingA closely related topic
- Go sideways: Explicit multi-threadingA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Explicit Absolute Parallelism for 2-Nondegenerate Real Hypersurfaces $$M^5 \subset \mathbb {C}^3$$ of Constant Levi Rank 1
Explicit Control of Implicit Parallelism in Decomposition-Based Evolutionary Many-Objective Optimization Algorithms [Research Frontier]
Stabilized explicit peer methods with parallelism across the stages for stiff problems
An Alternating Segment Explicit-Implicit Scheme with Intrinsic Parallelism for Burgers’ Equation
Limits of parallelism in explicit ODE methods
Experiments with list ranking for explicit multi-threaded (XMT) instruction parallelism
An explicit parallelism study based on thread-level speculation
Effective Code Generation for Processor Architectures with Explicit Parallelism
đź“š Books worth reading
The death of ChristJames Denney · 1902
Technical CommunicationJohn M. Lannon · 2000
Cartesian meditationsEdmund Husserl, Dorion Cairns · 1960
Introduction to Computing Using PythonLjubomir Perkovic · 2011
The Conspirators HierarchyJohn Coleman · 1992
Treaty Occupationay ToxicologySuelen Queiroz · 2010
Numerical recipes in Fortran 90William H. Press, Saul A. Teukolsky · 1996
Programming Massively Parallel ProcessorsDavid Kirk, Wen-Mei W. Hwu · 2010
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Concurrent computing Concurrent computing is a form of computing in which several computations are executed concurrently—during overlapping time periods, instead of sequentially—wit…
- Explicit multi-threading Explicit Multi-Threading (XMT) is a computer science paradigm for building and programming parallel computers designed around the parallel random-access…
- Non-blocking algorithm In computer science, an algorithm is called non-blocking if failure or suspension of any thread cannot cause failure or suspension of another thread; for…
- 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…
- Purely functional programming In computer science, purely functional programming usually designates a programming paradigm—a style of building the structure and elements of computer…
- Automatic parallelization Automatic parallelization, also auto-parallelization or autoparallelization, is a compiler optimization in which a compiler or other software tool transforms…
- Fork–join model In parallel computing, the fork–join model is a way of setting up and executing parallel programs, such that execution branches off in parallel at designated…
- Memory access pattern In computing, a memory access pattern or IO access pattern is the pattern with which a system or program reads and writes memory on secondary storage.…