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

Parallel computer architecture , Parallel Computer Architecture Intr...

Parallel Computer Architecture Introduction We have talked about the classification of parallel computers and their interconnection networks in that order in units 2 and

Illustrate what is universal law of universal gravitation, Q. Illustrate wh...

Q. Illustrate what is the universal law of universal gravitation? Answer:- Declaration that any particle of matter in the universe attracts any other with a force varying

For what CIDR stands, CIDR stands for? CIDR stands here for Classless I...

CIDR stands for? CIDR stands here for Classless Inter Domain Routing.

Define range which a normalised mantissa can signify, Now let's define rang...

Now let's define range which a normalised mantissa can signify. Let's presume that our present representations has normalised mantissa so left most bit can't be zero so it has to b

Initial thought process, Initial thought process: Design a script which...

Initial thought process: Design a script which was simple and user friendly.  Integrate procedures/functions to extract data under the hood.  I focused on giving the user the o

What is internal path length, Internal Path length It is described as t...

Internal Path length It is described as the number of node traversed while moving by one particular node to any other node in the tree.

Explain about cluster computing, The idea of clustering is defined as use o...

The idea of clustering is defined as use of multiple computers naturally multiple storage devices, PCs or UNIX workstations and their interconnections to make what emerges to users

Expalin johnson counter, Write short note on the Johnson counter. Ans:...

Write short note on the Johnson counter. Ans:  Johnson Counter: It is a synchronous counter, where all flip-flops are clocked concurrently and the clock pulses drive the

Calculate the shortest distance using minimum spanning tree, Does the minim...

Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes? No. The Minimal spanning tree makes sure that the total weight of the tree i

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