Rate analysis for embedded systems
- 1 July 1998
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 3 (3) , 408-436
- https://doi.org/10.1145/293625.293631
Abstract
Embedded systems consist of interacting components that are required to deliver a specific functionality under constraints on execution rates and relative time separation of the components. In this article, we model an embedded system using concurrent processes interacting through synchronization. We assume that there are rate constraints on the execution rates of processes imposed by the designer or the environment of the system, where the execution rate of a process is the number of its executions per unit time. We address the problem of computing bounds on the execution rates of processes constituting an embedded system, and propose an interactive rate analysis framework. As part of the rate analysis framework we present an efficient algorithms for checking the consistency of the rate constraints. Bounds on the execution rate of each process are computed using an efficient algorithm based on the relationship between the execution rate of a process and the maximum mean delay cycles in the process graph. Finally, if the computed rates violate some of the rate constraints, some of the processes in the system are redesigned using information from the rate analysis step. This rate analysis framework is implemented in a tool called RATAN. We illustrate by an example how RATAN can be used in an embedded system design.Keywords
This publication has 6 references indexed in Scilit:
- Specification and analysis of timing constraints for embedded systemsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1997
- An algorithm for exact bounds on the time separation of events in concurrent systemsIEEE Transactions on Computers, 1995
- Performance evaluation of concurrent systems using Petri netsInformation Processing Letters, 1984
- Performance Evaluation of Asynchronous Concurrent Systems Using Petri NetsIEEE Transactions on Software Engineering, 1980
- A characterization of the minimum cycle mean in a digraphDiscrete Mathematics, 1978
- Scheduling Parallel ComputationsJournal of the ACM, 1968