Foundations of Real-Time Computing: Scheduling and Resource Management
Published 1 January 1991
André M. Van Tilborg, Gary M. Koob
Citations107
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper presents real-Time, Priority-Ordered, Deadlock Avoidance Algorithms, which describe the design and analysis of processor Scheduling Policies for Real-Time Systems and some of the strategies adopted in Spring.
Abstract
This volume contains a selection of papers that focus on the state-of the-art in real-time scheduling and resource management. Preliminary versions of these papers were presented at a workshop on the
Keywords
Computer Science