The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments
IEEE Transactions on Computers
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems
IEEE Transactions on Computers
An Improved Rate-Monotonic Admission Control and Its Applications
IEEE Transactions on Computers
A feasibility decision algorithm for rate monotonic scheduling of periodic real-time tasks
RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
A generalized utilization bound test for fixed-priority real-time scheduling
RTCSA '95 Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications
A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Improved Response-Time Analysis Calculations
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Rate Monotonic Analysis: The Hyperbolic Bound
IEEE Transactions on Computers
Enhanced Utilization Bounds for QoS Management
IEEE Transactions on Computers
Biasing Effects in Schedulability Measures
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Schedulability Analysis of Periodic Fixed Priority Systems
IEEE Transactions on Computers
IEEE Transactions on Computers
Garbage collection-aware utility accrual scheduling
Real-Time Systems
Solving a real-time allocation problem with constraint programming
Journal of Systems and Software
Sensitivity analysis for fixed-priority real-time systems
Real-Time Systems
A simulation methodology for worst-case response time estimation of distributed real-time systems
Proceedings of the conference on Design, automation and test in Europe
Improvements in polynomial-time feasibility testing for EDF
Proceedings of the conference on Design, automation and test in Europe
The space of EDF deadlines: the exact region and a convex approximation
Real-Time Systems
Constant-time admission control for deadline monotonic tasks
Proceedings of the Conference on Design, Automation and Test in Europe
Improved worst-case response-time calculations by upper-bound conditions
Proceedings of the Conference on Design, Automation and Test in Europe
Reducing stack with intra-task threshold priorities in real-time systems
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
Reliability comparison of schedulability test in ubiquitous computing
UIC'11 Proceedings of the 8th international conference on Ubiquitous intelligence and computing
TL-plane-based multi-core energy-efficient real-time scheduling algorithm for sporadic tasks
ACM Transactions on Architecture and Code Optimization (TACO) - HIPEAC Papers
Optimizing quality of service in real-time systems under energy constraints
ACM SIGOPS Operating Systems Review
Sharp utilization thresholds for some realtime scheduling problems
ACM SIGMETRICS Performance Evaluation Review
On using adversary simulators to obtain tight lower bounds for response times
Proceedings of the 27th Annual ACM Symposium on Applied Computing
FPSL, FPCL and FPZL schedulability analysis
Real-Time Systems
Optimising task layout to increase schedulability via reduced cache related pre-emption delays
Proceedings of the 20th International Conference on Real-Time and Network Systems
PDPA: period driven task and cache partitioning algorithm for multi-core systems
Proceedings of the 20th International Conference on Real-Time and Network Systems
Journal of Systems and Software
A multi-layered control approach for self-adaptation in automotive embedded systems
Advances in Software Engineering
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Sensitivity analysis for arbitrary activation patterns in real-time systems
Proceedings of the Conference on Design, Automation and Test in Europe
Approximation scheme for real-time tasks under fixed-priority scheduling with deferred preemption
Proceedings of the 21st International conference on Real-Time Networks and Systems
Explicit reservation of cache memory in a predictable, preemptive multitasking real-time system
ACM Transactions on Embedded Computing Systems (TECS)
Multi-mode monitoring for mixed-criticality real-time systems
Proceedings of the Ninth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis
Journal of Systems Architecture: the EUROMICRO Journal
Implementation and evaluation of mixed-criticality scheduling approaches for sporadic tasks
ACM Transactions on Embedded Computing Systems (TECS)
Exploring the design space of multiprocessor synchronization protocols for real-time systems
Journal of Systems Architecture: the EUROMICRO Journal
A review of fixed priority and EDF scheduling for hard real-time uniprocessor systems
ACM SIGBED Review - Special Issue on the 3rd Embedded Operating System Workshop (EWiLi 2013)
Hi-index | 0.00 |
The high computational complexity required for performing an exact schedulability analysis of fixed priority systems has led the research community to investigate new feasibility tests which are less complex than exact tests, but still provide a reasonable performance in terms of acceptance ratio. The performance of a test is typically evaluated by generating a huge number of synthetic task sets and then computing the fraction of those that pass the test with respect to the total number of feasible ones. The resulting ratio, however, depends on the metrics used for evaluating the performance and on the method for generating random task parameters. In particular, an important factor that affects the overall result of the simulation is the probability density function of the random variables used to generate the task set parameters. In this paper we discuss and compare three different metrics that can be used for evaluating the performance of schedulability tests. Then, we investigate how the random generation procedure can bias the simulation results of some specific scheduling algorithm. Finally, we present an efficient method for generating task sets with uniform distribution in a given space, and show how some intuitive solutions typically used for task set generation can bias the simulation results.