Linearizability and Schedulability
Ref: HURRAY-TR-071004 Publication Date: 3 to 6, Dec, 2007
Linearizability and Schedulability
Ref: HURRAY-TR-071004 Publication Date: 3 to 6, Dec, 2007Abstract:
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.
Björn AnderssonDocument:
View
Download28th IEEE Real-Time Systems Symposium (RTSS'07), Work-In-Progress Session.
Tucson, U.S.A..
Record Date: 8, Dec, 2007
Short links for this page: www.cister-labs.pt/docs/hurray_tr_071004 www.cister-labs.pt/docs/389