Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleDecember 2020
Fixed-priority scheduling and controller co-design for time-sensitive networks
ICCAD '20: Proceedings of the 39th International Conference on Computer-Aided DesignArticle No.: 99, Pages 1–9https://doi.org/10.1145/3400302.3415715Time-sensitive networking (TSN) is a set of standardised communication protocols developed under the IEEE 802.1 working group. TSN aims to support deterministic communication based on network schedules that are distributively configured. It is widely ...
- research-articleJune 2020
Reliable and energy-aware fixed-priority (m, k)-deadlines enforcement with standby-sparing
For real-time computing systems, energy efficiency, Quality of Service, and fault tolerance are among the major design concerns. In this work, we study the problem of reliable and energy-aware fixed-priority (m, k) -deadlines enforcement with standby-...
Virtual timeline: a formal abstraction for verifying preemptive schedulers with temporal isolation
Proceedings of the ACM on Programming Languages (PACMPL), Volume 4, Issue POPLArticle No.: 20, Pages 1–31https://doi.org/10.1145/3371088The reliability and security of safety-critical real-time systems are of utmost importance because the failure of these systems could incur severe consequences (e.g., loss of lives or failure of a mission). Such properties require strong isolation ...
- articleDecember 2015
Maintaining The Feasibility Of Hard Real-Time Systems With A Reduced Number Of Priority Levels
International Journal of Applied Mathematics and Computer Science (IJAMCS), Volume 25, Issue 4Pages 709–722https://doi.org/10.1515/amcs-2015-0051AbstractWhen there is a mismatch between the cardinality of a periodic task set and the priority levels supported by the underlying hardware systems, multiple tasks are grouped into one class so as to maintain a specific level of confidence in their ...
- research-articleMarch 2014
Bandwidth allocation for fixed-priority-scheduled compositional real-time systems
ACM Transactions on Embedded Computing Systems (TECS), Volume 13, Issue 4Article No.: 91, Pages 1–29https://doi.org/10.1145/2560038Recent research in compositional real-time systems has focused on determination of a component's real-time interface parameters. An important objective in interface-parameter determination is minimizing the bandwidth allocated to each component of the ...
-
- research-articleJune 2013
Design of safety-critical Java level 1 applications using affine abstract clocks
M-SCOPES '13: Proceedings of the 16th International Workshop on Software and Compilers for Embedded SystemsPages 58–67https://doi.org/10.1145/2463596.2463600Safety-critical Java (SCJ) is designed to enable development of applications that are amenable to certification under safety-critical standards. However, its shared-memory concurrency model causes several problems such as data races, deadlocks, and ...
- ArticleAugust 2012
Fixed-Priority Schedulability of Arbitrary-Deadline Sporadic Tasks upon Periodic Resources
RTCSA '12: Proceedings of the 2012 IEEE International Conference on Embedded and Real-Time Computing Systems and ApplicationsPages 358–367https://doi.org/10.1109/RTCSA.2012.54Schedulability for compositional real-time systems has been the focus of a great deal of recent research. In this problem domain, we consider the fixed-priority (FP) scheduling of arbitrary-deadline sporadic task systems upon periodic resources. ...
- ArticleMay 2012
Parametric Utilization Bounds for Fixed-Priority Multiprocessor Scheduling
IPDPS '12: Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing SymposiumPages 261–272https://doi.org/10.1109/IPDPS.2012.33Future embedded real-time systems will be deployed on multi-core processors to meet the dramatically increasing high-performance and low-power requirements. This trend appeals to generalize established results on uniprocessor scheduling, particularly ...
- ArticleNovember 2011
Cache Related Pre-emption Delay Aware Response Time Analysis for Fixed Priority Pre-emptive Systems
RTSS '11: Proceedings of the 2011 IEEE 32nd Real-Time Systems SymposiumPages 261–271https://doi.org/10.1109/RTSS.2011.31Without the use of cache the increasing gap between processor and memory speeds in modern embedded microprocessors would have resulted in memory access times becoming an unacceptable bottleneck. In such systems, cache related pre-emption delays can be a ...
- ArticleNovember 2011
On Partitioned Scheduling of Fixed-Priority Mixed-Criticality Task Sets
TRUSTCOM '11: Proceedings of the 2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and CommunicationsPages 1051–1059https://doi.org/10.1109/TrustCom.2011.144Mixed-criticality real-time systems, where tasks may be associated with different criticality and assurance levels, have attracted much attention in the recent past. In this paper, we consider partitioning-based multiprocessor scheduling of mixed-...
- research-articleOctober 2011
Energy-efficient fixed-priority scheduling for real-time systems based on threshold work-demand analysis
CODES+ISSS '11: Proceedings of the seventh IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesisPages 159–168https://doi.org/10.1145/2039370.2039397In this paper, we study the problem of reducing the energy consumption for hard real-time systems based on fixed-priority (FP) scheme. To balance the static and dynamic energy consumption, the concept of critical speed was proposed in previous research. ...
- ArticleJuly 2011
Limited Blocking Resource Sharing for Global Multiprocessor Scheduling
ECRTS '11: Proceedings of the 2011 23rd Euromicro Conference on Real-Time SystemsPages 262–271https://doi.org/10.1109/ECRTS.2011.32In this paper we focus on resource sharing in global fixed-priority preemptive multiprocessor scheduling. We consider the scheduling of a set of sporadic constrained-deadline tasks sharing a set of resources in a non-nested way. We propose the Limited ...
- ArticleSeptember 2010
An Efficient DVS Algorithm for Fixed-Priority Real-Time Applications
ISPA '10: Proceedings of the International Symposium on Parallel and Distributed Processing with ApplicationsPages 29–37https://doi.org/10.1109/ISPA.2010.21Due to the effectiveness of slack time analysis methods for dynamic voltage scaling (DVS), we propose a low power fluid slack analysis (lpFSA) for enhancing energy efficiency of the existing methods. The on-line method is for hard real-time systems that ...
- ArticleJuly 2009
Partitioned Fixed-Priority Preemptive Scheduling for Multi-core Processors
ECRTS '09: Proceedings of the 2009 21st Euromicro Conference on Real-Time SystemsPages 239–248https://doi.org/10.1109/ECRTS.2009.33Energy and thermal considerations are increasingly driving system designers to adopt multi-core processors. In this paper, we consider the problem of scheduling periodic real-time tasks on multi-core processors using fixed-priority preemptive ...
- research-articleMarch 2008
Avoiding timing channels in fixed-priority schedulers
ASIACCS '08: Proceedings of the 2008 ACM symposium on Information, computer and communications securityPages 44–55https://doi.org/10.1145/1368310.1368320A practically feasible modification to fixed-priority schedulers allows to avoid timing channels despite threads having access to precise clocks.
This modification is rather simple: we compute at admission time a static predicate that states whether a ...
- research-articleNovember 2007
Fixed-priority scheduling on prioritized SMT processor
PDCS '07: Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and SystemsPages 116–123Prioritized SMT is a technique that placess a priority to each thread in hardware and the processor resources are preferentially allocated to threads with a high priority. This paper describes real-time task scheduling on Prioritized SMT processors. We ...
- articleSeptember 2007
Energy efficient DVS schedule for fixed-priority real-time systems
ACM Transactions on Embedded Computing Systems (TECS), Volume 6, Issue 4Pages 29–eshttps://doi.org/10.1145/1274858.1274867Energy consumption has become an increasingly important consideration in designing many real-time embedded systems. Variable voltage processors, if used properly, can dramatically reduce such system energy consumption. In this paper, we present a ...
- ArticleJune 2006
Procrastination for leakage-aware rate-monotonic scheduling on a dynamic voltage scaling processor
LCTES '06: Proceedings of the 2006 ACM SIGPLAN/SIGBED conference on Language, compilers, and tool support for embedded systemsPages 153–162https://doi.org/10.1145/1134650.1134673As the dynamic voltage scaling (DVS) technique provides system engineers the flexibility to trade-off the performance and the energy consumption, DVS has been adopted in many computing systems. However, the longer a job executes, the more energy in the ...
Also Published in:
ACM SIGPLAN Notices: Volume 41 Issue 7 - articleJanuary 2006
A framework for the response time analysis of fixed-priority tasks with stochastic inter-arrival times
Real-time scheduling usually considers worst-case values for the parameters of task (or message stream) sets, in order to provide safe schedulability tests for hard real-time systems. However, worst-case conditions introduce a level of pessimism that is ...
- articleNovember 2004
Real Time Scheduling Theory: A Historical Perspective
- Lui Sha,
- Tarek Abdelzaher,
- Karl-Erik Årzén,
- Anton Cervin,
- Theodore Baker,
- Alan Burns,
- Giorgio Buttazzo,
- Marco Caccamo,
- John Lehoczky,
- Aloysius K. Mok
Real-Time Systems (RETS), Volume 28, Issue 2-3Pages 101–155https://doi.org/10.1023/B:TIME.0000045315.61234.1eIn this 25th year anniversary paper for the IEEE Real Time Systems Symposium, we review the key results in real-time scheduling theory and the historical events that led to the establishment of the current real-time computing infrastructure. We conclude ...