Orthogonality means that an instruction set has a "backup" instruction that can be used instead of any other instruction that gets the same result. You have to prove or disprove my assumption.

Although most of your programming courses have focused on writing sequential programs, using lots of parallelism is the way to faster execution. We talked about two different basic execution models that can support massively-parallel execution: MIMD and SIMD. One of the easiest ways to get some speedup by parallel processing is to simultaneously execute multiple copies of the same sequential program with different input data. For example, if you need to convert thousands of images from color to black & white, simultaneously running 32 copies of a sequential program that converts a single image at a time could easily get you nearly 32X speedup over running one copy of the program at a time to process each image. Is that type of parallel execution essentially MIMD, SIMD, or equally suited to both MIMD and SIMD? Why?

Because of this, the means by which one instruction acquires its input data are independent of the means by which another acquires its data. When used with a(n): A Combining sets of data with sets of instructions B An example of "multiple data, multiple instruction" C D is for "data alone," meaning there is just one instruction. One order, several results

In some instruction sets, call and return instructions make use of a RR register to hold the return address rather than doing so on the stack. Show how the code in the above problem should be changed if call and return instructions used a RR register for return addresses rather than the stack. Don't change the program's function. 500 MOV R1, X 501 MOV R2, Y 502 MOV R3, Z 503 PUSH R1 504 CALL 550 505 POP R3 506 CALL 560 507 HALT · · 550 PUSH R2 551 CALL 560 552 POP R2 553 RET · · 560 PUSH R3 561 PUSH R1 562 POP R2 563 POP R1 564 RET

In generall, computers think in terms of numbers (i.e. binary data). Thus, any operation performed in the computer must be done using either mathematical or logical operations. Given this inherit limitation of computers, what is the compare instruction actually doing when we, as assembly programmers, provide two numbers for it to "compare"? Furthermore, what assembly instruction is similar to the compare instruction? How are the two instructions different?

There are a few different configurations that might be used for the central processing unit (CPU) of a computer. The general register, a single accumulator, or a stack are the three possibilities. There are positives and negatives associated with each option individually. It is up to you to provide a response, and the response that you provide might be accurate or it could be erroneous.

Explain how the basic instruction cycle works from the following image:

Have a question requiring an answer in assembly language

We wish to execute a single LC-3 instruction that will subtract the decimal number 33 from R1 and put the result in R2. Can we do it? a. No, because the smallest number that fits 5 bits is -32b. No, because we don't have SUB instruction to subtractc. No, because the smallest number that fits 5 bits is -16d. Yes, we can do it with a single instruction.e. none of the above.

Our ‘mostly 8-bit’ design has the problem that computed pointers can only range over256 bytes of memory. This makes using the screen difficult (though not impossible!). Howmight you extend the instruction set to make this easier? [Hint: think about spare bits inthe C-instruction.]