Result: An abstract model for scheduling real-time programs
Title:
An abstract model for scheduling real-time programs
Authors:
Source:
Formal methods and software engineering (Shanghai, 21-25 October 2002)Lecture notes in computer science. :204-215
Publisher Information:
Berlin: Springer, 2002.
Publication Year:
2002
Physical Description:
print, 8 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie des langages et analyse syntaxique, Language theory and syntactical analysis, Théorie programmation, Programming theory, Langage programmation, Programming language, Lenguaje programación, Méthode algébrique, Algebraic method, Método algebraico, Ordonnancement, Scheduling, Ordonamiento, Réponse temporelle, Time response, Respuesta temporal, Système temps réel, Real time system, Sistema tiempo real, Théorie programmation, Programming theory, Vérification programme, Program verification, Verificación programa
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Laboratorio de Computo Especializado, Universidad Autónoma de Bucaramanga, Calle 48 No 39 - 234, Bucaramanga, Colombia
ISSN:
0302-9743
Rights:
Copyright 2003 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.14539222
Database:
PASCAL Archive
Further Information
The main contribution of this paper is to devise a technique that allows one to study the implementation of the same program under different schedulers using high-level abstractions such as algebraic laws and simple methods. We apply the techniques presented in Hoare and He's Unifying Theories of Programming in order to develop an abstract model for scheduling real-time programs into a uniprocessor machine. We illustrate the applicability of the model by instancing it with two types of schedulers: a round-robin scheduler, employed when the participating parallel processes do not include deadline constraints, and a priority-based scheduler, used when each participating process is periodic and possesses an associated deadline.