Paper Info
Title
Worst Case Response Time Analysis of Sporadic Graph Tasks with Fixed Priority Scheduling on a Uniprocessor
Abstract
Although simultaneous multithreading (SMT) has been shown being an efficient technique to improve processor performance, little work has been done on real-time SMT scheduling. The objective of this paper is to explore realtime SMT scheduling, for independent ...
Year
DOI
Venue
2005
10.1109/RTCSA.2005.103
RTCSA
Keywords
Field
DocType
efficient technique,simultaneous multithreading,processor performance,fixed priority scheduling,realtime smt scheduling,sporadic graph tasks,worst case response time,real-time smt scheduling,real time systems,feasibility analysis,graph theory,real time
Graph theory,Fixed-priority pre-emptive scheduling,Uniprocessor system,Computer science,Deadline-monotonic scheduling,Real-time computing,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Computation,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-7695-2346-3
4
0.57
References 
Authors
9
3
Name
Order
Citations
PageRank
Hui Xue Zhao162.43
Serge Midonnet27713.13
Laurent George321429.39