Incremental Reconfiguration and Load Adjustment in Adaptive Real-Time Systems
IEEE Transactions on Computers
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems
IEEE Transactions on Computers
A Multithreaded Java Microcontroller for Thread-Oriented Real-Time Event Handling
PACT '99 Proceedings of the 1999 International Conference on Parallel Architectures and Compilation Techniques
Efficient On-Line Schedulability Tests for Priority Driven Real-Time Systems
RTAS '00 Proceedings of the Sixth IEEE Real Time Technology and Applications Symposium (RTAS 2000)
A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Exact and Efficient Analysis of Schedulability in Fixed-Packet Networks: A Generic Approach
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Guest Editorial: Introduction to the Special Issue
Real-Time Systems
| Hi-index | 0.00 |
In the Komodo project a real-time Java system based on a multithreaded Java microcontroller has been developed. A main scheduling policy realized by hardware in the microcontroller core is a new scheme called Guaranteed Percentage (GP) scheduling. This scheme assigns each thread a guaranteed percentage of the processor power thus providing a strict isolation of the threads on the processor.To prevent processor overload in the dynamic Java environment, fast online feasibility tests are necessary before a new thread is allowed to enter the microcontroller. Starting with the well known Processor Demand Analysis, a new test based on the periodic transformation of the processor workload is developed. This is a sufficient (but not necessary) scalable test, where the number of feasible thread sets found can be controlled by the costs. Furthermore, this test can be stopped, if a given cost or time limit is reached. We additionally propose a modified version of this test, which further reduces the costs and allows an online hardware feasibility test with a polynomial complexity of O(n(n + 1)/2). An evaluation shows, that the tests proposed here are able to find more than 90% of the feasible thread sets and all non-feasible thread sets with costs suitable for online testing.