학 과 : 전자정보통신공학부, 과 목 : 운영체제, 담당교수님 : 홍석원 교수님학 번 : 95177324, 이 름 : 이철영{MemoryListMemoryBlock SizeJobNumberJob SizeStatusInternalFragmentationBlock 2850KJ1740Kbusy110KBlock 1610KJ2500Kbusy110KBlock 3700KJ3700KbusyNONETotalAlvailable2160KTotal Used1940K4. a. Use the best-fit algorithm to allocate the memory blocks to the three arriving jobs.{MemoryListMemoryBlock SizeJobNumberJob SizeStatusInternalFragmentationBlock 1610KJ2500Kbusy110KBlock 2850KJ1740Kbusy110KBlock 2700KJ3700KbusyNONETotalAlvailable2160KTotal Used1940Kb. Use the first-fit algorithm to allocate the memory blocks to the three arriving jobs.{MemoryListMemoryBlock SizeJobNumberJob SizeStatusInternalFragmentationBlock 3700KJ1700KbusyNONEBlock 1610KJ2500Kbusy110KBlock 2850KJ3740Kbusy110KTotalAlvailable2160KTotal Used1940K5. a. Use the best-fit algorithm to allocate the memory blocks to the three arriving jobs.b. Use the first-fit algorithm to allocate the memory blocks to the three arriving jobs.{MemoryListMemoryBlock SizeJobNuk 2850KJ1700Kbusy150KBlock 3700KFreeTotalAlvailable2160KTotal Used1200K6. Next-fit is an allocation algorithm that keeps track of the last allocated partition and starts searching from that point on when a new job arrives.a. What might be an advantage of this algorithm?Next-fit는 할당된 주소 다음의 주소값에서부터 다음 Job을 검색함으로 탐색 시간을 줄인다.b. How would it compare to bets-fit and first-fit for the conditions given in exercise 4?예제 4를 Next-fit 으로 변환.{MemoryListMemoryBlock SizeJobNumberJob SizeStatusInternalFragmentationBlock 1610KfreeBlock 2850KJ1740Kbusy150KBlock 3700KJ2500Kbusy110KTotalAlvailable2160KTotal Used1240K예제 4번에서는 best-fit과 first-fit의 차이점은 없다.그러나 Next-fit의 경우 다음 블럭에서 700K의 Job이 들어갈 수 없으므로 Next-fit 보다는 best-fit이나 first-fit의 방법이 효율적이다.c. How would it compare to best-fit and first-fit for the conditions given in exercise 5?{MemoryListMemoryBlock SizeJobNumberJob SizeStatusInternalFragmentationBlock 1610KfreeBlock 2850KJ1700Kbusy150KBlock 3700KJ2500Kbusy110KTotalAlvailable2160KTotal Used1200K예제 5번 차 례대로 메모리를 할당하다보니 Job 3는 메모리에서 할당 받지 못했다.Next-fit도 마찬가지로 Job3가 대기중이므로 Best-fit의 방법이 더 효율적이다.7. worst-fit is an allocation algorithm that is the opposite of best-fit. It allocations the largest free block to a new job.a. What might be an advantage of this algorithm?프로그램을 주기억 장치 내에서 가장 알맞지 않은 공백, 즉 가장 큰 공백에 배 치하는 것. 큰 공백에 프로그램을 배치한 후에도 그 남은 공백은 여전히 크다. 따라서 상당히 큰 다른 프로그램을 수행할 수 있다b. How would it compare to bets-fit and first-fit for the conditions given in exercise 4?예제 4번을 Worst-fit으로 변환.{MemoryListMemoryBlock SizeJobNumberJob SizeStatusInternalFragmentationBlock 1610KfreeBlock 2850KJ1740Kbusy150KBlock 3700KJ2500Kbusy110KTotalAlvailable2160KTotal Used1240KWorst-fit의 경우 다음 블럭에서 700K의 Job이 들어갈 수 없으므로 Next-fit 보다는 best-fit이나 first-fit의 방법이 효율적이다.c. How would it compare to best-fit and first-fit for the conditions given in exercise 5?예제 4번을 Worst-fit으로 변환.{MemoryListMemoryBlock SizeJobNumberJob SizeStatusInternalFragmentationBlock 1610KfreeBlock 2850KJ1700Kbusy150KBlock 3700KJ2500Kbusy110KT 할당되었지만 First-fit은 차 례대로 메모리를 할당하다보니 Job 3는 메모리에서 할당 받지 못했다.Worst-fit도 마찬가지로 Job3가 대기중이므로 Best-fit의 방법이 더 효율적이다.3장 연습문제6. Given that main memory is composed of three page frames for public use and that a program requests pages in the following order?d c b a d c e d c b a ea. Using the FIFO page removal algorithm, do a page trace analysis indicating page faults with asterisks(*). Then compute the failure success ratios.{dcbadcedcbaePage frame1 {dddaaaeeeeeePage frame2 {cccdddddbbbPage frame3 {bbbcccccaa{*********failure ratio : 75% , success ratio : 25%b. Increase the size of memory so it contains four page frames for public use. Using the same page requests as above and FIFO, do another page trace analysis and compute the failure and success ratios.{dcbadcedcbaePage frame1 {ddddddeeeeaaPage frame2 {ccccccddddePage frame3 {bbbbbbccccPage frame4 {aaaaaabbb{**********failure ratio : 83.3% , success ratio : 16.7%c. Did the result correspond with your intuition? Explain.메모리가 늘면 인터럽트가 줄거라는 내posed of three page frames for public use and that a program requests pages in the following order?a b a c a b d b a c da. Using the FIFO page removal algorithm, do a page trace analysis indicating page faults with asterisks(*). Then compute the failure success ratios.{abacabdbacdPage frame1 {aaaaaadddddPage frame2 {bbbbbbbaaaPage frame3 {cccccccc{*****failure ratio : 45.4% , success ratio : 54.6%b. Using the LRU page removal algorithm, do a page trace analysis and compute the failure and success ratios.{abacabdbacdPage frame1 {aaaaaaaaaaaPage frame2 {bbbbbbbbbbPage frame3 {cccdddcc{******failure ratio : 54.5% , success ratio : 45.5%c. FIFO 방식이 더 좋다. 인터럽트가 1개 더 적은 5개가 걸렸다.d. LRU 사용?{abacabdbacdPage frame1 {aaaaaaaaaaaPage frame2 {bbbbbdbbbbPage frame3 {cccccccd{******failure ratio : 54.5% , success ratio : 45.5%e. FIFO가 인터럽트그 1개 더 적은 5개로 가장 효율이 좋다.8. LFU 사용{abacabdbacdPage frame1 {aaaaaaaaaaaPage frame2 {bbbbbbbbbbPage frame3 {cccdddcd{******테이블을 추가할 필요 없다.12. Given the follwing segmen6
