All categories

3 years ago

What is meant by instruction pipelining in RISC processor? Whatare

Computers and Technology

1 answer:

Evgesh-ka [11]3 years ago

7 0

Answer:

Explanation:

The instruction pipelining refers to various stages the instruction has to go through for the full execution of the instruction. Each instruction undergoes various stages in the execution, they are Instruction Fetch, Instruction Decode, Address Generator, Data Fetch, Execution and Write Back. Not every instruction may go through all the stages stated above. Pipelining exploits the parallelism in the execution of instructions (executing multiple instructions simultaneously ). Each instruction might be at different stage in the execution of program. It can be a 3-stage pipelining or 5 stage pipelining.

The implementation of Pipelining is a complex procedure.

In branch instructions, the complexity increases with the number of stages of pipeline.

You might be interested in

If you cannot find a template on your computer that was appropriate for your task, what should you do?

DanielleElmas [232]

Answer:

The correct option for this question is File.

Explanation:

5 0

3 years ago

State the difference between IBM PC and apple machintosh computers

azamat

Answer:

a Mac is a PC because PC stands for personal computer. However, in everyday use, the term PC typically refers to a computer running the Windows operating system, not the operating system made by Apple.

7 0

3 years ago

Name the written test a potential driver must pass

Oliga [24]

In order to obtain a learners permit, teen drivers are required to pass a written test. Typically they will prepare for this exam by completing a drivers education course. Though not a requirement in all states, drivers ed is the easiest way to be thoroughly prepared for the complicated driving laws and scenarios you’ll face on the permit exam. Once you pass your permit test and earn a permit, there may still be certain restrictions attached to this provisional license — such as requiring a licensed driver over a certain age to be seated in the passenger seat, limiting your driving to daylight hours, and other state-mandated rules.
General United States Permit Requirements
While each state has its own set of guidelines, in general, teens between 14 and 18 years of age can start the drivers education and learners permit process. Once a teen driver has obtained a learners permit, there are additional state-specific requirements they must meet before they can apply for their drivers license.
Before obtaining a learners permit in any state, a teenager is required to pass a driving knowledge test. Drivers education is the best way for a teen to prepare for this exam, whether the state requires it or not. In some cases, passing a drivers ed final exam can substitute for the written exam. No matter how the test is taken, students must pass with at least a 70% or higher, depending on that state’s minimum. Once he or she passes, a teen driver will be issued a learners permit. Some states require teen drivers to have a permit for a minimum of 6 months before they can take their drivers license exam.

hope this helped :)
alisa202

7 0

3 years ago

Given six memory partitions of 300 KB, 600 KB, 350 KB, 200 KB, 750 KB, and 125 KB (in order). The memory allocation algorithm th

Makovka662 [10]

Answer:

The memory allocation algorithm that is used to place the processes given is the <u>First Fit Algorithm </u>

Explanation:

The First Fit Management Algorithm works by ensuring that the pointer keeps track of all the free spaces in the memory and accepts and executes all instructions to allocate a memory block to the coming process as long as it is big enough to hold the size of the process.

For example, the First Fit algorithm will allocate the processes in the first block that fits (that is, if it can fit the memory bock in the queue, then the process will be store)

It will work as follows (recall that the memory partitions are in order and must remain so):

A) 115 KB is stored in 300KB block, leaving the following free spaces (185KB, 600KB, 350KB, 200KB, 750KB, 125KB), next

B) 500 KB is store in a 600KB block leaving the following free spaces (185 KB, 100 KB, 350 KB, 200 KB, 750 KB, 125 KB), next

C) 358 KB is stored in 750KB block, leaving the following free spaces (185KB, 100KB, 350KB, 200KB, 392KB, 125KB) next

D) 200 KB is stored in 350KB block, leaving the following free spaces (185 KB, 100 KB, 150KB, 200KB, 392KB, 125KB) next

E) 375KB is stored in 392KB block leaving (185KB, 100KB, 150KB, 200KB, 17KB, 125KB)

One of the demerits of this Algorithm is that, as shown above, memory is not maximized. It however is one of the easiest algorithms amongst all the other memory allocation processes.

Cheers

5 0

3 years ago

You can resize a row in a table by dragging the ____.

Sav [38]

Answer:

desk

Explanation:

You need more backround information i dont know what u talking about

6 0

3 years ago