![]() Objectives of Process Scheduling Algorithm This is possible only with process scheduling. In multi programming systems, one process can use CPU while another is waiting for I/O. In a uni programming system like MS-DOS, time spent waiting for I/O is wasted and CPU is free during this time. Waiting Time = Turn Around Time – Burst TimeĪ typical process involves both I/O time and CPU time. Waiting Time(W.T): Time Difference between turn around time and burst time. ISRO CS Syllabus for Scientist/Engineer Exam.ISRO CS Original Papers and Official Keys.GATE CS Original Papers and Official Keys.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |