An optimal fixed-priority assignment algorithm for supporting fault-tolerant hard real-time systems

Lima, G M D and Burns, A orcid.org/0000-0001-5621-8816 (2003) An optimal fixed-priority assignment algorithm for supporting fault-tolerant hard real-time systems. IEEE Transactions on Computers. pp. 1332-1346. ISSN 0018-9340

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: Copyright © 2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords: hard real-time systems,fault tolerance,schedulability analysis,priority assignment algorithm
Dates:
  • Published: October 2003
Institution: The University of York
Academic Units: The University of York > Computer Science (York)
The University of York > Faculty of Sciences (York) > Computer Science (York)
Depositing User: Repository Officer
Date Deposited: 18 Jul 2006
Last Modified: 17 May 2017 23:12
Published Version: http://dx.doi.org/10.1109/TC.2003.1234530
Status: Published
Refereed: Yes
Identification Number: https://doi.org/10.1109/TC.2003.1234530

Download

Filename: burnsa1.pdf

Description: burnsa1.pdf

Share / Export

Statistics