Treffer: Computing schedules for multithreaded real-time programs using geometry
Title:
Computing schedules for multithreaded real-time programs using geometry
Authors:
Source:
FORMATS 2004 : formal techniques, modelling and analysis of timed and fault-tolerant systems (Grenoble, 22-24 September 2004)Lecture notes in computer science. :325-342
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 17 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, 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, Automates. Machines abstraites. Machines de turing, Automata. Abstract machines. Turing machines, Théorie programmation, Programming theory, Géométrie, Geometry, Geometría, Multitâche, Multithread, Multitarea, Programmation parallèle, Parallel programming, Programación paralela, Programme concurrent, Concurrent program, Programa competidor, Système embarqué, Embedded systems, Système temps réel, Real time system, Sistema tiempo real, Vérification programme, Program verification, Verificación programa, Diagramme vérification programme
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
VERIMAG, Centre Equation, 2, av. de Vignate, 38610 Gières, France
ISSN:
0302-9743
Rights:
Copyright 2005 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.16335675
Database:
PASCAL Archive
Weitere Informationen
We describe a novel technique for computing efficient schedules for multi-threaded real-time programs. The technique makes use of ions which are constructed by embedding the model of the program in a geometric space and then constructing a decomposition of this space. This embedding uses the model of PV diagrams. We introduce a timed version for PV programs and diagrams, which allows us to define the worst-case response time of the schedules, and then to use the geometric abstractions for computing efficient schedules.