Pages that link to "Item:Q5681520"
From MaRDI portal
The following pages link to Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment (Q5681520):
Displaying 50 items.
- Calculating WCET estimates from timed traces (Q255292) (← links)
- On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm (Q255296) (← links)
- Response time analysis for fixed priority real-time systems with energy-harvesting (Q258435) (← links)
- Combined task- and network-level scheduling for distributed time-triggered systems (Q258438) (← links)
- Cache related pre-emption delays in hierarchical scheduling (Q258442) (← links)
- A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling (Q283177) (← links)
- 802.4 rate monotonic scheduling in hard real-time environments: setting the medium access control parameters (Q287032) (← links)
- On fixed priority scheduling, offsets and co-prime task periods (Q293317) (← links)
- Liu and Layland's schedulability test revisited (Q294728) (← links)
- Integrating security constraints into fixed priority real-time schedulers (Q298053) (← links)
- Line search method for solving a non-preemptive strictly periodic scheduling problem (Q310329) (← links)
- Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling (Q318911) (← links)
- Maintaining the feasibility of hard real-time systems with a reduced number of priority levels (Q326990) (← links)
- A new sufficient schedulability analysis for hybrid scheduling (Q328917) (← links)
- Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms (Q332516) (← links)
- Minimality of EDF networks with resource sharing (Q343806) (← links)
- A mechanism of function calls in MSVL (Q344760) (← links)
- Causality problem in real-time calculus (Q346787) (← links)
- Security-aware optimization for ubiquitous computing systems with SEAT graph approach (Q355496) (← links)
- Feasibility interval for the transactional event handlers of P-FRP (Q355499) (← links)
- Asynchronous task execution in networked control systems using decentralized event-triggering (Q360673) (← links)
- On queues with impatience: stability, and the optimality of earliest deadline first (Q386347) (← links)
- A greedy algorithm for combined scheduling of computations and data exchanges in real-time systems (Q395472) (← links)
- {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling (Q436211) (← links)
- CPU scheduling and memory management for interactive real-time applications (Q436214) (← links)
- Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling (Q436216) (← links)
- Qoc elastic scheduling for real-time control systems (Q436218) (← links)
- Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme (Q438181) (← links)
- On the nature and impact of self-similarity in real-time systems (Q438197) (← links)
- Feasibility analysis of real-time transactions (Q438201) (← links)
- State-based scheduling with tree schedules: analysis and evaluation (Q438213) (← links)
- On-line schedulability tests for adaptive reservations in fixed priority scheduling (Q438225) (← links)
- Control: a perspective (Q463779) (← links)
- Optimal and efficient adaptation in distributed real-time systems with discrete rates (Q483961) (← links)
- Stability of adaptive feedback-based resource managers for systems with execution time variations (Q483965) (← links)
- Unified overhead-aware schedulability analysis for slot-based task-splitting (Q488236) (← links)
- Computing periodic request functions to speed-up the analysis of non-cyclic task models (Q495917) (← links)
- Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory (Q495922) (← links)
- Maintaining thermal comfort in buildings: feasibility, algorithms, implementation, evaluation (Q497986) (← links)
- Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms (Q497994) (← links)
- Graph-based models for real-time workload: a survey (Q497995) (← links)
- A misconception in blocking time analyses under multiprocessor synchronization protocols (Q518846) (← links)
- Model predictive control under timing constraints induced by controller area networks (Q518848) (← links)
- Energy efficient scheduling for real-time embedded systems with QoS guarantee (Q535734) (← links)
- Feasibility analysis under fixed priority scheduling with limited preemptions (Q554013) (← links)
- Cluster scheduling for real-time systems: utilization bounds and run-time overhead (Q554016) (← links)
- Scheduling of hard real-time garbage collection (Q610431) (← links)
- Schedulability and sensitivity analysis of multiple criticality tasks with fixed-priorities (Q613786) (← links)
- {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines (Q613790) (← links)
- Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems (Q617741) (← links)
