Everything about Explicit multi-threading
Explicit Multi-Threading (XMT) is a computer science paradigm for building and programming parallel computers designed around the parallel random-access machine (PRAM) parallel computational model. A more direct explanation of XMT starts with the rudimentary abstraction that made serial computing simple: that any single instruction available for execution in a serial program executes immediately. A consequence of this abstraction is a step-by-step (inductive) explication of the instruction available next for execution. The rudimentary parallel abstraction behind XMT, dubbed Immediate Concurrent Execution (ICE) in Vishkin (2011), is that indefinitely many instructions available for concurrent execution execute immediately. A consequence of ICE is a step-by-step (inductive) explication of the instructions available next for concurrent execution. Moving beyond the serial von Neumann computer, the aspiration of XMT is that computer science will again be able to augment mathematical induction with a simple one-line computing abstraction. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Explicit multi-threadingA 5-minute orientation
- Pick up a classic book: Treaty Occupationay ToxicologyThe most-reprinted book on the subject
- Read the landmark paper: Synchronous cooperation for explicit multi-threadingCited 3 times
- Go sideways: Uzi VishkinA closely related topic
- Go sideways: Parallel RAMA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
Treaty Occupationay ToxicologySuelen Queiroz · 2010
The Conspirators HierarchyJohn Coleman · 1992
Tools and Algorithms for the Construction and Analysis of SystemsNir Piterman · 2013
Android Studio development essentialsNeil Smyth · 2014
The C# player's guideR. B. Whitaker · 2015
Introduction to making very big booksUnited States. Congress. Senate. Committee on Pensions · 2011
Practical Hajj and Omrah GuideMohammad Mamunur Rashid · 2014
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Uzi Vishkin Uzi Vishkin (Hebrew: עוזי וישקין; born 1953) is a computer scientist at the University of Maryland, College Park, where he is Professor of Electrical and…
- Parallel RAM In computer science, a parallel random-access machine (parallel RAM or PRAM) is a shared-memory abstract machine. As its name indicates, the PRAM is intended…
- XMTC XMTC (for explicit multi-threading C) is a shared-memory parallel programming language. It is an extension of the C programming language which strives…
- Analysis of parallel algorithms In computer science, analysis of parallel algorithms is the process of finding the computational complexity of algorithms executed in parallel – the amount…
- Concurrent computing Concurrent computing is a form of computing in which several computations are executed concurrently—during overlapping time periods, instead of sequentially—wit…
- Parallel computing Parallel computing is a type of computation in which many calculations or processes are carried out simultaneously. Large problems can often be divided…
- Gustafson's law In computer architecture, Gustafson's law (or Gustafson–Barsis's law) gives the speedup in the execution time of a task that theoretically gains from parallel…
- List ranking In parallel algorithms, the list ranking problem involves determining the position, or rank, of each item in a linked list. Conventionally, this rank denotes…