Basic tradeoff of concerns for instruction set design, Computer Engineering

Assignment Help:

Q. Basic Tradeoff of concerns for instruction set design?

Basic Tradeoff: Smaller instruction (less space) vs. desire for more powerful instruction repertoire.

Generally programmer desire:

  • More operands andop-code: as it results in smaller programs
  • More addressing modes: for greater flexibility in implementing functions such as multiple branching,table manipulations.

Though a 32 bit instruction however will occupy double the space and can be fetched at double the rate of a 16 bit instruction thoughcan't be doubly useful. 

Factors which are must to be considered for deciding about instruction length:

  • Memory size: if larger memory range is to be addressed then more bits can be needed in address field.
  • Memory organization: if addressed memory is virtual memory then memory range that is to be addressed by instruction is larger than physical memory size.
  • Memory transfer length: Instruction length mustgenerally be equal to data bus length or multiple of it.
  • Memory transfer: Data transfer rate from memory preferablymust be equivalent to processor speed. It may become a bottleneck if processor executes instructions faster than rate of fetching the instructions. One solution for this problem is to use cache memory or another solution can be to keep instruction short.

Generally an instruction length is kept as a multiple of length of a character (which is 8 bits), and equal to length of fixed-point number. The term word is commonly used in this context. Generally the word size is equal to length of fixed point number or equal to memory-transfer size. Additionally a word must store integral number of characters. So word size of 16 bit, 32 bit, 64 bit are to be coming very common and henceforth the similar length of instructions are normally being used.


Related Discussions:- Basic tradeoff of concerns for instruction set design

Performance of a parallel algorithm - number of processors, Factor which he...

Factor which helps in analysis of parallel algorithms is the total number of processors needed to deliver a solution to a provided problem. So for a given input of size let's say n

What are different control function categories, What are different control ...

What are different control function categories. Explain. In several switching systems, the control subsystem may be an integral part of the switching network itself. This syst

Explain main requirements satisfy by page replacement policy, List out the ...

List out the main requirements between page replacement policies which should be satisfied by a page replacement policy? The major requirements that should be satisfied

Constraint satisfaction problems, Constraint Satisfaction Problems: Fu...

Constraint Satisfaction Problems: Furthermore I was perhaps most proud of AI on a Sunday. However this particular Sunday, a friend of mine found an article in the Observer reg

Draw a schematic for managing dynamic storage allocation, Draw a simple sch...

Draw a simple schematic for managing dynamic storage allocation. A simple schematic for managing dynamic storage allocation is as follows: Block size pointe

What is verilog case 1, What is verilog case (1) ? wire [3:0] x; al...

What is verilog case (1) ? wire [3:0] x; always @(...) begin case (1'b1) x[0]: SOMETHING1; x[1]: SOMETHING2; x[2]: SOMETHING3; x[3]: SOMETHING4; endcase

Different edi components and services, Different EDI components and service...

Different EDI components and services  Three main components containing services in EDI System are as follows:  •  Application Service: Gives the means of integrating existi

Explain policies for process scheduling, Explain any three policies for pro...

Explain any three policies for process scheduling that uses resource consumption information. All three policies for process scheduling are explained below in brief: 1. Fi

Illustration of a memory organization, Q. Illustration of a memory organiza...

Q. Illustration of a memory organization? Let's consider an illustration of a memory organization as displayed in Figure below in that main memory can store 32K words of 12 b

Binary search tree in the descending order, In order to get the information...

In order to get the information kept in a Binary Search Tree in the descending order, one should traverse it in which of the following order?    Right, Root, Left

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