FCFS-scheduling in a hard real-time environment under rush-hour conditions
From MaRDI portal
Publication:1198965
DOI10.1007/BF02074875zbMATH Open0761.90043MaRDI QIDQ1198965FDOQ1198965
Authors: Ulrich Schmid, Johann Blieberger 
Publication date: 16 January 1993
Published in: BIT (Search for Journal in Brave)
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
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Singularity Analysis of Generating Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotic Methods in Enumeration
- The number of registers required for evaluating arithmetic expressions
- On the recursion depth of special tree traversal algorithms
- Some investigations on FCFS scheduling in hard real time applications
- Preemptive LCFS scheduling in hard real-time applications
- Exponential Limiting Distributions in Queueing Systems with Deadlines
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)
