Improved Round Robin CPU scheduling algorithm: Round Robin, Shortest Job First and priority algorithm coupled to increase throughput and decrease waiting time and turnaround time

In multitasking operating system, processes don't run simultaneously, but switch very expeditiously. Thus, all the processes share the CPU time. It is the job of the scheduler to select a process from the ready queue and place it into the memory based a particular strategy known as Scheduling A...

Celý popis

Podrobná bibliografie

Vydáno v:	ICGTSPICC 2016 : proceedings : International Conference on Global Trends in Signal Processing, Information Computing and Communication : 22-24 December 2016, Jalgaon, India s. 184 - 187
Hlavní autoři:	Parekh, Harshal Bharatkumar, Chaudhari, Sheetal
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 01.12.2016
Témata:	Algorithm design and analysis Context Context Switch CPU Scheduling Heuristic algorithms Priority Round robin Signal processing algorithms SJF Switches Time Quantum Turn Around Time Waiting Time
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!