Question 3 (Memory Management)a. Virtual memory allows us to simulate a larger memory space than we actually have. Explainhow this is possible and give two disadvantages of virtual memory.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 system takesto search the TLB is 15ns, the TLB hit rate is 98%, the page fault rate is 20% and thetime to fetch a page from the drive is 8ms. What is the average expected access timeto main memory?c. In a dynamic partitioning approach for memory management we could use a bitmap or alinked list to keep track of free and used memory.i. Briefly explain why linked lists are normally the preferred option.ii. Briefly explain a situation where bitmaps may be preferred.iii. Briefly explain the working of the best fit algorithm to allocate processes to memorywhen dynamic partitioning is used.iv. Does the best fit algorithm result in external fragmentation?v. Does the worst fit algorithm result in internal fragmentation?

As per company guidelines we are suppose to answer only 1 question. Kindly re-post other questions…

Answered: a. Virtual memory allows us to simulate…

a. Virtual memory allows us to simulate a larger memory space than we actually have. Explain how this is possible and give two disadvantages of virtual memory.

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

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…
5. A digital computer has a memory unit with 32 bits per word. The instruction set consists of 160 different operations. All instructions have an operation cod part(opcode) and two address fields: one for a memory address and one for a register address. This particular system includes sixteen general-purpose, user-addressable registers. Registers may be loaded directly from memory, and memory may be updated directly from the registers. Direct memory-to-memory data movement operations are not supported. Each instruction is stored in one word of memory. a) How many bits are needed for the opcode? b) How many hits are needed to specify the register? c) How many bits are left for the memory address part of the instruction? d) What is the maximum allowable size for memory in bytes? e) What is the largest unsigned binary number that can be accommodated in one word of memory?
. A digital computer has a memory unit with 32 bits per word. The instruction set consists of 147 different operations. All instructions have an operation code part (opcode) and two address fields: one for a memory address and one for a register address. This particular system includes eight general-purpose, user-addressable registers. Registers may be loaded directly from memory, and memory may be updated directly from the registers. Direct memory-to-memory data movement operations are not supported. Each instruction stored in one word of memory. a) How many bits are needed for the opcode? b) How many bits are needed to specify the register? c) How many bits are left for the memory address part of the instruction? d) What is the maximum allowable size for memory? e) What is the largest unsigned binary number that can be accommodated in one word of memory?
1. Computer Memory (a) Describe in detail the difference between memory bandwidth and memory latecy. (b) Describe in detail and give a small source code example of the difference in spatial and temporal locality. (c) Describe in detail and give a diagram for virtual memory. (d) Describle in detail the difference in SRAM and DRAM.
1. Suppose a computer has 2³2 bytes of byte-addressable main memory and a cache size of 2¹5 bytes, and each cache block contains 64 bytes. a) How many blocks of main memory are there? (_ b) How many blocks of cache memory are there? (_ c) If this cache is direct-mapped, what is the format of a memory address as seen by the cache; that is, the size of the tag field_ the size of block field and the size of the offset field_ d) If this cache is fully associative, what is the format of a memory address as seen by the cache; that is, the size of the tag field_ and the size of the offset field e) If this cache is 4-way set associative, what is the format of a memory address as seen by the cache; that is, the size of the tag field_ the size of set field and the size of the offset field
Suppose a computer using direct mapped cache has 2^32 bytes of byte-addressable main memory and a cache size of 512 bytes, and each cache block contains 64 bytes. 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?
2) A digital computer has a memory unit with 32 pits per word. The instruction set consists of 102 different operations. All instructions have an operation code part (opcode) and two address fields: one for a memory address and one for a register address. This system includes eight general-purpose, user-addressable registers. Registers may be loaded directly from memory, and memory may be updated directly from the registers. Direct memory-to-memory data movement operations are not supported. Each instruction is stored in one word of memory. a) How many bits are needed for the opcode? b) How many bits are needed to specify the register? c) How many bits are left for the memory address part of the instruction? d) What is the maximum allowable size for memory? e) What is the largest unsigned binary number that can be accommodated in one word of memory?
Suppose a computer using direct-mapped cache has 232 bytes of byte-addressable main memory and a cache size of 512 bytes, and each cache 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, block, and offset fields?
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?
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?
A virtual memory has a page size of 16 words. There are 8 pages and 4 blocks. The associative memory page table contains the following entries. (Addresses are given HEX form): Page Block a) For the following virtual addresses find the CPU addresses: 3A, 5B, 1 3 b) For the following CPU addresses find the virtual addresses: 0C, 2D 1 4
Main memory size is 16 pages. Size of swap file on hard disk is 64 pages. Operating system locks down pages 0, 1, 2 and 7 in the main memory. Two programs are started and both are provided with a virtual address space of 10 pages. Initially operating system allocates 5 pages of main memory for each program and the rest from swap file. Virtual address space of each program starts from page 0. Construct page tables for both programs at program startup. A page table consists of P-bit which tells if the page is present in the main memory (1 = page is in main memory) and address of the page. Address tells either real address in main memory or the address of the page in swap file. b. A computer with a paged virtual memory system executes two load instructions that are adjacent to each other in memory. Describe the worst case scenario (in terms of performance) that can occur during the execution of the two instructions and explain under which conditions this case occurs. How does this affect…