SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
The SPARC architecture manual (version 9)
The SPARC architecture manual (version 9)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
The Spring Kernel: A New Paradigm for Real-Time Systems
IEEE Software
Formal Verification of Overhead Accounting in an Avionics RTOS
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Shielded Processors: Guaranteeing Sub-millisecond Response in Standard Linux
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
Real-Time Systems
Multiprocessor EDF and Deadline Monotonic Schedulability Analysis
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Improved Schedulability Analysis of EDF on Multiprocessor Platforms
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Interface-Based Rate Analysis of Embedded Systems
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Sustainable Scheduling Analysis
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Soft real-time scheduling on multiprocessors
Soft real-time scheduling on multiprocessors
A Hybrid Real-Time Scheduling Approach for Large-Scale Multicore Platforms
ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
Techniques for Multiprocessor Global Schedulability Analysis
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Generalized Tardiness Bounds for Global Multiprocessor Scheduling
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Hard real-time performances in multiprocessor-embedded systems using ASMP-Linux
EURASIP Journal on Embedded Systems - Operating System Support for Embedded Real-Time Applications
The PlayStation 3 for High-Performance Scientific Computing
Computing in Science and Engineering
Hierarchical Scheduling Framework for Virtual Clustering of Multiprocessors
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
On the Scalability of Real-Time Scheduling Algorithms on Multicore Platforms: A Case Study
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
A Unified Hard/Soft Real-Time Schedulability Test for Global EDF Multiprocessor Scheduling
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
A Comparison of the M-PCP, D-PCP, and FMLP on LITMUSRT
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms
IEEE Transactions on Parallel and Distributed Systems
Accounting for Interrupts in Multiprocessor Real-Time Systems
RTCSA '09 Proceedings of the 2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
On the Implementation of Global Real-Time Schedulers
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Multiprocessor Extensions to Real-Time Calculus
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Asymmetric scheduling and load balancing for real-time on linux SMP
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
A model for analyzing data freshness of periodic real-time communication
Proceedings of the ACM/IEEE 4th International Conference on Cyber-Physical Systems
| Hi-index | 0.00 |
The importance of accounting for interrupts in multiprocessor real-time schedulability analsysis is discussed and three interrupt accounting methods, namely quantum-centric, task-centric, and processor-centric accounting, are analyzed and contrasted. Additionally, two special cases, dedicated interrupt handling (i.e., all interrupts are processed by one processor) and timer multiplexing (i.e., all jobs are released by a single hardware timer), are considered and corresponding analysis is derived. All discussed approaches are evaluated in terms of schedulability based on interrupt costs previously measured on a Sun Niagara multicore processor. The results show that there is no single ''best'' accounting technique that is always preferable, but rather that the relative performance of each approach varies significantly based on task set composition, i.e., the number of tasks and the maximum utilization.