| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 182.55 KB | Adobe PDF |
Authors
Advisor(s)
Abstract(s)
Consider the problem of scheduling a set of tasks on
a single processor such that deadlines are met. Assume
that tasks may share data and that linearizability, the most
common correctness condition for data sharing, must be
satisfied. We find that linearizability can severely penalize
schedulability. We identify, however, two special cases
where linearizability causes no or not too large penalty on
schedulability.