Instruction set architecture, Computer Engineering

Assignment Help:

Question

(a) A 500 MHz Pentium III processor takes 2 ms to run a program with 200,000 instructions. A 300 MHz UltraSparc processor takes 1.8 ms to run the same program with 230,000 instructions. What is CPI for each processor for this program?

(b) For the above example, which processor is faster and by how much.

(c) Describe the meaning of the term Instruction Set Architecture.

(d) With the aid of an example, explain how pipelining in microprocessors improves the throughput of instruction execution.


Related Discussions:- Instruction set architecture

What is digitizers, What is Digitizers A common device for drawing, pai...

What is Digitizers A common device for drawing, painting, or interactively selecting coordinate positions on an object is a digitizer. These devices can be used to input coordi

What is tri-state logic, What is Tri-state logic ? Ans. Tri-state Logi...

What is Tri-state logic ? Ans. Tri-state Logic: In common logic circuits, there are two states of the output, as LOW and HIGH. If the output is not in the LOW state, this

What is mmu, What is MMU? MMU is the Memory Management Unit. It is a sp...

What is MMU? MMU is the Memory Management Unit. It is a special memory control circuit used for executing the mapping of the virtual address space onto the physical memory.

How to update bios chip, There are two methods to update your BIOS chip: ...

There are two methods to update your BIOS chip: 1. Flash it (software method) 2. Program it with an EEPROM programmer. This is a hardware method. This is how we at BIOSMAN pr

Convert the following into sop form, Convert the following into SOP form ...

Convert the following into SOP form 1. (A+B) (B'+C) (A'+ C) 2. (A'+C) (A'+B'+C') (A+B') 3. (A+C) (AB'+AC) (A'C'+B)

Dynamic programming, Given: • A sequence of n arrival times t0, t1, ..., ...

Given: • A sequence of n arrival times t0, t1, ..., tn-1, • a library of mlogically equivalent gates {(d0, c0), (d1, c1), ..., (dm-1,cm-1)} where d is delay and c is cost • a

Explain wait for graph-resource request and allocation graph, Explain Wait ...

Explain Wait for graph (WFG) with Resource request and allocation graph (RRAG). WFG with RRAG: A graph G = (V,E) is termed as bipartite if V can be decomposed in two

Determine the signed numbers are used in binary arithmetic, When signed num...

When signed numbers are used in binary arithmetic, then which one of the notations would have unique representation for zero ? Ans. When signed numbers are utilized in binary ar

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd