A system with TLB and Main Memory support Segmentation with 3 level hierarchical paging. Assume process PO [the complete process and all the page tables] is available in Main Memory. The process has to access memory 10000 times to complete its operations. While executing, 1500 accesses result in TLB miss. TLB access time is 5nS and Main Memory access time is 200nS. Find the total time taken nnchy process PO

A system with TLB and Main Memory support Segmentation with 3 level hierarchical paging. Assume process PO [the complete process and all the page tables] is available in Main Memory. The process has to access memory 10000 times to complete its operations. While executing, 1500 accesses result in TLB miss. TLB access time is 5nS and Main Memory access time is 200nS. Find the total time taken nnchy process PO

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

Consider a fixed partitioning scheme with equal-size partitions of 2¹6 bytes and a total main memory size of 224 bytes. A process table is maintained that includes a pointer to a partition for each resident process. How many bits are required for the pointer?
assume a system has 6 identical resources and N processes competing for them. each process can request at most 2 resources. what is the maximum value of N for the system to be deadlock free?
We consider a virtual memory design for a computer architecture. Suppose that the byte- addressed computer has 256 bytes pages, 16-bit virtual addresses, and 16-bit page table entries (PTE) (NUM 1 bits of one PTE are used for reference, valid checking, protection mechanism, etc.). The computer uses two-level hierarchical page tables. 1. How many virtual pages can be addressed by the architecture? 2. What is the maximal size of the physical memory that can be supported by the architec- ture? 3. We are now running a program which is using 300 bytes of memory currently. What is the smallest possible number of PTES to store the running program?
Question 4 Execute SRT for the following group of processes and complete the following table: Process A B C D E TArrival 0 2 4 6 8 Ts 2 3 5 1 4 TFinish Answer Answer Answer Answer Answer TR Answer Â Answer Â Answer Â Answer Â Answer Â 1. If the process arriving has the same remaining execution time as the process in the CPU, then the process that is using the CPU will have the highest priority.Â 2. If there is no process in the execution state and two or more processes have the shortest remaining time, then you will use the lowest PID criterion (using lexicographical order). Question 5 Execute HRRN for the following group of processes and complete the following table: Process A B C D TArrival 0 2 4 6 Ts 3 5 4 1 TFinish Answer Answer Answer Answer TR Answer Â Answer Answer Answer Â If two or more processes in the ready queue…
Consider a pair of processes in a shared memory system such that process A updates a data structure, and then sets a flag to indicate that the update is completed. Process B monitors the flag, and starts processing the data structure only after it finds the flag is set. Explain the problems that could arise in a memory architecture where writes may be reordered, and explain how the sfence and lfence instructions can be used to ensure the problem does not occur.
4. The following is the memory configuration at a given point in time where dynamic partitioning scheme is used. The shaded areas indicate memory spaces already allocated to other processes, while the white spaces are holes (free memory spaces). The next FOUR (4) memory requests are 30M, followed by 50M, 20M and 40M (in order). Shade and indicate clearly which memory block will be allocated to each request using the first- fit and next-fit placement algorithms. (First-fit) 20M (Best-fit) 20M (Next-fit) 20M 1 80M 2 3 4 80M b. Given a process segment table as follows: Segment 0 80M (X is the lastest allocated block) 20M Base 496 1202 232 2359 1877 20M 20M Length 691 85 198 109 258 50M 50M 50M 10M 10M 10M X 30M 30M 30M Explain the basic use of segment table in process segmentation and its difference with paging. Give one example on how the information in the given process segment table is used.
A computer uses virtual memory, and a new solid-state drive (SSD) as space for paging. Refer to the last ppt file. In the case presented there, the hard disk drive (HDD) required 25 ms to read in a page, and a rate of 1 page fault per 1000 references introduced a 250 slowdown. If the SSD offers a time of only 80 µs, what is the slowdown in performance caused by 1 pf per 1000 references (you are not concerned with dirty vs. clean pages). What is the maximum rate of page faults you can accept if you want no more than a 5% slowdown in execution using virtual memory? Know your metric prefixes and symbols for time: s for seconds, ms for milliseconds, µs for microseconds, ns for nanoseconds.
A memory hierarchy contains a single cache with a miss rate of 2% that holds both instructions and data. The miss penalty to access main memory is 100 cycles. 15% of the instructions are jumps, 20% are stores, 20% are loads (30% have values used in the next instruction), 10% are branches (taken 20% of the time), and 35% are ALU instructions. Jumps and branches are determined in the ID stage. What is the base CPI, and what is the effective CPI?
Suppose that a multiprogrammed system has a load of N processes with individual execution times of t1, t2, ...,tN. Answer the following questions: a) How would it be possible that the time to complete the N processes could be as small as: maximum (t1, t2, ...,tN)? b) How would it be possible that the total execution time, T > t1+ t2+ ...+tN? In other words, what would cause the total execution time to exceed the sum of individual process execution times?
6.plHeap memory management Show the memoryallocation of process requests of size 90KB, 39KB, 27KB, 16KB and 36KB which will bereceived in order using:a) Best-Fit memory allocation methodb) Worst-Fit memory allocation method.
Consider a paged virtual memory system in which a process is allocated with 4 frames. The contents of the page map table are given below with two frames being empty. PageActual frame address in memory 4 122 344 477 898 Assume that the order in which the pages appear is the order in which the pages were added to the table (i.e., Page 2 was accessed after Page 4) Assume that the subsequent page accessing is : 1,2,3,4,1,2,5 Using LRU page-replacement algorithm, What frame is accessed by Page 5. 477 O 344 122 O 898
Four processes arrive at the same time with their priorities, execution times and I/0 times given in the table below. Assuming a Round-Robin Scheduling works with a quantum time of 3, but the scheduler selects the with highest priority from the queue (NOT those arrived earliest), other than currently pre-empted process, at each turn3; process a-)Draw the timeline for CPU- and I/O- bursts for these processes b-)Calculate average turn-around time Exec 1/0 Exec /0 Process Priority 2. P1 10 4 P2 7. 4. 4 P3 1 10 1 4 Pa