A bandwidth allocation scheme for compositional real-time systems with periodic resources
DOI10.1007/S11241-011-9144-7zbMATH Open1243.68105OpenAlexW2065398381MaRDI QIDQ438190FDOQ438190
Authors: Nathan Fisher, Farhana Dewan 
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-011-9144-7
Recommendations
- Approximation algorithm for periodic real-time tasks with workload-dependent running-time functions
- A unified approach to approximating resource allocation and scheduling
- A unified approach to approximating resource allocation and scheduling
- Resource reservation in dynamic real-time systems
- scientific article; zbMATH DE number 2030115
approximation algorithmsschedulability analysissporadic taskscompositional real-time systemsearliest-deadline firstperiodic resource model
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- A bandwidth allocation scheme for compositional real-time systems with periodic resources
- Chebyshev's approximation algorithms and applications
- Title not available (Why is that?)
- EDF-schedulability of synchronous periodic task systems is coNP-hard
- Feasibility problems for recurring tasks on one processor
Cited In (4)
- Cache related pre-emption delays in hierarchical scheduling
- A bandwidth allocation scheme for compositional real-time systems with periodic resources
- A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees
- Designing end-to-end resource reservations in predictable distributed embedded systems
This page was built for publication: A bandwidth allocation scheme for compositional real-time systems with periodic resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438190)
