State-based scheduling with tree schedules: analysis and evaluation

DOI10.1007/S11241-012-9151-3zbMATH Open1243.68095OpenAlexW2107330110MaRDI QIDQ438213FDOQ438213

Authors: Madhukar Anand, Sebastian Fischmeister, Insup Lee, Linh T. X. Phan 

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-9151-3

Recommendations

• Schedulability-driven communication synthesis for time triggered embedded systems
• Analysis of scheduling behaviour using generic timed automata
• Combined task- and network-level scheduling for distributed time-triggered systems
• Periodic real-time scheduling: From deadline-based model to latency-based model
• Quasi-static scheduling of communicating tasks

zbMATH Keywords

schedulingnetwork codereal-time networking

Mathematics Subject Classification ID

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

Cites Work

• A theory of timed automata
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• A note on preemptive scheduling of periodic, real-time tasks
• Title not available (Why is that?)
• Mode change protocols for real-time systems: a survey and a new proposal
• Title not available (Why is that?)
• Title not available (Why is that?)
• Specification and Analysis of Network Resource Requirements of Control Systems
• Quantitative characterization of event streams in analysis of hard real-time applications

Cited In (1)

• Scheduling with uncertain processing times in mixed-criticality systems

Uses Software

• TrueTime

This page was built for publication: State-based scheduling with tree schedules: analysis and evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438213)