b. Assume a system that uses virtual memory with a single level page table and a translation lookaside buffer (TLB): i. Briefly explain the functionality of the TLB. ii. Assuming that the memory access time is 90ns, the time the operating system takes to search the TLB is 15ns, the TLB hit rate is 98%, the page fault rate is 20% and the time to fetch a page from the drive is 8ms. What is the average expected access time to main memory?

b. Assume a system that uses virtual memory with a single level page table and a translation lookaside buffer (TLB): i. Briefly explain the functionality of the TLB. ii. Assuming that the memory access time is 90ns, the time the operating system takes to search the TLB is 15ns, the TLB hit rate is 98%, the page fault rate is 20% and the time to fetch a page from the drive is 8ms. What is the average expected access time to main memory?

Name: question 3b b. Assume a system that uses virtual memory with a single
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: question 3b b. Assume a system that uses virtual memory with a single level page table and a translationlookaside buffer (TLB):i. Briefly explain the functionality of the TLB.ii. Assuming that the memory access time is 90ns, the time the operating sy

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 26VE

See similar textbooks

Similar questions

Read-only memory (usually known by its acronym, ROM) is a class of storage media used in computers and other electronic devices that is non-volatile (non-changeable). Because data stored in ROM cannot be modified (at least not very quickly or easily), it is mainly used to distribute firmware (software that is very closely tied to specific hardware, and unlikely to require frequent updates). Figure 3.1 depicts a ROM block diagram which have k-bit address and an n-bit data. The contents of a ROM chip are defined once. Hence, we can use a constant array to model a ROM in VHDL. Basically, to name the size of a ROM is by stating ROM k x n, which represents ROM with k-bit address andn-bit data size. For example, ROM 4x8 (16 address location with each location containing 8-bit data). Question. Develop a code to allow the ROM operation works in synchronous when a read enable is asserted.• Generate and simulate the VHDL codes in Altera Quartus II.• Demonstrate and obtain the instructor…
In a main memory-disk virtual storage system, the page size is 1KByte and the FIFO algorithm is used for page replacements. A given program has been allocated three page frames in the main memory and it makes the following 16 memory references when it starts executing (the addresses are given in decimal):500, 2000, 2500, 800, 4000, 1000, 5500, 1500, 2800, 400, 5000, 700, 2100, 3500, 900, 2400 Fill in the contents of the three page frames after each memory reference in a table and calculate the hit ratio. Hint: denote by 'a' the page consisting of locations 0 through 1023 in memory. Similarly, b: 1024-2047, c: 2048-3071, d: 3072-4095, e: 4096-5119 and f: 5120-6143. Round to three decimal places.
Suppose a computer using direct mapped cache has 224 bytes of byte- addressable main memory and a cache size of 64K bytes, and each cache block contains 32 bytes. (Note: 64K = 26 * 210) a) How many blocks of main memory are there? b) 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?
Consider a hypothetical system that uses Direct Memory mode access(DMA) mode to transfer the data from the hard disk to the main memory. If the size of the DMA controller's data count register is 32 bits. A file of 1024 GB needs to transfer from disk to memory. What is the minimum number of times the DMA controller needs to get the control of the system bus if the system is byte-addressable?
A disk has a capacity of two tera-byte size. Say the file system uses a multi-level inode structure for locating the data blocks of afile.The inode stores pointers to data blocks, including a single indirect block, a double indirect block, and several direct blocks in the 64 B of available space.Now, it is given that the disk has a block size of 512 B. The maximum file size that can be stored in such a file system in MB (round off upto 2 decimal places).
Computer Science This question is about paging-based virtual memory A computer has a virtual-momory space of 250MB (megabytes) The computer has 325) of primary memory. The pige som s-4000 by the address is 1011 0001 0101 1110 0010 1010 0010 a. How many frames can it have? b. Which of the bits in the virtual address correspond to the Page number? c. Which of the bits correspond to the page offset?
In a main memory-disk virtual storage system, the page size is 1KByte and the OPTIMAL algorithm is used for page replacements. A given program has been allocated three page frames in the main memory and it makes the following 16 memory references when it starts executing (the addresses are given in decimal):500, 2000, 2500, 800, 4000, 1000, 5500, 1500, 2800, 400, 5000, 700, 2100, 3500, 900, 2400 Fill in the contents of the three page frames after each memory reference in a table and calculate the hit ratio. Hint: denote by 'a' the page consisting of locations 0 through 1023 in memory. Similarly, b: 1024-2047, c: 2048-3071, d: 3072-4095, e: 4096-5119 and f: 5120-6143. Round to three decimal places.
Consider a computer system that has the following characteristics: The memory bus runs at 400 MHz. The memory bus is 8 bytes wide. Accessing a memory address in memory requires 8 memory bus cycles. The disk drives can each read a block every 4 milliseconds. Disk blocks read are 8 kilobytes each. Assume Direct Memory Access from the disk drive. What is the highest percentage of the memory bus capacity that could be consumed by the disk’s Direct Memory Access if there are 4 disk drives in use?
Consider a memory system that generates 16-bits addresses and the frame size is 32-byte. At time To the status of the page table is given below. Page Table Entry Page # 1911 11 561 56 644 1068 1884 52 58 42 194 46 a) What is the maximum number of entries within a single page/frame? b) What is the maximum number of page table entries in the memory system? c) Using the given page table, determine the physical addresses for the following logical addresses. Write down the physical addresses in binary and decimal format. (i) (iii) 0101000010001011 1110101110010111 (ii) (iv) 0001100001100111 1110111011101001
On a simple paging system with 224 bytes of physical memory, 256 pages of logical address space, and a page size of 210 bytes. 1. How many bits are needed to store an entry in the page table (how wide is the page table)? Assume a valid/invalid 1-bit is included in each entry. 2. If the page table is stored in the main memory with 250nsec access time, how long does a paged memory reference take? 3. If the page table is implemented using associative registers that takes 95nsec. and main memory that takes 200nsec, what is the total access time if 75% of all memory references find their entries in the associative registers?
4. Given that the main memory size is 32KB, the page size is 64B, the word size is 1B, and n-level paging is applied. What is the page number size? If (5, 10) is a record in the outer page table stored in PCB and (9, 7) is a record in the inter page table stored in page frame No.10, what is the physical address of the logical address 0010101001000110 in HEX?
Consider a disk drive specifications. with the following 16 surfaces, 512 tracks/surface, 512 sectors/ track, 1 KB/sector, rotation speed 3000 rpm. The disk is operated in cycle stealing mode whereby whenever one byte word is ready it is sent to memory; similarly, for writing, the disk interface reads a 4 byte word from the memory in each DMA cycle. Memory cycle time is 40 nsec. The maximum percentage of time that the CPU gets blocked during DMA operation?