Illustrate program on hypothetical machine, Computer Engineering

Assignment Help:

Q. Illustrate program on hypothetical machine?

The program given in figure above is a hypothetical program which performs addition of numbers stored from locations 2001 onwards until a zero is encountered. Consequently X is initialized to 2001 whereas MBR which stores the result is initialized to zero. We have presumed that in this machine all operations are performed by CPU. The programs will execute instructions as:

215_Illustrate program on hypothetical machine.png

SKIP instruction is a zero-address instruction and skips next instruction to be executed in sequence. Or we can say it increments the value of PC by one instruction length. The SKIP also can be conditional. For illustration the instruction ISZ skips the next instruction only if the result of most recent operation is zero. 

715_Illustrate program on hypothetical machine1.png

CALL and RETN are used for CALLing subprograms and RETurning from them. Presume that a memory stack has been built such that stack pointer points to a non-empty location stack and expand in the direction of zero address.


Related Discussions:- Illustrate program on hypothetical machine

Develop an object-oriented design, Investigate the MIPS programmers model a...

Investigate the MIPS programmers model and develop an object-oriented design that will reflect aspects of the MIPS architecture. Consider the functional units of the architecture a

Show system call for cloning, Show System call for cloning.  Standard f...

Show System call for cloning.  Standard form of Clone function is as follows: Int clone (Int (*FN) (), void *child stack, Int flag, intargs,); Parameter FN is Pointer fro

What is a rendezvous point?, You insert rendezvous points into Vuser script...

You insert rendezvous points into Vuser scripts to imitate heavy user load on the server. Rendezvous points instruct Vusers to wait during test implementation for multiple Vusers t

Code segment , Specified  the code segment below and that n is the prob...

Specified  the code segment below and that n is the problem size, answer the following queries:   // . . . int sum = 0; if(x > 12){ for(int i = 1; i     for( i

Explain simple network management protocol, Explain SNMP (simple network ma...

Explain SNMP (simple network management protocol). Once SNMP is used the management station sends a request to an agent asking this for commanding or information this to update

How to fix an asic-based design from easiest to most extreme, How to fix an...

How to fix an ASIC-based design from easiest to most extreme? There are different ways to fix an ASIC-based design as given below: Initially, assume some reviews fundamentally.

Explain what is dtmf signalling, Explain what is DTMF signalling. Dual ...

Explain what is DTMF signalling. Dual Tone Multi Frequency (DTMF) was initially introduced in 1963 with 10 buttons into Western Electric 1500 -type telephones. Dual Tone Multi

What is open database connectivity, What is Open Database Connectivity (ODB...

What is Open Database Connectivity (ODBC) It happens that in addition to conventional or most popular database management systems, many companies go for proprietary software c

Queue depth should be greater than zero, Tell me which queue having present...

Tell me which queue having present queue depth should be greater than zero? Ans) Event queues Open MQ Explorer by selecting Start > Programs > IBM WebSphere MQ > WebSphere

Explain speedup performance and issues in pipelining, Speedup First, we...

Speedup First, we take the speedup factor which is we see how much speed up performance we achieve by pipelining. First we take ideal case for measuring the speedup. Let n b

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