Please help me with this Principles of programming language homework question 8.14 Suppose A is a 10 x 10 array of (4-byte) integers, indexed from [0][0] through [9][9]. Supposefurther that the address of A is currently in register r1, the value of integer i is currently in registerr2, and the value of integer j is currently in register r3.Give pseudo-assembly language for a code sequence that will load the value of A[i][j] into registerrl (a) assuming thatthatA is implemented using row pointers. Each line of your pseudocode should correspond to a singleinstruction on a typical modern machine. You may use as many registers as you need. You neednot preserve the values in r1, r2, and r3. You may assume that i and jare in bounds, and thataddresses are 4 bytes long.Which code sequence is likely to be faster? Why?

Name: Please help me with this Principles of programming language homework q
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Please help me with this Principles of programming language homework question 8.14 Suppose A is a 10 x 10 array of (4-byte) integers, indexed from [0][0] through [9][9]. Supposefurther that the address of A is currently in register r1, the value of i

Array access patterns impact performance in computer programs. Contiguous allocation (row major) and…

Engineering

Computer Science

8.14 Suppose A is a 10 x 10 array of (4-byte) integers, indexed from [0][0] through [9][9]. Suppose further that the address of A is currently in register r1, the value of integer i is currently in register r2, and the value of integer i is currently in register r3. Give pseudo-assembly language for a code sequence that will load the value of A[i]li] into register rl (a) assuming that A is implemented using (row-major) contiguous allocation; (b) assuming that A is implemented using row pointers. Each line of your pseudocode should correspond to a single instruction on a typical modern machine. You may use as many registers as you need. You need not preserve the values in r1, r2, and r3. You may assume that i and jare in bounds, and that addresses are 4 bytes long. Which code sequence is likely to be faster? Why?

8.14 Suppose A is a 10 x 10 array of (4-byte) integers, indexed from [0][0] through [9][9]. Suppose further that the address of A is currently in register r1, the value of integer i is currently in register r2, and the value of integer i is currently in register r3. Give pseudo-assembly language for a code sequence that will load the value of A[i]li] into register rl (a) assuming that A is implemented using (row-major) contiguous allocation; (b) assuming that A is implemented using row pointers. Each line of your pseudocode should correspond to a single instruction on a typical modern machine. You may use as many registers as you need. You need not preserve the values in r1, r2, and r3. You may assume that i and jare in bounds, and that addresses are 4 bytes long. Which code sequence is likely to be faster? Why?

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 19SA

See similar textbooks

Similar questions

.CLO2.3: Consider the instruction formats of the basic computer given in class. For the following 16-bit instruction, what is the equivalent operation performed by this instruction 0100 0010 0001 1011 Add AC with M[124] .A O Store AC in M[M[124]] .B Store AC in M[124] .C O Load AC with M[M[124]] .D O
Exercise 6.33 Write a function in high-level code that takes a 10-entry array of 32-bit integers stored in little-endian format and converts it to big-endian format. After writing the high-level code, convert it to MIPS assembly code. Comment all your code and use a minimum number of instructions.
• WRITE THE ASSEMBLY LANGUAGE CODE IN EITHER RISC-V/MIPS SIMULATOR. SUBMIT FILE WITH EXTENSION “S” . • Take the screenshot of result and Registers from the simulator • UPLOAD screenshot and .s file ON BLACKBOARD. 4) Write an Assembly language code that takes in two numbers b and p, and returns the result of below expression. x= ((b+5) * (p-2) * 10) / 4;
4. The Single Instruction Computer (SIC) has only one instruction that can do all operations our RISC-V does (you did a homework problem). The instruction has the following format sbn a, b, c # Mem[a]=Mem[a]- Mem[b]; if (Mem[a]- Mem[b]<0) go to PC+c For example, here is the program to copy a number from location a to location b: sbn temp, temp, 1 sbn temp, a, 1 sbn b,b, 1 sbn b, temp 1 Start: Design a single cycle datapath and control for this instruction set architecture.
Suppose the block size of the cache in the processor is 4096 bytes. The ASCII value of the characters 'a' through 'z' is 97 through 122. Suppose previously array2[99*4096] was loaded into the cache. Now we write a program that accesses array2[k*4096] and measures the time it takes to access the value, with k varying from 97 to 122. Why can you expect the access time to array2[k*4096] be lower for k=99 than others?
7. Write an Assembly language program to implement multiplication [0605H]* [0606H] & division [0605H]/[0606H] of two 8-bit numbers and store the result in the Memory locations 0607H(LS Byte) ,0608H(MS Byte), 0609H(Quotent) and 060AH(Remainder).
Exercise 6.2 Given a character array s, write a script that will count the number of consonants. For example, if s = '&ga23+3dUH', the script should output: The number of consonants is 3.
Write a program that performs a calculation on two byte arrays. *****Please use assembly code for ATMEGA2560. 4Y - X/3 = R X is an element of the first array, Y is an element of second array, and R is an element of the result array. Store the result as an integer word. Define the arrays X and Y as: X = .DB 1, 12, 33, 54, 75, 96, 117, 138, 159, 170, 191, 212, 223 Y = .DB -121, -102, -83, -64, -45, -26, 7, 28, 49, 60, 81, 102, 123
4.2.22 For each of the codes C = (S) with S defined below, find the generator polynomial g(x) and then represent each word in the code as a multiple of g(x). (a) S = {010, 011, 111} (b) S = {1010, 0101, 1111}
1.2 What is the complexity of the following Python code snippet in Big- O notation? Assume the input is a list of n sorted numbers. def binary_search(data, value): n = len(data) left = 0 right = n - 1 while left <= right: middle = (left + right) // 2 if value < data[middle]: right = middle - 1 elif value > data[middle]: left = middle + 1 else: return middle return 'Value is not in the list'print(binary_search(data, 2021))
Write a c++ code that implements a program that compares the running time for two loops which access very different number of array elements but which should have roughly the same number of cache misses. Try to estimate the average time for an array access with a cache miss and one without. use the following two loops (in the screenshot provided)
7.8 In languages that permit variable numbers of arguments in procedure calls, one way to find the first argument is to compute the arguments in reverse order, as described in Section 7.3.1, page 361. a. One alternative to computing the arguments in reverse would be to reorganize the activation record to make the first argument available even in the presence of vari- able arguments. Describe such an activation record organization and the calling sequence it would need.