Task scheduling with RT constraints

Authors:
M. Di Natale;A. Sangiovanni-Vincentelli;F. Balarin
Affiliations:
Dip. Ing. dell'Informazione, Università degli Studi di Pisa, Pisa, Italy;Department of EECS, Univ. of California at Berkeley, Berkeley, CA;Cadence Berkeley Labs., Addisson St. Berkeley, CA
Venue:
Proceedings of the 37th Annual Design Automation Conference
Year:
2000

Citing 5
Cited 2

Formal verification of embedded systems based on CFSM networks

DAC '96 Proceedings of the 33rd annual Design Automation Conference
Schedule validation for embedded reactive real-time systems

DAC '97 Proceedings of the 34th annual Design Automation Conference
Priority Assignment for Embedded Reactive Real-Time Systems

LCTES '98 Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems
Scheduling Dependent Tasks with Different Arrival Times to Meet Deadlines

Proceedings of the International Workshop organized by the Commision of the European Communities on Modelling and Performance Evaluation of Computer Systems
Schedulability Analysis for Automated Implementations of Real-Time Object-Oriented Models

RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium

Schedulability analysis with UML

UML for real
Mapping esterel onto a multi-threaded embedded processor

Proceedings of the 12th international conference on Architectural support for programming languages and operating systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of schedu ling reactive real-time tran saction s(task groups) implementing a net work of extend ed Finite State Machines comm unicating asynchronously. Task instances are activated in response to internal and/or external ev ents.The objective is avoiding the loss of events exchanged by the tasks. This sc heduling problem has many similarities with the conventional formulation of real-tim e problems and yet it differs enough to justify a rethinking of the assu mptions an d techniques used to solve the problem. Our iterative solution targets fixed p riority systems and offers a priority assignment scheme together with a sufficiently tight worst-case analysis.