Maintaining the Feasibility of Hard Real–Time Systems With a Reduced Number of Priority Levels

International Journal of Applied Mathematics and Computer Science
doi 10.1515/amcs-2015-0051
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Walter de Gruyter GmbH

Related search

Analyzing Stochastic Fixed-Priority Real-Time Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Supporting Deliberative Real-Time AI Systems: A Fixed Priority Scheduling Approach

Proceedings - Euromicro Conference on Real-Time Systems
HardwareArchitectureSoftware
2007English

Static Timing Analysis for Hard Real-Time Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Increasing Schedulability in Distributed Hard Real-Time Systems

English

Using Fixed Priority Pre-Emptive Scheduling in Real-Time Systems

International Journal of Computers, Communications and Control
MathematicsComputer NetworksComputer Science ApplicationsComputational TheoryCommunications
2011English

Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2008English

Low-Energy Standby-Sparing for Hard Real-Time Systems

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
ElectricalSoftwareComputer GraphicsComputer-Aided DesignElectronic Engineering
2012English

Maintaining Integrity Constraints and Security in Real-Time Database Systems

1998English

Deterministic Runtime Adaptation for Hard Real-Time Embedded Systems With Processing Constraints

2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy