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.
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: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Seller Inventory # 9783659162718
Quantity: 2 available
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. Introduction to CPU Scheduling Algorithms | Design and Performance Evaluation of Optimum Service Time Concept for Round Robin Algorithm (OSTRR) | Himanshi Saxena (u. a.) | Taschenbuch | Englisch | LAP Lambert Academic Publishing | EAN 9783659162718 | Verantwortliche Person für die EU: LAP Lambert Academic Publishing, Brivibas Gatve 197, 1039 RIGA, LETTLAND, customerservice[at]vdm-vsg[dot]de | Anbieter: preigu. Seller Inventory # 106409947
Quantity: 5 available
Seller: Mispah books, Redhill, SURRE, United Kingdom
paperback. Condition: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Seller Inventory # ERICA829365916271X6
Quantity: 1 available