7) Using the diagram show the relation between given virtual memory address, find the physical memory address. Show how you arrived at your answer. a) 9550 b) 17800 c) 3040 d) 23000 e) 45330 Virtual address space OOK-64K 56K-60K 52K-OOK X X 48K-52K X 7 X 44K-40K 40K-44K 30K-40K 32K-36K 2AK-32K 24K-2AK 20K-24K 16K-20K 12K-16K BK-12K 4K-OK OK-4K 6 X X X 3 4 O 6 1 2 Virtual page Physical memory address 20K-32K 24K-28K 20K-24K 16K-20K 12K-16K BK-12K 4K-OK OK-4K Page frame O

7) Using the diagram show the relation between given virtual memory address, find the physical memory address. Show how you arrived at your answer. a) 9550 b) 17800 c) 3040 d) 23000 e) 45330 Virtual address space OOK-64K 56K-60K 52K-OOK X X 48K-52K X 7 X 44K-40K 40K-44K 30K-40K 32K-36K 2AK-32K 24K-2AK 20K-24K 16K-20K 12K-16K BK-12K 4K-OK OK-4K 6 X X X 3 4 O 6 1 2 Virtual page Physical memory address 20K-32K 24K-28K 20K-24K 16K-20K 12K-16K BK-12K 4K-OK OK-4K Page frame O

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

Similar questions

Compare 0-, 1-, 2-, and 3-address machines by writing programs to computeX = (A x B + C) / (D − E × B)for each of the four machines. The instructions available for use are as follows: M is a 16-bit memory address, and X, Y, and Z are either 16-bit addresses or 4-bit registers. The0-address machine uses a stack, the 1-address machine uses an accumulator, and the other two have16 registers and instructions operating on all combinations of memory locations and registers. SUB X,Y subtracts Y from X and SUB X, Y, Z subtracts Z from Y and puts the result in X. With 8-bit opcodesand instruction lengths that are multiples of 4 bits, how many bits does each machine need to computeX?
Consider the free memory layout shown below (the blocks are ordered from top to bottom). To the right, draw to the what the free memory layouts would be after satisfying requests for (in order) memory blocks of size 55K, 210K, 381K, and 395K. Draw one memory layout for the best-fit algorithm, and one for first-fit. 500K 300K 200K 300K
Suppose a byte-addressable computer using set-associative cache has 216 bytes of main memory and a cache of 32 blocks, and each cache block contains 8 bytes.Q.) If this cache is 2-way set associative, what is the format of a memory address as seen by the cache; that is, what are the sizes of the tag, set, and offset fields?
Table Q3 (a) lists the content of a program memory that consists of four (4) lines of AVR machine codes. Complete the encoding of the corresponding assembly language program in Table Q3 (b) Table Q3 (a) Instruction Memory Content no. address 00 ef 01 of 00 93 00 01 00 91 1 1000 2 1002 3 1003 1004 4 1005 4 1006 99 00 Table Q3 (b) Instruction mnemonics Operand1 Operand 2 Instruction type no. ldi R16 ;load 2 add ;arithmetic 3 sts R16 ;data transfer lds R16 ;load
Suppose a byte-addressable computer using set-associative cache has 216 bytes of main memory and a cache of 32 blocks, and each cache block contains 8 bytes.Q.) If this cache is 4-way set associative, what is the format of a memory address as seen by the cache?
Consider a memory implemented for 8086 microprocessor Draw the memory block diagram. Determine the values for A0 , /BHE ,address lines(A1..A19) and data lines(D0.. D15) in order to access: A byte at odd address [01FF3H] A byte at even address [01FFCH] A word at even address [01FFEH] A word at odd address [01ABFH]
Suppose a computer using fully associative cache has 224 bytes of byte-addressable main memory and a cache of 128 blocks, where each block contains 64 bytes.Q.) What is the format of a memory address as seen by cache; that is, what are the sizes of the tag and offset fields?
Ql'assuming the DS=1983 and SI-2284, BX-1325, BP-3425 and SS-1839, show the contents of memory locations after the execution? MOV CH,[BP]+23 MOV AX,[BX]+12
1. Show how the following values would be stored bybyte-addressable machines with 32- bit words, using little endianand then big endian format. Assume each value starts at address301816. Draw a diagram of memory for each, placing the appropriatevalues in the correct (and labeled) memory locations. a. 56789ABC16 b. 2014111910 2. The memory unit of a computer has256K words of 32 bits each. The computer has an instruction formatwith 4 fields: an opcode field; a mode field to specify 1 of 7addressing modes; a register address field to specify one of 16registers; and a memory address field. Assume an instruction is 32bits long. Answer the following: a. How large must the mode field be? b. How large must the register field be? c. How large must theaddress field be? d. How large is the opcode field? 4. (bonus question, 5 points) In a computerinstruction format, the instruction length is 12 bits and the sizeof an address field is 4 bits. Is it possible to have: 13 2-address instructions 45…
Question 6 The IEEE Standard 754 representation of a floating point number is given as: 01101110110011010100000000000000. Determine the binary value represented by this number. a) A cache system is to be designed to store data from a 1 GB memory space. If each block of main memory contains 16 words, determine the number of blocks that are needed and draw the logical organization of the full address identifying the block ID portion and the word (offset) portion. b) c) Discuss the advantages of using glass substrate over aluminum substrate in the construction of the hard drive.
By assuming that X = 3, and 33 is a two digit number, consider memory storage of a 64-bit word stored at memory word 33 in a byte-addressable memory (a) What is the byte address of memory word 33? (b) What are the byte addresses that memory word 33 spans? (c) Draw the number 0xF1234567890ABCDE stored at word 33 in both big endian and little-endian machines. Clearly label the byte address corresponding to each data byte value.
Outline the machine language instruction format (i.e., describe how the machine language instruction is divided into fields and state what each field is used for), and give the decimal value of each field, for each instruction in the following block of code. Assume that the code begins at memory address 500010. (NOTE: for the beq and j instructions, look carefully at the descriptions in the lecture notes for how branch and j format instructions are represented in machine language. Also be aware that when run using the default settings, QtSpim does not actually calculate the correct numeric constant field for branches, and so it will not show the correct machine code for "beq $t0, $s6, out". As described in the lecture notes and the text, the offset to the branch destination is measured in words, and calculated from the instruction after the branch instruction.) loop: addiu $s7, $s7, 4 lw $t0, 8($s7) beq $t0, $s6, out j loop out: addu $s7, $s7, $s1