Author(s):
Andersson, Björn 
Date: 2007
Persistent ID: http://hdl.handle.net/10400.22/3944
Origin: Repositório Científico do Instituto Politécnico do Porto
Document details
Linearizability and schedulability
Description
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.
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.
Document Type
Report
Language English
Language English
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||