Könyv Program scheduling and simulation in an operating system environment bernard lampard

Program scheduling and simulation in an operating system environment

Szerző: bernard lampard
Nyelv: Angol
Kötés: Puha kötésű
Kiadó: Grin Publishing
Elérhetőség: Beszállítói készleten
Küldés 5-8 napon belül
15 862 Ft
Research Paper from the year 2011 in the subject Computer Science - Commercial Information Technolog...

Információk a könyvről

Szerző
Nyelv
Angol
Kötés
Könyv - Puha kötésű
Kiadva
2014
oldal
104
EAN
9783656587415
ISBN
3656587418
Enbook ID
02497487
Súly
156
Méretek
210 x 151 x 14

Teljes leírás

Research Paper from the year 2011 in the subject Computer Science - Commercial Information Technology, grade: A, Massachusetts Institute of Technology, language: English, abstract: CPU scheduling is a technique used by computer operating systems to manage the usage of the computer s central processing unit. In a multi-programming environment whereby several processes are running on the same processor, it is essential to use scheduling criteria to avoid collisions in the computer s operations. This will help users in a given information technology oriented firm to share server spaces and resources like printers and file storage spaces. In the multi-tasking environment, a program called CPU scheduler selects one of the ready processes and allocates the processor to it. There are a number of occasions when a new process can or must be chosen to run: When a running process block and changes its state to Blocked , When a timer for a running process expires, When a waiting process unblocks and changes its state to Ready , and When a running process terminates and changes its state to Exit (Wikipedia, 2013). §Different types of scheduling programs referred to as algorithms can be employed in CPU scheduling instances. Among the most popular scheduling algorithms is Shortest Job First (SJF). SJF gives the processor to the process with the shortest next time allocation known as the burst. If there are processes with similar CPU bursts in the event queue, the scheduler uses First Come First Served algorithm which allocates the first process to arrive in the queue to the processor regardless of its burst time. It operates under the assumption that the length of the next CPU burst of each of the processes in ready queue is known (CPU scheduling, 2013). The SJF algorithm can be used in both pre-emptive and non-preemptive methods. The algorithm can be preemptive or not.§Shortest Job First with preemption uses priority measure to determine the next process to be given the CPU. The processes will be having different CPU bursts and different priority levels allocated to them. The process with the least priority magnitude is always picked next. A process already allocated the processor can be preempted the CPU and allocation done to another process with higher priority when such a process arrives in the queue. SJF with non-preemptive operates in the normal procedure whereby the job with the least CPU burst in the waiting queue is always picked next for allocation of the CPU and the rest of the processes have to wait no matter their urgency.§Based on the introduction above, it is essential to use the right CPU scheduling strategy to help us achieve

Érdekelheti

719 Ft

Ronnie

Ronnie O'Sullivan
4 311 Ft
5 951 Ft
13 503 Ft

"S" Word

MELISSA F NEWBY
5 284 Ft

Heaven and Hell

John Milton
13 100 Ft

Words from Jesus

Simon Peterson
1 520 Ft

Steam & Cinders

Lorenzsonn Axel Lorenzsonn
8 842 Ft

Growing Up Muslim

Sumbul Ali-Karamali
3 299 Ft

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

Winterland

Janni Pedersen
4 181 Ft

Dokud se budeš smát

Körnerová Hana Marie
4 373 Ft

Unruhige Zeiten

Rainer Schulze
39 396 Ft

Etudes Sur Les Moralistes Francais (1885)

Lucien Anatole Prevost-Paradol
12 261 Ft
8 396 Ft

Raspberry Pi für Kids

Michael Weigend
10 290 Ft
4 124 Ft
2 604 Ft
5 907 Ft
4 646 Ft
3 865 Ft