Quantum settings denoted by q, Operating System

Determining the time quantum for a job is a critical task.

Given the assumptions that the average switching time between processes is s, and the average amount of time an I/O bound process uses before generating an I/O request is t (t >> s). Discuss the effect of each of the following quantum settings denoted by q.

a) q = infinity
b) q is slightly greater than zero
c) q = s
d) s < q < t
e) q = t
f) q > t

Posted Date: 3/15/2013 6:32:23 AM | Location : United States







Related Discussions:- Quantum settings denoted by q, Assignment Help, Ask Question on Quantum settings denoted by q, Get Answer, Expert's Help, Quantum settings denoted by q Discussions

Write discussion on Quantum settings denoted by q
Your posts are moderated
Related Questions
Define spooling. A spool is a buffer that holds output for a device, like printer, that cannot accept interleaved data streams. When a request finishes printing, the spooling s

Define caching. A cache is a region of fast memory that holds copies of data. Access to the cached copy is well-organized than access to the original. Caching and buffering are

What are the characteristics of SRS? i. Correct - The SRS should be made up to date when appropriate requirements are identified. ii. Unambiguous - When the requirements are

Why interrupt can be used? The majority of the different parts of the PC need to send information to and from the processor and they expect to be able to get the processor's at

Define UNIX device driver The UNIX device driver is structured into two halves called top half and bottom half

Q. What kinds of networking does Windows XP support? How does Windows XP execute transport protocols? Describe two networking protocols. Answer: Support is offer for bo

Question: (a) (i) What is a microkernel? Describe the benefits of using microkernels. (ii) How does a microkernel-based operating system differ from a traditional operating

what is a batch system give me answer in simple words so that i can understand

Evicting the most-recently used (MRU) page does very well on LRU's worst case. In general, however, MRU is a bad idea, since many programs exhibit temporal locality in their memory

Another solution then would be to keep a pool of threads. Whenever a new task arrives, the system would simply get a thread from pool and set that thread to work on the given task.