Time slice, Computer Engineering

The Linux Process Scheduler uses time slice to prevent a single process from using the CPU for too long. A time slice specifies how long the process can use the CPU. In our simulation, the minimum time slice possible is 10ms and the maximum time slice possible is 300 ms. The scheduler assigns higher time slices to processes that are more interactive and lower time slices to processes that are more CPU intensive. Note that time slice is a positive integer in this range [10, 300]. To calculate the time slice, we use this formula:

2160_Time slice.png

Each process is supplied with a priority level that ranks a process based on their worth and need for processor time. The priority levels range from 100 to 140 [100,140]. Processes with a lower priority will run before a process with a higher priority. Process with a lower priority level also receives a longer time slice. A process's initial priority (sometimes called static priority) is calculated based on its nice value. Nice values range from -20 to +19 [-20, 19] indicating how nice the process is. Larger nice values correspond to a lower priority. CPU intensive processes typically have higher nice values while IO bound processes have lower nice values. Nice values are provided with the input file. Note that a priority value is a positive integer in this range

[100,140]. To calculate the initial (or static) priority we use this formula:

2269_Time slice1.png

After a process exhausts its time slice, it will join the expired queue or go back to the active queue. Before doing that, it has to calculate its new priority (sometimes called the dynamic priority). This is the formula used to calculate the dynamic priority:

priority = original priority + bonus:

865_Time slice2.png

Bonus points are given to processes that either use too much or too little CPU time. Bonus points are integers range from -5 to +5 ([-5, 5]). Here are the guidelines to calculating bonus points:

547_Time slice3.png

Note : Here total IO mean the total time spent in the IO queue to this point and total CPU mean the total time spent in the CPU to this point.

Posted Date: 4/3/2013 3:06:20 AM | Location : United States







Related Discussions:- Time slice, Assignment Help, Ask Question on Time slice, Get Answer, Expert's Help, Time slice Discussions

Write discussion on Time slice
Your posts are moderated
Related Questions
Function of an IP Packet Screening Router: A screening router is the most basic type of firewall and uses only the packet filtering capability to control and monitor network tr

There are two methods to update your BIOS chip: 1. Flash it (software method) 2. Program it with an EEPROM programmer. This is a hardware method. This is how we at BIOSMAN pr

Tool that is used to transfer data/files among computers on the Internet TCP (Transfer control protocol)

The "turn-around" time of a user job is the? Ans. Total time taken to execute the job is called "turn around" time.

Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve betw   #includ

What are the characteristics of SRAM? SRAM are fast They are volatile They are of high cost Less density

In a LAN network every system is identified by? In a LAN network all systems are identified through IP Address.

Register Addressing mode - computer architecture: Register Addressing: Register addressing mode is same to direct addressing. Only difference in between is that the addre

Application and Function Areas - artificial intelligence: Individual applications and function often drive "AI" research much more than the long term relative field described

What do you mean by polynomial and exponential bounds?   Bounds of the form nc for c greater than 0 .such a bound are known as polynomial bounds. Bounds of the form 2(n )  .suc