| Commit message (Collapse) | Author | Age |
... | |
|
|
|
|
|
| |
... before virtual spinning starts. This avoids a virtually spinning
job from being preempted by a newly released job just before
a global request is issued.
|
| |
|
| |
|
|
|
|
| |
Will be used by MPCP implementation.
|
|
|
|
| |
Generic priority-points also clear the way for xPCP variants.
|
| |
|
|
|
|
| |
Let unlocking task perform the queue management.
|
|
|
|
|
|
|
|
|
|
| |
The next owner of a FMLP-protected resource is dequeued from
the FMLP FIFO queue by unlock() (when the resource is freed by
the previous owner) instead of performing the dequeue by the next
owner immediately after it has been woken up.
This simplifies the code a little bit and also reduces potential
spinlock contention.
|
| |
|
|
|
|
| |
The preemption check must check the correct queue.
|
| |
|
|
|
|
| |
We can give up a processor under partitioning, too.
|
|
|
|
| |
As with GSN-EDF, do not insert release master into CPU heap.
|
| |
|
|
|
|
|
| |
Pfair expects to look at processors in order of increasing index.
Without this patch, Pfair could deadlock in certain situations.
|
| |
|
|
|
|
|
|
| |
Currently, this is basically the PSN-EDF plugin with a bit of renaming
going on. The priority queue implementation and priority boosting
implementation should change next.
|
|
|
|
| |
This will allow us to implement fixed-priority scheduling
|
| |
|
| |
|
| |
|
|
|
|
|
|
| |
This patch also converts Pfair to implement early releasing such that
no timer wheel is required anymore. This removes the need for a
maximum period restriction.
|
|
|
|
| |
MAX_ORDER is 11, but this is about number of records, not number of pages.
|
|
|
|
|
| |
Instead of having an extra flag, Pfair should just infer sporadic
release based on deadlines like other plugins, too.
|
|
|
|
|
|
|
| |
Just like C-EDF is a global scheduler that is split across several
clusters, Pfair can be applied on a per-cluster basis. This patch
changes the Pfair implementation to enable clustering based on the
recently added generic clustering support.
|
|
|
|
|
| |
Inspired by the existing C-EDF code, this generic version will build
clusters of CPUs based on a given cache level.
|
|
|
|
|
| |
Make the cluster size configuration in C-EDF generic so that it can be
used by other clustered schedulers.
|
|
|
|
|
| |
Since we don't expect to trace more than one lock type at a time,
having protocol-specific trace points is not required.
|
|
|
|
|
|
|
|
|
|
|
|
| |
As Glenn pointed out, it is useful for some protocols (e.g.,
k-exclusion protocols) to know the userspace configuration at object
creation time. This patch changes the fdso API to pass the parameter
to the object constructor, which is then in turn passed to the lock
allocater. The return code from the lock allocater is passed to
userspace in return.
This also fixes some null pointer dereferences in the FDSO code found
by the test suite in liblitmus.
|
|
|
|
| |
This introduces the global FMLP based on the generic locking layer.
|
|
|
|
|
| |
Implement the partitioned FMLP with priority boosting based on the
generic lock API.
|
|
|
|
| |
While we are at it, simplify edf_higher_prio() a bit.
|
| |
|
|
|
|
|
| |
This re-enables SRP support under PSN-EDF and demonstrates how the new
locking API should be used.
|
|
|
|
|
| |
This renders the FMLP and SRP unfunctional until they are ported to
the new locking API.
|
|
|
|
|
| |
Provide a unified userspace interface for plugin-specific locking
protocols.
|
|
|
|
|
|
|
|
|
| |
As the number of supported locking protocols is expected to rise,
hard-coding things like priority inheritance in the plugin interface
doesn't scale. Instead, use a new generic lock-ops approach. With this
approach, each plugin can define its own protocol implementation (or
use a generic one), and plugins can support multiple protocols without
having to change the plugin interface for each protocol.
|
|
|
|
| |
Passing the object type explicitly will enable generic lock constructors.
|
| |
|
| |
|
|
|
|
|
|
|
|
| |
It has always been LITMUS^RT policy that children of real-time tasks
may not skip the admissions test, etc. This used to be enforced, but
was apparently dropped during some port. This commit re-introduces
this policy. This fixes a kernel panic that occurred when "real-time
children" exited without proper initilization.
|
|
|
|
|
|
| |
We read in a line from userspace and remove the trailing newline in a
number of places. This function extracts the common code to avoid
future duplication.
|
| |
|
|
|
|
|
|
| |
This patch changes Feather-Trace to allocate memory for the minor
devices dynamically, which addresses a long-standing FIXME. It also
provides clean module exit and error conditions for Feather-Trace.
|
|
|
|
|
|
|
|
|
|
| |
This patch implements support for Feather-Trace devices to use the sysfs
file system and, consequently, udev support.
This allows us to allocate major/minor numbers for Feather-Trace
devices dynamically, which is desirable because our old static
allocations tend to create conflicts on modern distributions and/or
when there are many cores.
|
|
|
|
|
|
|
| |
Refactor the code that determines the C-EDF cluster size.
- Use an enum with symbolic constants instead of magic int values.
- Complain and fail to switch if an unsupported cluster size is requested.
- Default to ALL as suggested by Glenn and Andrea.
|
|
|
|
|
|
|
|
|
| |
Do not use the "scheduled_on" field to address the cpus structure
within a cluster. cpus may contain less items than num_online_cpus and
we may cause an out-of-bound access. Instead, use "scheduled_on" to
directly access the per-cpu cpu_entry_t structure.
Reported-by: Jonathan Herman <hermanjl@cs.unc.edu>
|
|
|
|
|
|
|
| |
budget_remaining() reports incorrect values due to the operands being
switched, which leads to an integer underflow.
Reported-by: Chris Kenna <cjk@cs.unc.edu>
|
|
|
|
|
|
|
| |
Make sure to check for maximum index value when accessing cedf_domain_t
array in cedf_activate_plugin().
Reported-by: Jeremy Erickson <jerickso@cs.unc.edu>
|
|
|
|
|
|
|
|
|
|
|
| |
Add information to each trace message that makes it easier to locate
where it came from. It is disabled by default since this adds a lot of
clutter. Example:
81281 P1 [gsnedf_schedule@litmus/sched_gsn_edf.c:406]: (rtspin/1483:1) blocks:0 out_of_time:0 np:0 sleep:1 preempt:0 state:0 sig:0
81282 P1 [job_completion@litmus/sched_gsn_edf.c:303]: (rtspin/1483:1) job_completion().
81283 P1 [__add_release@litmus/rt_domain.c:344]: (rtspin/1483:2) add_release(), rel=41941764351
81284 P1 [gsnedf_schedule@litmus/sched_gsn_edf.c:453]: (rtspin/1483:2) scheduled_on = NO_CPU
|