Q1). Suppose $s0 stores the base address of word array A and $t0 is associated with m, convert the following instruction into MIPS. A[240] = A[240+m]Q2). Suppose $t0 stores the base address of word array A and $s0 is associated with m, convert the following instruction into MIPS. m= 0 while (m <= 10): A[m] = A[m+4]*6 m = m + 5

Q1). Suppose $s0 stores the base address of word array A and $t0 is associated with m, convert the following instruction into MIPS. A[240] = A[240+m]Q2). Suppose $t0 stores the base address of word array A and $s0 is associated with m, convert the following instruction into MIPS. m= 0 while (m <= 10): A[m] = A[m+4]*6 m = m + 5

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter2: Problem Solving Using C++using

Section2.3: Data Types

Problem 9E: (Practice) Although the total number of bytes varies from computer to computer, memory sizes of...

See similar textbooks

Similar questions

a. Translate with a three-address statement, the following expression: n = f((x+2), y) – 5; b. If A is an array of integers with width = 4; Translate with three-address statement, the following expression: x = a[i] + 2;
a) Fill in the blanks..data A: .word 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 i: .word 7 B: .word 40 45 50 55 60 65 k: .word 1 m: .word 5 # how many f: .word 15 #size of A g: .word 6 #size of B .text .globl main main: # load registers for array A la $s0, A # load address of A lw $s2, i # load word i into s2 # load registers for array B la $s1, B # load address of B lw $s3, k # load word k into s3 #how many to overwrite lw $s4, m # load word g (how many) into s4 # initialize registers to get A[i] sll $s6, $s2, 2 add $s6, $s6, ____ # address of A[i] (new base) # initialize registers to get B[k] sll $s7, $s3, 2 add $s7, $s7, ____ # address of B (new base) #what is the A index to stop? Let's put it into s5 ______________________________ #Loop through A and B Loop: # use slt to compare $s5 and $s2, place the result in t0 ___________________________ beq $t0, $zero, end # load A[i] and store into B[k] lw $t0, 0($s6) sw $t0, 0($s7) #update of the indices addi $s3, $s3, ____ addi $s2,…
c) To illustrate what difference a vector processor can make as compared to a traditional CPU, consider a hypothetical RISC machine with these lines of code ; Hypothetical RISC machine; add 10 numbers in a to 10 numbers in b, storing results in c; assume a, b, and c are memory locations in their respective registers move $10, count ; count := 10 loop: load r1, aload r2, badd r3,r1,r2 ;r3:=r1+r2store r3, cadd a,a,$4 ;moveonadd b,b,$4add c,c,$4dec count ; decrementjnez count, loop ; loop back if count is not yet 0 ret How would a Cray-style vector machine process this information? d.) State three advantages in the vector style approach
6. Assume a computer has 32-bit integers. Show how the value 0x0001122 would be stored sequentially in memory, starting at address 0x000, on both a big endian machine and a little endian machine, assuming that each address holds one byte. Address Big Endian Little Endian0x000 0x001 0x002 0x003
CA_6 We study the properties of cache memory, and for reasons of easier design and efficient circuits, we assume that the cache capacity is 2i Bytes, and cache line size is 2j Bytes, with i and j being natural numbers: (a) How many bits should the tag field have? And can the tag field contain 0 bit (i.e., be empty)? Elaborate (b) Repeat the above for the index field. (c) Repeat the above for the byte-offset field. (d) Finally, depict a figure showing a cache line, indicate what fields it possibly has, state the possible sizes of these fields, and explain the uses of these fields.
We will explore the impact of cache capacity on performance, focusing exclusively on the data cache and excluding instruction storage in the caches. Cache access time is directly linked to its capacity. For the sake of simplicity, let's assume that accessing the main memory takes 100ns, and in a specific program, 50% of instructions involve data access. Two distinct processors, denoted as P1 and P2, are engaged in executing this program. Each processor is equipped with its own L1 cache. L1 size L1 Miss Rate L1 Hit Time P1 64 KB 3.6% 1.26 ns P2 128 KB 3.1% 2.17ns (a) What is the AMAT for P1 and P2 assuming no other levels of cache?
(Practice) Although the total number of bytes varies from computer to computer, memory sizes of millions and billions of bytes are common. In computer language, the letter M representsthe number 1,048,576, which is 2 raised to the 20th power, and G represents 1,073,741,824, which is 2 raised to the 30th power. Therefore, a memory size of 4 MB is really 4 times 1,048,576 (4,194,304 bytes), and a memory size of 2 GB is really 2 times 1,073,741,824 (2,147,483,648 bytes). Using this information, calculate the actual number of bytes in the following: a. A memory containing 512 MB b. A memory consisting of 512 MB words, where each word consists of 2 bytes c. A memory consisting of 512 MB words, where each word consists of 4 bytes d. A thumb drive that specifies 2 GB e. A disk that specifies 4 GB f. A disk that specifies 8 GB
Assume we have a free space management system as described in the book, for example one used to provide us with virtual addresses on the heap (with physical addresses handled by a much simpler system since we assume paging). Assume the system uses the following very simple rules; A memory request traverses the free list, and finds the first block large enough to handle the request (i.e., the first fit algorithm from the book). It then: Splits the block into 2 pieces: The first piece will be the requested size + 1k (for a header). The second will be the remaining The first piece will be returned to the caller, but the address returned will be the address of the memory for the user, that is the header + 1k The second will be put back into the linked list If there's insufficient contiguous memory, the allocation will fail (return 0) Free memory is stored as a linked list in address order Assume we start with a single contiguous block of FREE memory of size 64k starting at location…
) Consider the following sequence of virtual memory references (in decimal) generatedby a single program in a pure paging system:100, 110, 1400, 1700, 703, 3090, 1850, 2405, 2460, 4304, 4580, 3640a. Derive the corresponding reference string of pages (i.e. the pages the virtual addressesare located on), assuming a page size of 1024 bytes. (Assume that page numberingstarts at 0)b. For the page sequence derived above, determine the number of page faults for each ofthe following page replacement strategies, assuming that two (2) page frames areavailable to the program.i. LRUii. FIFOiii. OPT (Optimal)
1. Write an ALGORITHM to calculate the address of any element A [I, J] of a two-dimensional array A [1: M, 1: N]. Assume the array is stored in column-major order, B is the base address of the array and w is the size of each element in the array. 2. A two-dimensional array A with n rows time and m columns can be represented in either row-major or column-major form. Establish the address translation functions to locate any element from the one-dimensional array. The element is specified by two-dimensional parameters along with the data type. 3. Write an ALGORITHM to find the transpose of a sparse matrix.
Microprocessors I need EMU8086 - MICROPROCESSOR EMULATOR code to run all given tasks below Task 01Swap two numbers using ADD/SUB instructions only.Task 02If A, B and C are 3 variables, perform the given mathematical operation • A = C + (B – A) - 2 ;Task 03If X, Y and Z are 3 variables, then perform the given mathematical operation• Y * Y / (4 * X * Z)Task 04Perform the following arithmetic operation: 10 * 7 / (1 - 4) + 13 + 52 – 4 *
10.- Consider the following code and pictureLoop1MOVLW 0x32MOVWF REG2DECFSZ REG2,FGOTO LOOP1 If the system clock frequency is aMHz and each machine cycle consumes 4 cycles of it. Calculate the delay time of the LOOP1 loop. Include the execution difference time of the DECFSZ instruction in the last cycle. Select an answerA) 0.6.sB) 6msC)6usD) 60us