Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Network Articles
Page 60 of 66
What is Parallel Execution in Computer Architecture?
When instructions are executed in parallel, they will be completed in out-of-program order. Here, it does not matter whether instructions are issued or dispatched in order or out-of-order, or whether shelving is used or not. The point is that unequal execution times force instructions to finish out-of-order, even if they are issued (and dispatched) in order. Then short, ‘younger’ instruction can be completed previous than long, ‘older’ ones. Thus, superscalar instructions give rise to an out-of-order finishing of instructions.Here, it can make a distinction between the terms ‘to finish’, ‘to complete’, and ‘to retire’ an instruction. The term ‘to finish’ ...
Read MoreWhat are different methods to implement rename buffers?
There are four different methods to implement rename buffers such as using a merged architectural and rename register file, employing a separate name register file, or holding renamed values either in the ROB or in DRIS.In the first method, rename buffers are executed along with the architectural registers in a similar physical register file, known as the merged architectural and rename register file. The merged register file has to provide a large enough number of physical registers to implement both the architectural and rename registers. For instance, the Power1 provides 40 and the R10000 64 physical registers for renaming 32 ...
Read MoreWhat are the layouts of the rename buffers?
The layout of the rename buffers establishes the actual framework for renaming. There are three basic components are the type and the number of the rename buffers and the basic mechanism which is used for accessing rename buffers as displayed in the figure.Type of rename buffersThe chosen type of rename buffers has the largest impact on renaming. It is definitive for the basic approach of the implementation and thus it determines where the intermediate results of the instruction are to be written into or read form. It can be designated as intermediate results which have already been generated but are ...
Read MoreWhat is Latches in Computer Architecture?
A latch is a device with particularly two stable states and these states are high-output and low-output. A latch has a feedback direction, to maintain the data. Latches can be memory devices and can save one bit of information. It is used to “latch onto” data and save it in the required area. One of the most generally used latches is the SR latch.SR LatchAn SR latch is an asynchronous device. An SR latch does not rely upon control signals but relies only on the state of the S and R inputs. An SR latch can be generated by interlinking ...
Read MoreWhat is Logic Gates?
A logic gate is an electronic device that creates logical decisions depends on the various combinations of digital signals accessible on its inputs. A digital logic gate can have greater than one input signal but has only one digital output signal. There are seven basic logic gates such as AND, OR, XOR, NOT, NAND, NOR, and XNOR.AND GateIt is a digital logic gate. It has an output that is frequently at logic level “0” and goes “HIGH” to a logic level “1” when all of its inputs are at logic level “1”. The output of AND gate returns “LOW” when ...
Read MoreWhat are the treatments of an empty reservation station?
When instruction arrives at an empty reservation station, the superscalar processor follows two different approaches as shown in the figure. The straightforward approach is to process is an instruction in the same way as with a partially filled reservation station. However, entering instructions have to stay for at least one cycle in the empty station before they are dispatched. The Nx586 is an example of a processor that treats an empty reservation station in this way.A more advanced approach for treating empty reservation stations is the use of bypasses. Here some additional circuitry permits instructions to bypass an empty station ...
Read MoreWhat are the schemes for checking the availability of operands?
The availability of operands has to be checked in two scenarios such as when the operands are fetched from the register file, a scheme is needed to check whether requested contents are available in the register file. A similar scheme is needed during instruction dispatch to check whether all the operands of the instructions held in the shelving buffers are available.The term scoreboard was introduced in connection with CDC 6600 (1964) to denote the complex circuitry used in this processor for controlling parallel operation. The figure shows the principle of scoreboarding.The scoreboard is a status register consisting of one-bit entries. ...
Read MoreWhat is Dispatch Rate?
Unlike individual reservation stations, a group or central reservation station, or a DRIS must be efficient in dispatching higher than one instruction in each cycle. In these cases, the design space needs an additional component that determines how many instructions can be dispatched from each of the reservation stations or the DRIS per cycle. This component is called dispatch rate.A shelving buffer must be capable of dispatching one instruction to any EU connected to it in each cycle. This is easier to achieve for group stations with two to three EUs than for a central station or a DRIS with ...
Read MoreWhat is Dispatch policy?
The dispatch policy specifies how instructions are selected for execution and how to dispatch blockages are handled. The dispatch policy can be considered as a scheduling policy consisting of the components specified as shown in the figure.Selection Rule − The selection rule specifies when instructions are considered executable. Let us take it for granted that renaming is employed and unresolved conditional transfer instructions are managed by speculative branch processing.Arbitration Rule − It can also need an arbitration rule for the case when more instructions are eligible for execution that can be disseminated in the next cycle. Most processors use a ...
Read MoreWhat are the types of Operands fetch Policies?
There are two types of operands fetch policies such as issue bound or dispatch bound. The issue-bound fetch policy defines that operands are fetched during instruction issues. In this method, shelving buffers influence instructions with their operand values, needing that the buffers be fully long to support space for all the source operands.The other basic operand fetch policy is the dispatch bound fetch policy, when operands are fetched during dispatching. In this case, shelving buffers contain short register identifiers instead of long operands.The issue bound fetch policyIn this case, while issuing the instructions, the referenced source register numbers are forwarded ...
Read More