國立中山大學資訊工程學系92學年度第2學期博士班資格考試作業系統OperatingSystemConcepts-45%ModernOperatingSystems-15%Other-40%1.Deadlock[15%,A.Silberschatz,P.Galvin,andG.Gagne,OperatingSystemConcepts,JohnWiley&Sons,Inc.,6thEd,Chapter8,Exercises9]Considerasystemconsistingofmresourcesofthesametype,beingsharedbynprocesses.Resourcescanberequestedandreleasedbyprocessesonlyoneatatime.Showthatthesystemisdeadlockfreeifthefollowingtwoconditionshold:a.Themaximumneedofeachprocessisbetween1andmresourcesb.Thesumofallmaximumneedsislessthanm+n2.MassStorage[15%,A.Silberschatz,P.Galvin,andG.Gagne,OperatingSystemConcepts,JohnWiley&Sons,Inc.,6thEd,Chapter14,Exercises2]Supposethatadiskdrivehas5000cylinders,numbered0to4999.Thedriveiscurrentlyservingarequestatcylinder143,andthepreviousrequestwasatcylinder125.Thequeueofpendingrequests,inFIFOorder,is86,1470,913,1774,948,1509,1022,1750,130Startingfromthecurrentheadposition,whatisthetotaldistance(incylinders)thatthediskarmmovestosatisfyallthependingrequests,foreachofthefollowingdiskschedulingalgorithms?A.FCFSB.SSTFC.SCAND.LOOKE.C-SCAN3.CPUScheduling[15%,A.Silberschatz,P.Galvin,andG.Gagne,OperatingSystemConcepts,JohnWiley&Sons,Inc.,6thEd,Chapter6,Exercises4]Supposethatthefollowingprocessesarriveforexecutionatthetimesindicated.Eachprocesswillrunthelistedamountoftime.Inansweringthequestions,usenonpreemptiveschedulingandbasealldecisionsontheinformationyouhaveatthetimethedecisionmustbemade.ProcessArrivalTimeBurstTimeP10.08P20.65P31.02(A).WhatistheaverageturnaroundtimefortheseprocesseswiththeFCFSschedulingalgorithm?(B).WhatistheaverageturnaroundtimefortheseprocesseswiththeSJFschedulingalgorithm?(C).TheSJFalgorithmissupposedtoimproveperformance,butnoticethatwechosetorunprocessP1attime0becausewedidnotknowthattwoshorterprocesseswouldarrivesoon.ComputewhattheaverageturnaroundtimewillbeiftheCPUisleftidleforthefirst1unitandthenSJFschedulingisused.RememberthatprocessesP1andP2arewaitingduringthisidletime,sotheirwaitingtimemayincrease.Thisalgorithmcouldbeknown