As described in COD Section 5.7 (Virtual memory), virtual memory uses a page table to track the mapping of virtual addresses to physical addresses. This exercise demonstrates how this table is updated as addresses are accessed. The following data represent a stream of virtual byte addresses as seen on a system. Assume 4 KiB pages, a four-entry fully associative TLB, and true LRU replacement. If pages must be brought in from disk, increment the next largest page number.### Decimal Addresses:- 4669- 2227- 13916- 34587- 48870- 12608- 49225### Hexadecimal Addresses:- 0x123d- 0x08b3- 0x365c- 0x871b- 0xbeee- 0x3140- 0xc049### TLB (Translation Lookaside Buffer):| Valid | Tag | Physical Page Number | Time Since Last Access ||-------|-----|-----------------------|------------------------|| 1 | 0xb | 12 | 4 || 1 | 0x7 | 4 | 1 || 1 | 0x3 | 6 | 3 || 0 | 0x4 | 9 | 7 |### Page Table:| Index | Valid | Physical Page or in Disk ||-------|-------|--------------------------|| 0 | 1 | 5 || 1 | 0 | Disk || 2 | 0 | Disk || 3 | 1 | 6 || 4 | 1 | 9 || 5 | 1 | 11 || 6 | 0 | Disk || 7 | 1 | 4 || 8 | 0 | Disk || 9 | 0 | Disk || 10 | 1 | 3 || 11 | 1 | 12 |### Tasks:(a) For each access shown above, list:- Whether the access is a hit or miss in the TLB.- Whether the access is a

As described in COD Section 5.7 (Virtual memory), virtual memory uses a page table to track the mapping of virtual addresses to physical addresses. This exercise shows how this table must be updated as addresses are accessed. The following data constitute stream of virtual byte addresses as seen on a system. Assume 4 KiB pages, a four-entry fully associative TLB, and true LRU replacement. If pages must be brought in from disk, increment the next largest page number. TLB Page Table Decimal 4669 2227 13916 34587 48870 12608 49225 0x123d 0x08b3 0x365c 0x871b 0xbee6 0x3140 0xc049 hex Valid 1 1 1 0 Index 0 1 2345678 9 a Tag Oxb 0x7 0x3 0x4 Valid 1 0 0 1 1 1 0 1 0 0 1 Physical Page Number 12 4 6 9 Time Since Last Access 4 1 3 7 Physical Page or in Disk 5 Disk Disk 6 9 11 Disk 4 Disk Disk 3

As described in COD Section 5.7 (Virtual memory), virtual memory uses a page table to track the mapping of virtual addresses to physical addresses. This exercise shows how this table must be updated as addresses are accessed. The following data constitute stream of virtual byte addresses as seen on a system. Assume 4 KiB pages, a four-entry fully associative TLB, and true LRU replacement. If pages must be brought in from disk, increment the next largest page number. TLB Page Table Decimal 4669 2227 13916 34587 48870 12608 49225 0x123d 0x08b3 0x365c 0x871b 0xbee6 0x3140 0xc049 hex Valid 1 1 1 0 Index 0 1 2345678 9 a Tag Oxb 0x7 0x3 0x4 Valid 1 0 0 1 1 1 0 1 0 0 1 Physical Page Number 12 4 6 9 Time Since Last Access 4 1 3 7 Physical Page or in Disk 5 Disk Disk 6 9 11 Disk 4 Disk Disk 3

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

4. The figure below shows an 8-way interleaved, byte-addressable memory. The total size of the memory is 4 KB. The elements A[i]G) of a 2-dimensional array A are 4-bytes (one-word) in length and can be stored in the memory as shown, where 0 < ij <7. The width of the bus between CPU and memory is 32 bits, that is, it can carry only one word at a time. Bank 1 Bank 7 Bank 0 31 7 A[7][0] A[I][0] A[0]|0] 32 A[7]1] 64 A[7]|2] A[I][2] A[0||2] RANKO 255 224 AI기기 A[I][7] A[0||7) RANKN ...... Since the address space of the memory is 4 KB, 12 bits are needed to uniquely identify each memory location, i.e., Addr[11:0]. Find out and explain which bits of the address will be used for: • Byte on bus: Addr […... :...] Bank index bits within a bank: Addr [.... .] • Chip select address bits within a rank: Addr […... .] • Rank bits: Addr […... :....]
Consider a file system on a disk that has both logical and physical block sizes of 512 bytes. Assume that the information about each file is al ready in memory. For each of the three allocation strategies (contiguous, linked, and indexed), answer these questions: a. How is the logical-to-physical address mapping accomplished in this system? (For the indexed allocation, assume that a file is always less than 512 blocks long.) b. If we are currently at logical block 10 (the last block accessed was block 10) and want to access logical block 4, how many physical blocks must be read from the disk
Compare the main memory organization schemes of contiguous-memory allocation, pure segmentation, and pure paging with respect to the following issues: a. External fragmentation b. Internal fragmentation c. ability to share code across processes
Please help me with this computer architecture homework
4.8 Consider a machine with a byte addressable main memory of 2 bytes and block size of 8 bytes. Assume that a dircct mapped cache consisting of 32 lines is used with this machine. a. How is a 16-bit memory address divided into tag, line number, and byte number? b. Into what line would bytes with each of the following addresses be stored? 0001 0001 0001 1011 1100 0011 0011 0100 1101 0000 0001 1101 1010 1010 1010 1010 c. Suppose the byte with address 0001 10100X01 1010 is stored in the cache. What are the addresses of the other bytles stored along with it? d. How many total bytes of memory can be stored in the cache? e. Why is the lag also stored in the cache?
Compare the main memory organization schemes of contiguous-memory allocation, pure segmentation, and pure paging with respect to the following issues: a. External fragmentation b. Internal fragmentation c. ability to share code across processes
#1#.
3
Suppose that a block is 1K Byte and that a disk address is 4 bytes. Suppose that files are implemented using i-nodes, and that an i-node has the following structure: the last address in the inode is a third-level indirect block; the second-to-last address is a second-level indirect block; the third-to-last address is an indirect block; and the remaining addresses are data blocks. Approximately how large a file can this system support?
Q4 consider a computer with the following characteristics: total of 4 MB of a byte-addressable- main memory; block size of 64 bytes; and cache size of 256 kB. O a. For the main memory addresses of D0005, 512C7, and 7BAAA, give the O corresponding tag, cache line address, and word offsets for a direct-mapped cache. b. Give any two main memory addresses with different tags that map to the same cache slot for a direct-mapped cache.
Suppose a byte-addressable memory with 4 frames of size 8 bytes each and a paged virtual memory using a three-entry TLB. Suppose a process P has 8 pages of virtual memory space. Assume the following TLB and page table for process P: TLB Page Framell Framet Valid 1. 12 1. Page Table Assume process P generates a memory request with virtual address 0X3A. What is its corresponding physical address? You may represent the address in binary or hexadecimal notation (if hexadecimal notation, prefix with Ox). If the request causes a page fault, enter page fault.
Compare the main memory organization schemes of contiguous-memory allocation, pure segmentation, and pure paging with respect to the following issues: a. External fragmentation b. Internal fragmentation c. ability to share code across processes