Title
Preference-oriented real-time scheduling and its application in fault-tolerant systems.
Abstract
•Investigate the preference-oriented executions for real-time tasks.•Propose two optimal preference-oriented (PO) scheduling algorithms.•Explore the application of PO scheduling algorithms for fault tolerant systems.•PO scheduling algorithms can effectively fulfill tasks’ preference requirements.
Year
DOI
Venue
2015
10.1016/j.sysarc.2014.12.001
Journal of Systems Architecture
Keywords
Field
DocType
Periodic real-time tasks,Preference-oriented execution,Scheduling algorithms,Fault-tolerant systems
Fixed-priority pre-emptive scheduling,Scheduling (computing),Computer science,Parallel computing,Real-time computing,Schedule,Fault tolerance,Distributed computing,Overhead (business)
Journal
Volume
Issue
ISSN
61
2
1383-7621
Citations 
PageRank 
References 
5
0.42
17
Authors
4
Name
Order
Citations
PageRank
Yifeng Guo150.42
Hang Su21135.17
Da-Kai Zhu3140566.97
Hakan Aydin4121861.97