Andere Kunden interessierten sich auch für
![A Fuzzy Set Theoretic Approach To CPU Scheduling]( "A Fuzzy Set Theoretic Approach To CPU Scheduling")
A Fuzzy Set Theoretic Approach To CPU Scheduling38,99 €![Operating System]( "Operating System")
Operating System50,99 €![Fuzzy Approach For SJF CPU Scheduling]( "Fuzzy Approach For SJF CPU Scheduling")
Fuzzy Approach For SJF CPU Scheduling32,99 €![Advanced Caching Methods For Multiple CPU Systems]( "Advanced Caching Methods For Multiple CPU Systems")
Advanced Caching Methods For Multiple CPU Systems32,99 €![Grundkurs Betriebssysteme]( "Grundkurs Betriebssysteme")
Grundkurs Betriebssysteme37,99 €![Performance Analysis of Real Time Dynamic Scheduling Algorithms]( "Performance Analysis of Real Time Dynamic Scheduling Algorithms")
Performance Analysis of Real Time Dynamic Scheduling Algorithms40,99 €![FAULT-TOLERANT REAL-TIME SCHEDULING FOR MULTIPROCESSOR SYSTEMS]( "FAULT-TOLERANT REAL-TIME SCHEDULING FOR MULTIPROCESSOR SYSTEMS")
FAULT-TOLERANT REAL-TIME SCHEDULING FOR MULTIPROCESSOR SYSTEMS44,99 €
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.