| dc.contributor.author | Andersson, Björn | |
| dc.date.accessioned | 2014-02-18T12:41:01Z | |
| dc.date.available | 2014-02-18T12:41:01Z | |
| dc.date.issued | 2007 | |
| dc.description.abstract | 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. | por |
| dc.identifier.uri | http://hdl.handle.net/10400.22/3944 | |
| dc.language.iso | eng | por |
| dc.peerreviewed | no | por |
| dc.publisher | IPP Hurray! Research Group | por |
| dc.relation.publisherversion | http://www.cister.isep.ipp.pt/docs/ | por |
| dc.title | Linearizability and schedulability | por |
| dc.type | report | |
| dspace.entity.type | Publication | |
| rcaap.rights | openAccess | por |
| rcaap.type | report | por |
