Rate monotonic scheduling in hard real-time systems
type: Item
instance of: scholarly article
title: Rate monotonic scheduling in hard real-time systems
zbMATH Open document ID: 0787.68010
DOI: 10.1016/0020-0190(93)90266-C
author: V. Pereyra
published in: Information Processing Letters
publication date: 1994-02-24T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 500521
zbMATH Keywords: real-time systems
zbMATH Keywords: rate monotonic scheduling
MaRDI profile type: Publication
cites work: Optimization by Simulated Annealing
cites work: On the complexity of fixed-priority scheduling of periodic, real-time tasks
cites work: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Recommended article: Rate-monotonic scheduling for hard-real-time systems
Recommended article: Rate monotonic scheduling re-analysed
Recommended article: Determining rate monotonic schedulability of real-time periodic tasks using continued fractions
Recommended article: Generalized rate monotonic schedulability bounds using relative period ratios
Recommended article: An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
Recommended article: Q4823965
description: scientific article; zbMATH DE number 500521