Efficient implementation of tight response-times for tasks with offsets

DOI10.1007/S11241-008-9050-9zbMath1167.68348OpenAlexW1969930925MaRDI QIDQ944003

Jukka Mäki-Turja, Mikael Nolin

Publication date: 12 September 2008

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

Full work available at URL: https://doi.org/10.1007/s11241-008-9050-9

zbMATH Keywords

Fixed priority schedulingResponse-time analysisTasks with offsets

Mathematics Subject Classification ID

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

Related Items (4)

Feasibility analysis of real-time transactions ⋮ Efficient implementation of tight response-times for tasks with offsets ⋮ Holistic schedulability analysis for multipacket messages in AFDX networks ⋮ Approximation techniques for response-time analysis of static-priority tasks

Cites Work

• Unnamed Item
• Real time scheduling theory: A historical perspective
• Efficient implementation of tight response-times for tasks with offsets
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Efficient implementation of tight response-times for tasks with offsets