Computer Systems: A Programmer's Perspective (3rd Edition)
3rd Edition
ISBN: 9780134092669
Author: Bryant, Randal E. Bryant, David R. O'Hallaron, David R., Randal E.; O'Hallaron, Bryant/O'hallaron
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 9, Problem 9.12HW
Repeat Problem 9.11 for the following address.
Virtual address: 0x03a9
- A. Virtual address format
- B. Address translation
|
|
| VPN | _____ |
| TLB index | _____ |
| TLB tag | _____ |
| TLB hit? (Y/N) | _____ |
| Page fault? (Y/N) | _____ |
| PPN | _____ |
- C. Physical address format
- D. Physical memory reference
|
|
| Byte offset | _____ |
| Cache index | _____ |
| Cache tag | _____ |
| Cache hit? (Y/N) | _____ |
| Cache byte returned | _____ |
Expert Solution & Answer
Learn your wayIncludes step-by-step video
schedule08:20
Students have asked these similar questions
Question 8:
A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor has a translation
look-aside buffer (TLB) which can hold a total of 128 page table entries and is 4-way set
associative. The minimum size of the TLB tag is:
01
02
0 3
04
1. 11 bits
2. 13 bits
3. 15 bits
4. 20 bits
Memory address
Data
According to the memory view given below, if RO =
Ox20008002 then LDRSB r1, [r0, #-4] is executed as a result
of r1 = ?(data overlay big endian)?
Øx20008002
ØXA1
Øx20008001
ØXB2
Øx20008000
Øx73
ØX20007FFE
ØXD4
ØX20007FFE
Lütfen birini seçin:
O A. R1 = 0X7F
O B. R1 = Oxffffffd4
O C. R1 = Oxffffff7F
O D. R1=0XD4000000
O E. R1 = 0XD4
1. 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:
1) A byte at odd address [01FF3H]
2) A byte at even address [01FFCH]
3) A word at even address [01FFEH]
4) A word at odd address [01ABFH]
Chapter 9 Solutions
Computer Systems: A Programmer's Perspective (3rd Edition)
Ch. 9.2 - Prob. 9.1PPCh. 9.3 - Prob. 9.2PPCh. 9.6 - Prob. 9.3PPCh. 9.6 - Prob. 9.4PPCh. 9.8 - Practice Problem 9.5 (solution page 882) Write a C...Ch. 9.9 - Prob. 9.6PPCh. 9.9 - Prob. 9.7PPCh. 9.9 - Prob. 9.8PPCh. 9.9 - Prob. 9.9PPCh. 9.9 - Prob. 9.10PP
Ch. 9 - Prob. 9.11HWCh. 9 - Repeat Problem 9.11 for the following address....Ch. 9 - Repeat Problem 9.11 for the following address....Ch. 9 - Given an input file hello.txt that consists of the...Ch. 9 - Determine the block sizes and header values that...Ch. 9 - Prob. 9.16HWCh. 9 - Prob. 9.17HWCh. 9 - Prob. 9.18HWCh. 9 - Prob. 9.19HWCh. 9 - Write your own version of malloc and free, and...
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
If the programmer translates the following pseudocode to an actual programming language, a syntax error is like...
Starting Out with Programming Logic and Design (4th Edition)
Using examples, illustrate the different types of adaptor needed to support sequential composition, hierarchica...
Software Engineering (10th Edition)
The following program will compile and run, but it uses poor programming style. Modify the program so that it u...
Absolute Java (6th Edition)
Consider the adage Never ask a question for which you do not want the answer. a. Is following that adage ethica...
Experiencing MIS
When placed at the end of an IfThenElself statement, this provides default action when none of the ElseIf state...
Starting Out With Visual Basic (8th Edition)
We have defined four binary logical connectives. a. Are there any others that might be useful? b. How many bina...
Artificial Intelligence: A Modern Approach
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
- Suppose you have a byte-addressable virtual address memory system with 16 virtual pages of 64 bytes each and 4-page frames. Assuming the following page table, answer the questions below: Page # Frame # Valid bit 0 2 1 1 3 1 2 - 0 3 0 0 4 1 1 5 - 0 6 - 0 7 - 0 A. What physical address corresponds to the virtual address 0x42? Answer should be in hexadecimal number. (if the address causes a page fault, answer as "page fault" with the proper explanation) B. What physical address corresponds to the virtual address 0x72? Answer should be in hexadecimal number. (if the address causes a page fault, answer as "page fault" with the proper explanation) C. What physical address corresponds to the virtual address 0x84? Answer should be in hexadecimal number. (if the address causes a page fault, answer as "page fault" with the proper explanation)arrow_forwardThe following data segment starts at memory address 1000h (hexadecimal) .data printString BYTE "ASSEMBLY IS FUN",0 moreBytes BYTE 25(DUP)0 dateIssued DWORD ? dueDate DWORD ? elapsedTime Word ? What is the hexadecimal address of dueDate ? a. 1045h b. 1029h c.1010h d. 102Dharrow_forward8.9. The IBM System/370 architecture uses a two-level memory structure and refers to the two levels as segments and pages, although the segmentation approach lacks many of the features described earlier in this chapter. For the basic 370 architecture, the page size may be either 2 Kbytes or 4 Kbytes, and the segment size is fixed at either 64 Kbytes or 1 Mbyte. For the 370/XA and 370/ESA architectures, the page size is 4 Kbytes and the segment size is 1 Mbyte. Which advantages of segmentation does this scheme lack? What is the benefit of segmentation for the 370?arrow_forward
- Suppose a computer using direct mapped cache has 236 bytes of byte-addressable main memory and a cache size of 1024 bytes, and each cache block contains 64 bytes. ⦁ How many blocks of main memory are there? ⦁ What is the format of a memory address as seen by cache, i.e., what are the sizes of the tag, block, and offset fields? ⦁ To which cache block will the memory address 0x13A4576B map?arrow_forwardSuppose a computer using direct-mapped cache has 232 (that's 232)232) bytes of byte-addressable main memory, and a cache size of 512 bytes, and each cache block contains 64 bytes. How many blocks of main memory are there? What is the format of a memory address as seen by cache, i.e. what are the sizes of the tag, block, and offset fields? To which cache block will the memory address 0x13A4498A map?arrow_forwardA virtual memory has a page size of 2K(words). There are eight pagesand four blocks. The associative memory page table contains the followingentries:Page Block0 32 15 26 0Make a list of all virtual addresses (In decimal) that will cause a page fault if used by the CPU.arrow_forward
- Suppose a computer using fully associative cache has 4 GB of byte-addressable main memory and a cache of 256 blocks, where each block contains 256 bytes. a) How many blocks of main memory are there? b) What is the format of a memory address as seen by the cache, i.e., what are the sizes of the tag and offset fields? c) To which cache block will the memory address 0X1A1B1C1D map?arrow_forwardSuppose you have a byte-addressable virtual address memory system with eight virtual pagesof 64 bytes each and four-page frames. Assuming the following page table, answer thequestions below:Page # Frame # Valid Bit0 1 11 3 02 - 03 0 14 2 15 - 06 - 07 - 0c. How many bits are in virtual address?d. How many bits are in physical address?e. What physical address corresponds to the following virtual addresses? (If theaddress causes a page fault, simply indicate this is the case.)i. 0x0ii. 0x44iii. 0xC2iv. 0x80arrow_forwardQ: A digital computer has a memory unit of 64k * 16 and a cache memory of 1k words. The cache uses direct mapping with a block size of 4 words. i) How many bits are there in the tag, index, block & words fields of the address formats. ii) How many bits are there in each word of cache? iii) How many blocks can the cache accommodate?arrow_forward
- 3) Suppose we have a computer that uses a memory address word size of 8 bits. This computer has a 16- byte cache with 4 bytes per block. The computer accesses a number of memory locations throughout the course of running a program. Suppose this computer uses direct-mapped cache. The format of a memory address as seen by the cache is shown below: Tag 4 bits Block 2 bits Offset 2 bits The system accesses memory addresses in this exact order: 0x6E, 0xB9, 0x17, 0xE0, 0x4E, 0x4F, 0x50, 0x91, 0xA8, 0xA9, 0xAB, 0xAD, 0x93, and 0x94. Fill out the following tables: a) Address Hit Reference or Miss Comments b) Show the final contents of cache for direct addressing: Block Cache Contents Tag (represented by address)arrow_forwardConsider a mini virtual memory system. It has a virtual address space of 2°. Each page is 2 bytes. There are 21 = 16 frames in the main memory.Initially, all the pages are on the hard disk. Assume the first two logical addresses generated by the CPU are 15 and 200. What are their physical addresses after their belonged pages are brought into the memory?Assume that each page is stored at the next available frames in the memory. no hand writtenarrow_forward8.1. Suppose the page table for the process currently executing on the processor looks like the following. All numbers are decimal, everything is numbered starting from zero, and all addresses are memory byte addresses. The page size is 1,024 bytes. Virtual page number 0 1 2 3 4 5 Valid bit 1 1 0 1 0 1 (i) 1,052 (ii) 2,221 (iii) 5,499 Reference bit 1 1 0 0 0 0 Modify bit 0 1 0 0 0 1 Page frame number 4 7 2 - 0 a. Describe exactly how, in general, a virtual address generated by the CPU is trans- lated into a physical main memory address. b. What physical address, if any, would each of the following virtual addresses cor- respond to? (Do not try to handle any page faults, if any.)arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
Instruction Format (With reference to address); Author: ChiragBhalodia;https://www.youtube.com/watch?v=lNdy8HREvgo;License: Standard YouTube License, CC-BY