FCFS-scheduling in a hard real-time environment under rush-hour conditions
From MaRDI portal
Publication:1198965
Recommendations
- Some investigations on FCFS scheduling in hard real time applications
- Preemptive LCFS scheduling in hard real-time applications
- Open problems in real-time scheduling
- scientific article; zbMATH DE number 4014024
- Fuzzy scheduling with application to real-time systems
- Scheduling algorithms based on weakly hard real-time constraints
- Special issue: Flexible scheduling on real-time systems
Cites work
- scientific article; zbMATH DE number 3886512 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3522951 (Why is no real title available?)
- scientific article; zbMATH DE number 1142298 (Why is no real title available?)
- Asymptotic Methods in Enumeration
- Exponential Limiting Distributions in Queueing Systems with Deadlines
- On the recursion depth of special tree traversal algorithms
- Preemptive LCFS scheduling in hard real-time applications
- Singularity Analysis of Generating Functions
- Some investigations on FCFS scheduling in hard real time applications
- The number of registers required for evaluating arithmetic expressions
Cited in
(4)
This page was built for publication: FCFS-scheduling in a hard real-time environment under rush-hour conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198965)