Reduction-based schedulability analysis of distributed systems with cycles in the task graph

DOI10.1007/s11241-010-9098-1zbMath1204.68039OpenAlexW2155837078MaRDI QIDQ993510

Praveen Jayachandran, Tarek F. Abdelzaher

Publication date: 20 September 2010

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

Full work available at URL: https://doi.org/10.1007/s11241-010-9098-1

zbMATH Keywords

schedulability analysisend-to-end delaynon-acyclic systemsproblem reductionreal-time distributed system

Mathematics Subject Classification ID

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

Related Items (1)

Memory-centric scheduling for multicore hard real-time systems

Cites Work

• Quantitative characterization of event streams in analysis of hard real-time applications
• Delay composition in preemptive and non-preemptive real-time pipelines
• Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling
• A calculus for network delay. I. Network elements in isolation
• A calculus for network delay. II. Network analysis
• Evaluation and improvement of response time bounds for real-time applications under non-pre-emptive Fixed Priority Scheduling
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Reduction-based schedulability analysis of distributed systems with cycles in the task graph