FCFS-scheduling in a hard real-time environment under rush-hour conditions

DOI10.1007/BF02074875zbMath0761.90043MaRDI QIDQ1198965

Ulrich Schmid, Johann Blieberger

Publication date: 16 January 1993

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

meanvariancereal-time behaviourdiscrete time single server system

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Random trees in queueing systems with deadlines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the recursion depth of special tree traversal algorithms
• Some investigations on FCFS scheduling in hard real time applications
• The number of registers required for evaluating arithmetic expressions
• Singularity Analysis of Generating Functions
• Preemptive LCFS scheduling in hard real-time applications
• Asymptotic Methods in Enumeration
• Exponential Limiting Distributions in Queueing Systems with Deadlines

This page was built for publication: FCFS-scheduling in a hard real-time environment under rush-hour conditions