FCFS-scheduling in a hard real-time environment under rush-hour conditions
type: Item
instance of: scholarly article
title: FCFS-scheduling in a hard real-time environment under rush-hour conditions
zbMATH Open document ID: 0761.90043
DOI: 10.1007/BF02074875
author: Ulrich Schmid
author: Johann Blieberger
published in: BIT
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 93322
zbMATH Keywords: discrete time single server system
zbMATH Keywords: real-time behaviour
zbMATH Keywords: mean
zbMATH Keywords: variance
MaRDI profile type: Publication
cites work: Asymptotic Methods in Enumeration
cites work: Preemptive LCFS scheduling in hard real-time applications
cites work: Q3219268
cites work: Exponential Limiting Distributions in Queueing Systems with Deadlines
cites work: Singularity Analysis of Generating Functions
cites work: The number of registers required for evaluating arithmetic expressions
cites work: On the recursion depth of special tree traversal algorithms
cites work: Q4101255
cites work: Q4057549
cites work: Some investigations on FCFS scheduling in hard real time applications
cites work: Q4385514
Recommended article: Some investigations on FCFS scheduling in hard real time applications
Recommended article: Preemptive LCFS scheduling in hard real-time applications
Recommended article: Open problems in real-time scheduling
Recommended article: Q3026339
Recommended article: Fuzzy scheduling with application to real-time systems
Recommended article: Scheduling algorithms based on weakly hard real-time constraints
Recommended article: Special issue: Flexible scheduling on real-time systems
description: scientific article; zbMATH DE number 93322