Program path analysis to bound cache-related preemption delay in preemptive real-time systems
CODES '00 Proceedings of the eighth international workshop on Hardware/software codesign
Power minimization derived from architectural-usage of VLIW processors
Proceedings of the 37th Annual Design Automation Conference
Software implementation strategies for power-conscious systems
Mobile Networks and Applications
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
High-level algorithmic complexity evaluation for system design
Journal of Systems Architecture: the EUROMICRO Journal
Energy conscious factory method design pattern for mobile devices with C# and intermediate language
Mobility '06 Proceedings of the 3rd international conference on Mobile technology, applications & systems
An early real-time checker for retargetable compile-time analysis
Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes
Embedded system's performance analysis with RTC and QT
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Recent additions on the application programming interface of the TMO support middleware
Proceedings of the 13th Monterey conference on Composition of embedded systems: scientific and industrial issues
Energy-aware wireless systems with adaptive power-fidelity tradeoffs
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Execution characteristics of embedded applications on a Pentium 4-based personal computer
Journal of Embedded Computing
| Hi-index | 0.03 |
Embedded computer systems are characterized by the presence of a processor running application-specific dedicated software. A large number of these systems must satisfy real-time constraints. This paper examines the problem of determining the extreme (best and worst) case bounds on the running time of a given program on a given processor. This has several applications in the design of embedded systems with real-time constraints. An important aspect of this problem is determining which paths in the program are exercised in the extreme cases. The state-of-the-art solution here relies on an explicit enumeration of program paths. This solution runs out of steam rather quickly since the number of feasible program paths is typically exponential in the size of the program. We present a solution for this problem that does not require an explicit enumeration of program paths, i.e., the paths are considered implicitly. This solution is implemented in the program cinderella (in recognition of her hard real-time constraint-she had to be back home at the stroke of midnight), which currently targets a popular embedded processor-the Intel i960. The preliminary results of using this tool are also presented here