Problem 1. This problem is about operand modes, in particular about memory addressing using the operand modes described in lecture and the textbook. The following shows the contents of a portion of the program memory (locations Ox10000 through 0x10040), and certain registers. All contents are 64-bit quantities. Address Memory Contents 0x10040 0x10038 0x10030 0x10028 0x10020 0x10018 0x10010 0x10008 100 0x10040 200 25 0x10028 0x10020 500 0x10018 Register Contents %rdi 0x10008 %rsi 0x20 8 4 %rdx %rcx

Problem 1. This problem is about operand modes, in particular about memory addressing using the operand modes described in lecture and the textbook. The following shows the contents of a portion of the program memory (locations Ox10000 through 0x10040), and certain registers. All contents are 64-bit quantities. Address Memory Contents 0x10040 0x10038 0x10030 0x10028 0x10020 0x10018 0x10010 0x10008 100 0x10040 200 25 0x10028 0x10020 500 0x10018 Register Contents %rdi 0x10008 %rsi 0x20 8 4 %rdx %rcx

Name: Problem 1. This problem is about operand modes, in particular about m
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Problem 1. This problem is about operand modes, in particular about memory addressing usingthe operand modes described in lecture and the textbook. The following shows the contents of aportion of the program memory (locations Ox10000 through 0x10040

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: If $t1 has the base address of the array A, and $s1 corresponds to h. Given the C assignment…

A: I have answered this question in step 2.

Q: What happens to the values of the registers at each step when the program in memory is run on the…

A: It is defined as a type of computer memory used to quickly accept, store, and transfer data and…

Q: The table shows a segment of primary memory from a Von Neumann model computer.

Q: Assembly language is converted into executable machine code by a utility program referred to as an…

Q: A computer employs RAM chips of 512 x 8 and ROM chips of 256 x 8. The computer system needs 1K…

A: Solution a. How many RAM and ROM chips are needed? Size of RAM Chip computer employs RAM chips=256x8…

Q: What is the point of using cache memory if we already have volatile RAM (Random Access Memory)?…

A: Introduction : Cache memory is a type of high-speed memory that is located directly on the processor…

Q: The following problems deal with translating from C to MIPS. Assume that the variables f, g, h, i,…

A: The following problems deal with translating from C to MIPS. Assume that the variables f, g, h, i ,…

Q: Please look at the entire text below. Please solve and show all work. Thank you. What is the…

A: Translation of C statement B[8] = A[i−j]: The index for the array is calculated by i - j. Given that…

Q: Question 1: MIPS assembly to machine code Convert the following MIPS instruction into machine…

A: According to the given instruction (lw $21, 16($9), I'm providing the Machine code of this query. I…

Q: A, B are two integers arrays. The base address of A and B are in register x10 and x11, respectively.…

A: Let's see the solution in the next steps

Q: Implement and Compute the total memory traffic in bytes for both instruction fetch and instruction…

A: The total memory traffic involved in instruction fetch and instruction execution for the expression…

Q: the available space list of a computer memory is specified as follows: 9 start address block address…

A: Collection of information and data is called memory. The operating system contains some of the…

Q: For the following C statement, what is the corresponding MIPS assembly code? Assume that the…

A: The below answer provides the MIPS assembly code for the following C statement: B[f-j] = B[i] +…

Topic Video

Question

Problem 1. This problem is about operand modes, in particular about memory addressing using
the operand modes described in lecture and the textbook. The following shows the contents of a
portion of the program memory (locations Ox10000 through 0x10040), and certain registers. All
contents are 64-bit quantities.
Address Memory Contents
0x10040
0x10038
0x10030
0x10028
0x10020
0x10018
0x10010
0x10008
0x10000
a. movq (%rdi), %rax
b. movq (%rdi,%rsi), %rax
100
0x10040
200
25
0x10028
0x10020
c. movq 8(%rdi, %rcx, 4) %r8
d. movq -8(%rdi,%rsi), rbx
500
0x10018
2
Register Contents
%rdi
0x10008
%rsi
%rdx
%rcx
For each of the following instructions, say what value ends up in the destination register. Each
instruction starts with the state shown above, i.e., the effects do not accumulate.
0x20
8
4

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1: Given

Step 2: Answer

Step 3: Explanation

Solution

Trending now

This is a popular solution!

Step by step

Solved in 4 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Consider memory storage of a 32-bit word stored at memory word 34 in a byte addressable memory. (a) What is the byte address of memory word 34? (b) What are the byte addresses that memory word 34 spans? (c) Draw the number 0x3F526372 stored at word 342 in both big-endian and little-endian machines. Clearly label the byte address corresponding to each data byte value.
1. Consider memory storage of a 32-bit word stored at memory word 42 in a byte- addressable memory. (a) What is the byte address of memory word 42? (b) What are the byte addresses that memory word 42 spans? (c) Draw the number 0XFF223344 stored at word 42 in both big-endian and little- endian machines. Clearly label the byte address corresponding to each data byte value.
1. Consider memory storage of a 32-bit word stored at memory word 34 in a byte- addressable memory. (a) What is the byte address of memory word 34? (b) What are the byte addresses that memory word 34 spans? (c) Draw the number 0×3F526372 stored at word 342 in both big-endian and little-endian machines. Clearly label the byte address corresponding to each data byte value.
4. By assuming that 35 is a two digit number, consider memory storage of a 64- bit word stored at memory word 35 in a byte-addressable memory (a) What is the byte address of memory word 35? (b) What are the byte addresses that memory word 35 spans? (c) Draw the number 0XF1234567890ABCDE stored at word 35 in both big-endian and little-endian machines. Clearly label the byte address corresponding to each data byte value.
Translate the following C code to MIPS assembly, assuming that the variables f, g, h, i, and j correspond to registers $50, $s1, $s2, $s3, and $54 respectively. Also, assume that the base addresses of arrays A and B are contained in $56 and $s7 respectively, and that each element of arrays A and B are 4-byte words: B[8] =A[i] + A[j]; Which of the following MIPS assembly code snippets correctly performs the above operation? sll $t1, $s3, 2; add $t1, $56, $t1; lw $12, 0($t1); sll $t1, $s4, 2; add $11, $s6, St1; lw $13, 0($t1); add $12, $12, $t3; sw $12, 32($s7) sll $t1, $s3, 2; add $11, $s6, $t1; lw $12, 0($t1); sll $t1, $s4, 2; add $11, $s6, $t1; lw $13, 0($t1); add $t4, $12, $t3; sll $15, $t0, 2; add $15, $s7, $15; sw $t4, 32($15) Iw $11,0($s3); Iw $12, 0($s4); add $13, $11, $12; sw $13, 32($s7) sll $t1, $s3, 2; lw $12, 0($t1); sll $t1, $s4, 2; lw $13, 0($t1); add $t4, $t2, $t3; sw $t4, 32($s7)
Consider memory storage of a 64-bit word stored at memory word 32 ina byte-addressable memory(a) What is the byte address of memory word 32?(b) What are the byte addresses that memory word 32 spans?(c) Draw the number 0xF1234567890ABCDE stored at word 32 in both big-endianand little-endian machines. Clearly label the byte address corresponding to eachdata byte value.
Q2. For the following assume that values A, B, C, D, E, and F reside in memory. Also assume that instruction operation codes are represented in 6 bits, memory addresses are 64 bits, data size is 32 bits and register addresses are 5 bits. a. For each instruction set architecture shown in Figure A.1, how many addresses or names (including both memory and register), appear in each instruction for the code to compute C = A+ B, and what is the total code size? passor TOS Memory (A) Accumulator (C) Registry (D) Re loed oore Figure A.1 Operand locations for four instruction set architecture classes. The arrows indicate whether the oper and is an input or the result of the orithmetic-logical unit ALU operation, or both an input and result Lighter shoes indicate inputs, and the dark shode indicates the result in a top of stack (TOS) register points to the top input operand, which is combined with the operand below. The first operand is removed from the stack, the result takes the place of the…
Q.8. are missing. The assembler generates a relocatable code. All references use direct addressing. Write the values of the location counter (LC) and the contents of the symbol table, and also fill in the missing references in the machine code. (Assume that 3 bytes are allocated for each instruction and WORD pseudo-operation allocates 3 bytes and stores the given number at that byte.) Given the following assembly language program and its equivalent machine language code where some references START LC Machine code INST1 ЗА 00 00 Symbol Table L1: INST2 D1 D5 ?? ?? JZR L1 7B ?? ?? HLT 4C 00 00 D1: WORD 5 00 00 05 END
Q.1. A computer uses a memory unit with 1024 K words of 32 bits each (as shown in the figure below). A binary instruction code is stored in one word of memory. The instruction has four parts: an indirect bit, an operation code, a register code part to specify one of 64 registers, and an address part (15). How many bits are there in the operation code, the register code part, and the address part? Draw the instruction word format and indicate the number of bits in each part? How many bits are there in the data and address inputs of the memory?
By assuming 32 is a two digitnumber, consider memory storage of a 64-bit word stored at memory word 32 ina byte-addressable memory.(a) What is the byte address of memory word 32?(b) What are the byte addresses that memory word 32 spans?(c) Draw the number 0xF1234567890ABCDE stored at word 32 in both big-endianand little-endian machines. Clearly label the byte address corresponding to eachdata byte value.
Please solve and show all work. For the following C statement, what is the corresponding MIPS assembly code? Assume that the variables f, g, h, i, and j are assigned to registers $s0, $s1, $s2, $s3, and $s4, respectively. Assume that the base address of the arrays A and B are in registers $s6 and $s7, respectively. Assume that the elements of the arrays A and B are 8-byte words: f = (g+i+2) + (h − 8); B[8] = A[i-9] + A[j+8] + 7;
If random access memory (RAM) and cache memory (both of which are comprised of transistors), then what is the function of cache memory? Do we need several different forms of memory, or can we get by with only one?