2008 Reports
Predictable Programming on a Precision Timed Architecture
In a hard real-time embedded system, the time at which a result is computed is as important as the result itself. Modern processors go to extreme lengths to ensure their function is predictable, but have abandoned predictable timing in favor of average-case performance. Real-time operating systems provide timing-aware scheduling policies, but without precise worst-case execution time bounds they cannot provide guarantees. We describe an alternative in this paper: a SPARC-based processor with predictable timing and instruction-set extensions that provide precise timing control. Its pipeline executes multiple, independent hardware threads to avoid costly, unpredictable bypassing, and its exposed memory hierarchy provides predictable latency. We demonstrate the effectiveness of this precision-timed (PRET) architecture through example applications running in simulation.
Subjects
Files
- EECS-2008-40.pdf application/pdf 4.08 MB Download File
More About This Work
- Academic Units
- Computer Science
- Publisher
- Department of Electrical Engineering and Computer Sciences, University of California, Berkeley
- Series
- University of California, Berkeley Department of Electrical Engineering and Computer Sciences Technical Reports, UCB/EECS-2008-40
- Published Here
- September 20, 2011