![](/assets/images/picto-drapeau-france-3a76576a5d60a512053b4612ab58dae5.png)
4. Components of "restricted data flow" execution
As the various techniques are not totally independent, we introduce them in an order that avoids redundancy of presentation.
4.1 Ordered instruction termination
To allow for clean exceptions, instructions must terminate strictly in program order, as they would in a strictly sequential processor. In-order termination is implemented by a reorder buffer (ROB), which functions as a circular buffer. When an instruction is started, it is allocated an entry in the ROB that will contain the instruction's execution status. An instruction is only completed and removed from the ROB if it is guaranteed (no more speculative execution, no more possibility of interruptions) and all preceding instructions in the program's sequential order are completed from the point of view...
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
![](/assets/images/logo-eti-286623ed91fa802ce039246e516e5852.png)
The Ultimate Scientific and Technical Reference
This article is included in
Software technologies and System architectures
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Components of "restricted data flow" execution
Bibliography
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
![](/assets/images/logo-eti-286623ed91fa802ce039246e516e5852.png)
The Ultimate Scientific and Technical Reference