Feasibility analysis of real-time transactions

DOI10.1007/s11241-012-9147-zzbMath1243.68122OpenAlexW2033057558MaRDI QIDQ438201

Pascal Richard, Ahmed Rahni, Michaël Richard, Emmanuel Grolleau

Publication date: 30 July 2012

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11241-012-9147-z

zbMATH Keywords

response time analysisdeadline driven schedulingfixed priority policyprocessor demandreal-time transactionstasks with offsets

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Response-Time Analysis of ROS 2 Processing Chains Under Reservation-Based Scheduling

Cites Work

• Feasibility analysis of real-time periodic tasks with offsets
• Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling
• Efficient implementation of tight response-times for tasks with offsets
• Dynamic- and static-priority scheduling of recurring real-time tasks
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Feasibility analysis of real-time transactions