Accessing the operands - assembly language, Computer Engineering

Assignment Help:

Accessing the Operands:

  • operands are usually place in one of two places:

-registers (32 int, 32 fp)

-memory (232locations)

  • registers are

-simple to specify

-shut to the processor (fast access)

  • The idea that we desire to access registers whenever probable led to load-store architectures.

-normally all arithmetic instructions only access registers

-just access memory with explicit and stores and loads.

Load-store architectures

It can do: add r1=r2+r3 and then load r3, M(address)

⇒forces serious dependence on registers, which is accurately what you desire in today's CPU can't do add r1 = r2 + M(address)

- Other more instructions

+ Fast implementation (for example: easy pipelining)

 


Related Discussions:- Accessing the operands - assembly language

Telecommunications, with poisson arrival of two calls per minute what is th...

with poisson arrival of two calls per minute what is the probability that more than three calls will arrive in two minutes? that is the time during which at least 4 calls will arr

Explain how server form post-back works, Briefly explain how server form po...

Briefly explain how server form post-back works?  Post Back: The process in which a Web page sends data back to the similar page on the server. View State: View State is the m

What is a recursively enumerable language, What is a recursively enumerable...

What is a recursively enumerable language?            The languages that is accepted by TM is said to be recursively enumerable (r. e) languages.  Enumerable means that the stri

What is page fault, What is page fault? Its types? Page fault refers to...

What is page fault? Its types? Page fault refers to the situation of not having a page in the major memory when any process references it. There are two kinds of page fault :

Avoiding overfitting - decision tree learning , Avoiding Overfitting : ...

Avoiding Overfitting : However remember there that in the previous lecture, there is over fitting that common problem in machine learning. Furthermore details to decision tree

Find out the access time of ROM using bipolar transistors, The access time ...

The access time of ROM using bipolar transistors is about ? Ans. About 1 µ sec is the access time of ROM using bipolar transistors.

Illustration of cache size of a system, Q. Illustration of cache size of a ...

Q. Illustration of cache size of a system? Cache Size: Cache memory is very costly as compared to main memory and therefore its size is generally kept very small.  It has bee

Flow charts, n=(x*2)/(1=0) the value x=0 and is used to stop the algerithin...

n=(x*2)/(1=0) the value x=0 and is used to stop the algerithin.The calculation is repeated using values of x=0 is input. There is only a need to check for error positions. The va

Give an example of first fit and best fit algorithms, Given memory partiti...

Given memory partitions of 100k, 500k, 200k, 300k, and 600k (in order), apply first fit and best fit algorithms to place processes with the space requirement of 212k, 417k, 112k an

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