Extending the concept of Round Robin algorithm (RR) to incorporate user or system defined priority and consider the case of different arrival times of process and suggesting a novel approach that minimizes context switching overhead, average waiting time and turnaround time. Approach: We calculate Optimum Priority ‘OP’ for each process which determines the order of execution of processes, Optimum Service Time ’OST’ for each process which determines time of execution of process in a single round and execute the processes in RR fashion using the calculated parameters. Results: Based on experiments and calculations, the proposed algorithm is successful in reducing afore mentioned problems. Conclusion: Our proposed algorithm can be effective in priority based systems where burst time and arrival time can be easily predicted.
"synopsis" may belong to another edition of this title.
Himanshi Saxena, B.Tech: Madan Mohan Malaviya Engineering College, Gorakhpur, India. Her areas of interests are Algorithms and Mobile Communications.
"About this title" may belong to another edition of this title.
Shipping:
US$ 10.90
From Spain to U.S.A.
Shipping:
US$ 53.47
From Germany to U.S.A.
Seller: Hamelyn, Madrid, Spain
Condition: Como nuevo. : Extending the concept of Round Robin algorithm (RR) to incorporate user or system defined priority and consider the case of different arrival times of process and suggesting a novel approach that minimizes context switching overhead, average waiting time and turnaround time. Approach: We calculate Optimum Priority 'OP' for each process which determines the order of execution of processes, Optimum Service Time 'OST' for each process which determines time of execution of process in a single round and execute the processes in RR fashion using the calculated parameters. Results: Based on experiments and calculations, the proposed algorithm is successful in reducing afore mentioned problems. Conclusion: Our proposed algorithm can be effective in priority based systems where burst time and arrival time can be easily predicted. EAN: 9783659162718 Tipo: Libros Categoría: Informática, internet y medios digitales|Sistemas operativos Título: Introduction to Cpu Scheduling Algorithms Autor: Himanshi Saxena| Prashant Agarwal Editorial: LAP Lambert Academic Publishing (20 junio 2012) Idioma: EN Páginas: 52 Formato: Tapa blanda Peso: 91 Año de publicación: 2012. Seller Inventory # Happ-2022-Jan-03-135340
Quantity: 1 available
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Saxena HimanshiHimanshi Saxena, B.Tech: Madan Mohan Malaviya Engineering College, Gorakhpur, India. Her areas of interests are Algorithms and Mobile Communications.Extending the concept of Round Robin algorithm (RR) to incorporat. Seller Inventory # 5136107
Quantity: Over 20 available
Seller: dsmbooks, Liverpool, United Kingdom
paperback. Condition: Like New. Like New. book. Seller Inventory # D8S0-3-M-365916271X-6
Quantity: 1 available