Some investigations on FCFS scheduling in hard real time applications
type: Item
instance of: scholarly article
title: Some investigations on FCFS scheduling in hard real time applications
zbMATH Open document ID: 0767.90018
DOI: 10.1016/0022-0000(92)90036-I
author: Ulrich Schmid
author: Johann Blieberger
published in: Journal of Computer and System Sciences
publication date: 1993-01-17T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 98626
zbMATH Keywords: discrete time single server system
zbMATH Keywords: real time behaviour
zbMATH Keywords: asymptotic formulas
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: On the recursion depth of special tree traversal algorithms
cites work: Q4101255
cites work: The number of registers required for evaluating arithmetic expressions
cites work: Q4057549
cites work: Q5544744
full work available at URL: 0022-0000(92)90036-i
OpenAlex ID: W2088229587
Recommended article: FCFS-scheduling in a hard real-time environment under rush-hour conditions
Recommended article: Preemptive LCFS scheduling in hard real-time applications
Recommended article: A survey of hard real-time scheduling for multiprocessor systems
Recommended article: Q3026339
Recommended article: Q4346084
Recommended article: Q4656393
Recommended article: Special issue: Flexible scheduling on real-time systems
Recommended article: Scheduling algorithms based on weakly hard real-time constraints
description: scientific article; zbMATH DE number 98626