(0) thread scheduling
>the thread scheduler, part of the OS (usually) that is responsible for sharing the available CPUs out between the various threads. How exactly the scheduler works depends on the individual platform, but various modern operating systems (notably Windows and Linux) use largely similar techniques that we'll describe here. We'll also mention some key varitions between the platforms.
>Across platforms, thread scheduling1 tends to be based on at least the following criteria:]a priority, or in fact usually multiple "priority" settings that we'll discuss below;]a quantum, or number of allocated timeslices of CPU, which essentially determines the amount of CPU time a thread is allotted before it is forced to yield the CPU to another thread of the same or lower priority (the system will keep track of the remaining quantum at any given time, plus its default quantum, which could depend on thread type and/or system configuration);]a state, notably "runnable" vs "waiting";]metrics about the behaviour of threads, such as recent CPU usage or the time since it last ran (i.e. had a share of CPU), or the fact that it has "just received an event it was waiting for".
Welcome
Liezel P. Magcalayo Blog.......('',
Blog Archive
-
▼
2009
(22)
-
▼
August
(12)
- (0) Resource allocation grapha set of vertices V a...
- RESOURCE ALLOCATION GRAPH(0)A Resource Allocation ...
- (0) recovery from deadlock Recovery through preemp...
- (0) deadlock detection Often neither de...
- (0)Deadlock PreventionRestrain the ways requests c...
- (0) Methods for handling deadlockDeadlock Preventi...
- (0)deadlock characterization Deadlock can arise i...
- (0) thread scheduling>the thread scheduler, part o...
- (0)Real Time Scheduling• Many real time systems ru...
- (0) Multiprocessor SchedulingVery little has to be...
- Substantial Information about threads of Operating...
- (0) CPU Scheduling algorothmsCPU scheduling algori...
-
▼
August
(12)
Subscribe to:
Post Comments (Atom)
0 comments:
Post a Comment