On a Real-Time Scheduling Problem
From MaRDI portal
Cited in
(39)- A new algorithm for scheduling periodic, real-time tasks
- Preemptive scheduling of periodic jobs in uniform multiprocessor systems
- Simple algorithms for multiprocessor scheduling to meet deadlines
- Rate-monotonic scheduling for hard-real-time systems
- Optimization of real-time multiserver system with two different channels and shortage of maintenance facilities.
- Real-time multiserver and multichannel systems with shortage of maintenance crews.
- Real-time system with homogeneous servers and nonidentical channels in steady-state
- Mixed-criticality federated scheduling for parallel real-time tasks
- Heuristic methods and applications: A categorized survey
- Task allocation in fault-tolerant distributed systems
- On a periodic maintenance problem
- Deadline-based scheduling of periodic task systems on multiprocessors.
- Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
- A survey of real-time scheduling on multiprocessor systems
- An optimal \(k\)-exclusion real-time locking protocol motivated by multi-GPU systems
- Interference-aware fixed-priority schedulability analysis on multiprocessors
- Architecture aware semi partitioned real-time scheduling on multicore platforms
- Real-time processing of streaming big data
- Schedulers for larger classes of pinwheel instances
- Tardiness bounds under global EDF scheduling on a multiprocessor
- A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm
- {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
- CPU scheduling and memory management for interactive real-time applications
- Slack-based multiprocessor scheduling of aperiodic real-time tasks
- Safe and optimal scheduling for hard and soft tasks
- Global scheduling based reliability-aware power management for multiprocessor real-time systems
- Cluster scheduling for real-time systems: utilization bounds and run-time overhead
- Discrete scheduling and critical utilization
- Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
- An optimal boundary fair scheduling algorithm for multiprocessor real-time systems
- Density peak clustering using grey wolf optimization approach
- Utility accrual real-time scheduling for multiprocessor embedded systems
- Optimizing distributed real-time embedded system handling dependence and several strict periodicity constraints
- Priority-based scheduling of mixed-critical jobs
- An analysis of fixed-priority schedulability on a multiprocessor
- Guaranteeing response times for aperiodic tasks in global multiprocessor scheduling
- M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms
- Schedulability issues for EDZL scheduling on real-time multiprocessor systems
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
This page was built for publication: On a Real-Time Scheduling Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4162943)
