| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
|
|
|
|
| |
interactivity of a kseg and assigns it a value of 0 through 100.
- Use sched_interact_score() to determine the dynamic priority.
- Define SCHED_CURR() in terms of sched_interact_score().
- Adjust the maximum slice back down to 100ms.
- Remove redundant clearing of ke_runq in sched_wakeup()
- Clean up #defines and comment them.
|
|
|
|
|
|
|
| |
calculations. Keep this changes local to the function so the tick count
is in its natural form otherwise. Previously 1000 was added each time
a tick fired and we divided by 1000 when it was reported. This is done
to reduce rounding errors.
|
|
|
|
|
|
| |
always place ITHD & REALTIME threads on the current queue of the current
cpu. Prior to this change an interrupt thread would only ever run on one
cpu.
|
|
|
|
| |
before we return to user space.
|
|
|
|
| |
This is just a cosmetic change but I've been meaning to do it for about a year.
|
|
|
|
|
|
|
|
| |
I was in two minds as to where to put them in the first case..
I should have listenned to the other mind.
Submitted by: parts by davidxu@
Reviewed by: jeff@ mini@
|
|
|
|
| |
strictness based on the current workload is finished.
|
|
|
|
|
|
|
|
|
| |
- Use the ratio of kg_runtime / kg_slptime to determine our dynamic priority.
- Scale kg_runtime and kg_slptime back when the sum of the two exceeds
SCHED_SLP_RUN_MAX. This allows us to slowly forget old behavior.
- Scale back the runtime and slptime in fork so that the new process has the
same ratio but much less accumulated time. This causes new behavior to be
noticed more quickly.
|
|
|
|
|
|
|
|
|
|
| |
have some negative effect on interactivity but it yields great perf. gains.
This also brings the conditions under which ULE context switches inline
with SCHED_4BSD.
- Define some new kseq_* functions for manipulating the run queue.
- Add a new kseq member ksq_rslices and ksq_bload. rslices is the sum of
the slices of runnable kses. This will be used for push load balance
decisions. bload is the number of threads blocked waiting on IO.
|
|
|
|
|
| |
in the kse datastructure called ke_cpu. This is the cpu which we are
currently bound to. Some flags may be added later to support hard binding.
|
| |
|
|
|
|
|
|
|
|
| |
sched_runnable() et all.
- Remove some dead code in sched_clock().
- Define two macros KSEQ_SELF() and KSEQ_CPU() for getting the kseq of the
current cpu or some alternate cpu.
- Start introducing kseq_() functions, such as kseq_choose() and kseq_setup().
|
| |
|
| |
|
|
|
|
|
|
|
|
| |
run queue for each cpu.
- Introduce kse stealing into the sched_choose() code. This helps balance
cpus better in cases where process turnover is high. This implementation
is fairly trivial and will likely be only a temporary measure until
something more sophisticated has been written.
|
|
scheduler with many SMP benefits. It is still very experimental and should
be used only in test environments.
|