Live briefing
Everything about Relaxed sequential
Relaxed sequential in computer science is an execution model describing the ability of a parallel program to run sequentially. If a parallel program has a valid sequential execution it is said to follow a relaxed sequential execution model. It does not need to be efficient. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Relaxed sequentialA 5-minute orientation
- Pick up a classic book: Neural Information ProcessingThe most-reprinted book on the subject
- Read the landmark paper: Coordinated Beamforming With Relaxed Zero Forcing: The Sequential Orthogonal Projection Combining Method and Rate ControlCited 29 times
- Go sideways: Concurrent computingA closely related topic
- Go sideways: Testing high-performance computing applicationsA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
No outline available.
🏆 Landmark papers (most cited)
Coordinated Beamforming With Relaxed Zero Forcing: The Sequential Orthogonal Projection Combining Method and Rate Control
Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
Variational approach to relaxed topological optimization: Closed form solutions for structural problems in a sequential pseudo-time framework
Relaxed Effective Callback Freedom: A Parametric Correctness Condition for Sequential Modules With Callbacks
Sequential Estimation of Frequency and Direction-of-Arrival Based on the Relaxed Coprime Array for Multiple Targets
A sequential quadratic Hamiltonian scheme to compute optimal relaxed controls
đź“š Books worth reading
Neural Information ProcessingTingwen Huang · 2012
Operations ManagementRoberta S. Russell, Bernard Taylor · 1998
A primer on memory consistency and cache coherenceDaniel J. Sorin · 2011
Practical Electronics for InventorsPaul Scherz · 2000
Computational combinatorial optimizationM. Jünger · 2001
Programming Languages and SystemsMatthias Felleisen · 2013
Mathematical programming for agricultural, environmental, and resource economicsHarry Mason Kaiser · 2010
Practical electronics for inventorsPaul Scherz · 2013
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…
- Testing high-performance computing applications High-performance computing applications run on massively parallel supercomputers consist of concurrent programs designed using multi-threaded, multi-process…
- 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…
- Automatic parallelization Automatic parallelization, also auto-parallelization or autoparallelization, is a compiler optimization in which a compiler or other software tool transforms…
- Linearizability In concurrent programming, an operation (or set of operations) is linearizable if it consists of an ordered list of invocation and response events, that…
- 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…
- Race condition A race condition or race hazard is the condition of an electronics, software, or other system where the system's substantive behavior is dependent on the…
- Implicit parallelism In computer science, implicit parallelism is a characteristic of a programming language that allows a compiler or interpreter to automatically exploit…