3. Given the layout of the main memory as the following table and processes A(6M), B(11M), C(9M), D(2M) loaded one by another. partition no. available size starting physical address status 1 15 10 2 10 25 3 5 35 Which process cannot be loaded applying the next-fit? What's the status of the partition table after loading ABCD applying the next-fit?

3. Given the layout of the main memory as the following table and processes A(6M), B(11M), C(9M), D(2M) loaded one by another. partition no. available size starting physical address status 1 15 10 2 10 25 3 5 35 Which process cannot be loaded applying the next-fit? What's the status of the partition table after loading ABCD applying the next-fit?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 17VE

See similar textbooks

Similar questions

Answer the following short questions to the point. Which bit in the PTE does the operating system use for approximating LRU replacement? Does a TLB miss always/sometimes/never result in a paging from disk? What are the two components of a virtual address used in segmented virtual memory? In what Nachos file was StartProcess implemented? What kind of pages in a process’ virtual address space are usually protected as “Read Only”? Is it possible to implement a file system inside of a file stored in another file system?
Given the layout of the main memory as the following table and processes A(8M), B(6M), C(12M), D(1M) loaded one by another Initial partition Starting address(M) size status/bitmap no. 5 (asume os uses 5M, so the first user starting address will be 8M) 1 15 25 3 5 40 1. What's the status of the partition table after loading ABCD using a variable-partition schema? 2. What's the status of the partition table after loading ABCD using first-fit? 3. What's the status of the partition table after loading ABCD using best-fit? 4. What's the status of the partition table after loading ABCD using worst-fit? 5. What's the status of the partition table after loading ABCD using next-fit? 20
QUESTION 1 "For an address book used by a single user, it is sultable to be implemented using traditional file system" True False
Given the initial partition table as followings and processes A(8M), B(6M), C(12M), D(1M) loaded to the memory one by another
Question#4: Consider a file system that uses inodes to represent files. Disk blocks are 8 KB in size, and a pointer to a disk block requires 4 bytes. This file system has 12 direct disk blocks, as well as single, double, and triple indirect disk blocks. What is the maximum size of a file that can be stored in this file system?
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…
Compare between the different Input-Output control techniques: programmed I/O, interrupt, DMA, and Channel IO. There are 3 major methods that can be used for allocating disk space; one is the contiguous allocation method. Search for one of the other 2 methods (Linked Allocation and Indexed Allocation) and compare its performance with the performance of contiguous allocation methods.
What is the purpose of having Memory Map Table in Segmented/Demand Paged memory allocation scheme? Select one: a. Lists every job in process (one for the whole system) b. Lists details about each segment (one for each job). c. Lists details about every page (one for each segment). d. Monitors the allocation of page frames in main memory (one for the whole system).
Answer the following short questions to the point. Which bit in the PTE does the operating system use for approximating LRU replacement? Does a TLB miss always/sometimes/never result in a paging from disk? What are the two components of a virtual address used in segmented virtual memory? In what Nachos file was StartProcess implemented?
We use fixed partitioning for a main memory (M) of size 1GiB. Each same sized partition is of the same size 256KiB. The machine is a 32-bit architecture.1. How many partitions do we have for M? 2. A logical address is thus split into a partition number and partition offset within that partition. How many bit for the partition number ? 3. A logical address is thus split into a partition number and partition offset within that partition. How many bit for the partition offset ? 4. We store the information related to the partitions in a table PaT. PaT has one entry per partition. Thus PaT[ i ] shows the PID of the process occupying that partition. PID are linux PIDs and we provided some information about them in Subject 3 when we discussed the Process List. A PID consists of a number of bit that is a power of two multiple of the number of bit of a byte i.e. 8bit, 16bit, 32bit, etc. What is the length of the PaT table/array ? 5. We store the information related to the partitions in a…
1) What is the difference between the status and control flags? What are the status flags for the AEH+37H operation? 2) What is the aim of segmentation as well as physical address generation? Explain with a drawing and a numerical example? 3) What is the amount of the memory in each of the following cases? • All segments are • Overall memory is 4) Given the ES=3050H, SS=1298H, and CS-ABC3H, find the physical address for a) SP=2583H, b) DI=3399H, and c) IP=18F7H.
We use fixed partitioning for a main memory (M) of size 1GiB. Each same sized partition is of the same size 256KiB. The machine is a 32-bit architecture. 1. How many partitions do we have for M? 2. A logical address is thus split into a partition number and partition offset within that partition. How many bit for the partition number ? 3. A logical address is thus split into a partition number and partition offset within that partition. How many bit for the partition offset ? 4. We store the information related to the partitions in a table PaT. PaT has one entry per partition. Thus PaT[ i ] shows the PID of the process occupying that partition. PID are linux PIDs and we provided some information about them in Subject 3 when we discussed the Process List. A PID consists of a number of bit that is a power of two multiple of the number of bit of a byte i.e. 8bit, 16bit, 32bit, etc. What is the length of the PaT table/array ? 5. We store the information related to the partitions in…