Dynamic- and static-priority scheduling of recurring real-time tasks

From MaRDI portal
Publication:1395688


DOI10.1023/A:1021711220939zbMath1033.68012MaRDI QIDQ1395688

Sanjoy K. Baruah

Publication date: 1 July 2003

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

Full work available at URL: https://doi.org/10.1023/a:1021711220939


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


Related Items

Fast and Effective Multiframe-Task Parameter Assignment Via Concave Approximations of Demand, Feasibility analysis of real-time transactions, Computing periodic request functions to speed-up the analysis of non-cyclic task models, Graph-based models for real-time workload: a survey, A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs, Quantitative characterization of event streams in analysis of hard real-time applications, The feasibility of general task systems with precedence constraints on multiprocessor platforms, Cache-aware timing analysis of streaming applications, Minimizing migrations in fair multiprocessor scheduling of persistent tasks, Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible, GPU-based acceleration of system-level design tasks, Parameter adaptation for generalized multiframe tasks: schedulability analysis, case study, and applications to self-suspending tasks, Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement, An efficient schedulability analysis for optimizing systems with adaptive mixed-criticality scheduling, Static priority scheduling of event-triggered real-time embedded systems, Real-time scheduling for energy harvesting sensor nodes, Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems, Sensitivity analysis for fixed-priority real-time systems