Proceedings of the 2008 International Conference on Compilers, Architectures and Synthesis for Embedded Systems 2008
DOI: 10.1145/1450095.1450117
|View full text |Cite
|
Sign up to set email alerts
|

Predictable programming on a precision timed architecture

Abstract: 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
124
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 119 publications
(124 citation statements)
references
References 28 publications
(35 reference statements)
0
124
0
Order By: Relevance
“…The precision timed (PRET) architecture is first presented in [8]. PRET implements a RISC pipeline and performs chiplevel multithreading for several threads to eliminate data forwarding and branch prediction [11].…”
Section: Related Workmentioning
confidence: 99%
“…The precision timed (PRET) architecture is first presented in [8]. PRET implements a RISC pipeline and performs chiplevel multithreading for several threads to eliminate data forwarding and branch prediction [11].…”
Section: Related Workmentioning
confidence: 99%
“…This way, they can pay off the related cost more easily. Instead, modifying current general-purpose architectures, as in [34], is an appealing approach. However, in this particular example, the modifications were significant.…”
Section: Motivation and Research Objectivesmentioning
confidence: 99%
“…MSRS may be regarded as an improvement of earlier approaches to prevent one task evicting local memory resources used by another, such as static cache locking [29] and static SPM partitioning [9], [7]. Simpler forms of MSRS have been proposed [30], [9], but the one used in this paper has the important distinction of enabling any task to use an arbitrary number of blocks in SPM independently of all other tasks [10].…”
Section: Related Workmentioning
confidence: 99%
“…There has been recent interest in using SPM within realtime systems instead of cache [5], [6], [7], [8]. But support for preemptive multitasking is a problem: how should the SPM be managed if tasks can preempt each other?…”
Section: Introduction Scratchpad Memory (Spm) Is a Form Of Local Mmentioning
confidence: 99%