Multiprocessor Online Scheduling of Hard-Real-Time Tasks
IEEE Transactions on Software Engineering
Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
Stack-based scheduling for realtime processes
Real-Time Systems
Theoretical Computer Science
A complete axiomatization of finite-state ACSR processes
Information and Computation
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
The AltaRica formalism for describing concurrent systems
Fundamenta Informaticae - Special issue prepared in tribute to Peter Ernst on the occasion of his retirement
Worst Case Execution Time Analysis for a Processor withBranch Prediction
Real-Time Systems - Special issue on worst-case execution-time analysis
Scheduling periodic tasks on uniform multiprocessors
Information Processing Letters
Software Engineering
Automata, Languages, and Machines
Automata, Languages, and Machines
Off-Line Computation of Real-Time Schedules Using Petri Nets
Discrete Event Dynamic Systems
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
New Upper Bounds for Generalized Intersection Searching Problems
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Minimal schedulability interval for real-time systems of periodic tasks with offsets
Theoretical Computer Science
Scheduling hard sporadic tasks with regular languages and generating functions
Theoretical Computer Science - Implementation and application automata
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
The Feasibility Analysis of Multiprocessor Real-Time Systems
ECRTS '06 Proceedings of the 18th Euromicro Conference on Real-Time Systems
Sustainable Scheduling Analysis
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Using controller-synthesis techniques to build property-enforcing layers
ESOP'03 Proceedings of the 12th European conference on Programming
Discrete geometry applied in hard real-time systems validation
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
A proposal for real-time interfaces in SPEEDS
Proceedings of the Conference on Design, Automation and Test in Europe
Regular geometrical languages and tiling the plane
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Geometrical regular languages and linear diophantine equations
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Geometricity of binary regular languages
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Integrating PFairness within a model based scheduling tool
VECoS'10 Proceedings of the Fourth international conference on Verification and Evaluation of Computer and Communication Systems
Geometrical regular languages and linear Diophantine equations: The strongly connected case
Theoretical Computer Science
Decidability of geometricity of regular languages
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
| Hi-index | 5.23 |
This paper presents the initial step of an aid design method earmarked for operational validation of hard real-time systems. We consider systems that are composed of sequential hard real-time tasks, which are embedded on centralized multiprocessor architectures. We introduce a model based upon untimed finite automata and meant to collect the operational behaviors of the system compatible with its time specifications, and we go on to provide a feasibility decision result for systems composed of tasks presenting CPU loads which are exact values: execution times are not WCET values. This is why we call this approach WCET-free analysis. The results we have achieved likewise involve hardware specifications such as multiprocessors and speeds of processors.