[開課學院]: 資電學院 [開課系所]: 資工系 [課程名稱]: [老師名稱]: 林志敏 老師 [開課學期]: [類型]: 99-1期末考 ------------------------------------------------------------ 1.Briefly answer the following question (a)describe the strategies used in the dynamic storage allocation problem in physical memory management (b)what are the requirements that a solution to the critical-section problem must satisfy (c)give the solution for the "very large page table" problem for many modern address space (d)what are the necessary conditions must be hold for a deadlock situation (e)give the solutions to the problem of running a program larger than physical memory equipped in a computer 2.Discuss in detail for the steps of handling page-faults 3.Discuss(a)the advantages and disadvantages of the "Virtual Memory" (b)the comparison between "Paging" and "Segmentation" mechanisms (c)what is "Belady's anomaly"? 4.What's "Thrashing"? How to solve this problem? 5.Most of the modern computer architectures support very large virtual address space.Please give your opinions or comments to why need such kind of supports 6.consider the folloeing page reference string 6,3,2,5,7,6,2,6,74,5,2,1,4,2,1,3,7,5,24,3,4,5,7,3,1,6 How many page faults would occur for the following replacement algorithms,assuming three or five frames? Remember all frams are initially empty,so your first unique pages will all cost one fault each. (注意:推算過程或圖形需列出，否則不予計分) A.LRU replacement B.FIFO replacement C.Optimal replacement 7.Suppose there have 5 processes:P0 through P4;3 resource types:A(10 instances),B(5instances),and C(7instances).The following is the snapshot at time T0: Allcoation Max Available ----------------------------------------------------------- ABC ABC ABC P0 011 653 331 P1 200 322 P2 302 912 P3 211 222 P4 002 433 (A)Can request for (3,3,0)by P4 be granted? (B)For the same situation,can request for (0,2,0)by P0 be granted? --

※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 122.123.243.215