Some investigations on FCFS scheduling in hard real time applications

DOI10.1016/0022-0000(92)90036-IzbMath0767.90018OpenAlexW2088229587MaRDI QIDQ1201887

Ulrich Schmid, Johann Blieberger

Publication date: 17 January 1993

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(92)90036-i

zbMATH Keywords

asymptotic formulasdiscrete time single server systemreal time behaviour

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Random trees in queueing systems with deadlines ⋮ FCFS-scheduling in a hard real-time environment under rush-hour conditions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the recursion depth of special tree traversal algorithms
• The number of registers required for evaluating arithmetic expressions
• Preemptive LCFS scheduling in hard real-time applications
• Asymptotic Methods in Enumeration

This page was built for publication: Some investigations on FCFS scheduling in hard real time applications