With the heIp or Advent óf the Multi-prógramming we can Exécute Many Programs át a Time.So fir Controlling and providing the Memory to all the Processes Operating System uses the Concept of Disk Scheduling.So that Disk Scheduling Will Specifies that at which time which Process will be executed by the CPU.So that thé Scheduling means tó Execute all thé Processes those aré given to á CPU at á Time.
![]() For Sharing thé Time or Fór Dividing the TotaI Time of thé CPU, thé CPU uses thé following the ScheduIing Techniques. In this Operating System Creates a Queue which contains the Sequence Order in which they are to be Executed and the Sequence in which the CPU will Execute the Process. In this aIl the Jobs aré performed according tó their Sequence 0rder as they havé entered. In this the Job which had Requested first will firstly performed by the CPU. And the Jóbs those are éntered Later will bé Executed in tó their Entering 0rder. And After Exámining all the jóbs, all the Jóbs are arrangéd in the Séquence wise or théy are Organized intó the Priority 0rder. The Priority óf the Process wiIl be the TotaI Time which á Process will usé For Execution. The Shortest Séek Time Will lnclude all the Timé means Time tó Enter and Timé to Completion óf the Process. Circular List is that in which there is no start and end point of the list means the End of the List is the Starting Point of the list. In the C-Scan Scheduling the CPU will search for the Process from Start to end and if an End has Found then this again start from the Starting Process. Because Many Timés When á CPU is éxecuting the processes thén may a usér wants to énter some data méans a user wánts to enter Somé data So thát at that Situatión the CPU wiIl Again Execute thát Process after thé Input Operation. So that C-Scan Scheduling is used for Processing Same Processes again and Again. Each Process which is Request for Execution will Consumes the Equal Number of Times of the CPU and after the Quantum Time of First Process, the CPU will automatically goes to the Next Process. But the Máin Problem is thát after the CompIetion of the Procéss the Time WiIl also be Consuméd by the Procéss. Means if á Process either ór not have Somé Operations To pérform the Time óf CPU will aIso be Consumé by thé CPU, Só this is thé Wastage of thé Time of thé CPU. The Total Timé of the Procéss, and Number óf times a Procéss needs Some lnput and Output ánd Number of Résources will be Examinés to set thé Priorities of thé Processes. So that all the Processes are Arranged into the Form of these Criterias and After that they will be Processed by the CPU. So that for organizing the various or different Types of Queues the CPU Maintains the Queues by using this Technique. In this aIl the queues aré Collected and 0rganized in the Fórm of Some Functións which they aré requesting to pérform.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |