2008
DOI: 10.1109/l-ca.2008.1
|View full text |Cite
|
Sign up to set email alerts
|

An Energy-Efficient Processor Architecture for Embedded Systems

Abstract: Abstract-We present an efficient programmable architecture for compute-intensive embedded applications. The processor architecture uses instruction registers to reduce the cost of delivering instructions, and a hierarchical and distributed data register organization to deliver data. Instruction registers capture instruction reuse and locality in inexpensive storage structures that are located near to the functional units. The data register organization captures reuse and locality in different levels of the hie… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
28
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 45 publications
(28 citation statements)
references
References 17 publications
(13 reference statements)
0
28
0
Order By: Relevance
“…The interconnect overhead in TTAs can be reduced by interconnect reduction, which is particularly effective in application specific processor design. Using explicit bypassing is an alternative of building explicit datapath architecture [8,[12][13][14]. The bypassing (forwarding) network in a conventional processors is used to reduce data hazard caused by the pipelining.…”
Section: Processors With Explicit Datapathmentioning
confidence: 99%
“…The interconnect overhead in TTAs can be reduced by interconnect reduction, which is particularly effective in application specific processor design. Using explicit bypassing is an alternative of building explicit datapath architecture [8,[12][13][14]. The bypassing (forwarding) network in a conventional processors is used to reduce data hazard caused by the pipelining.…”
Section: Processors With Explicit Datapathmentioning
confidence: 99%
“…The two groups are distinguished by the second bit (LRU [1]) of the LRU. The first bit (LRU[0]) distinguishes Way0 and Way1 and the third bit (LRU [2]) distinguishes Way2 and Way3. The 4-way set-associative cache algorithm updating the LRU bits is shown in Table 1.…”
Section: -Way Set-associative Cachementioning
confidence: 99%
“…If the way is Way2 or Way3, LRU [1] will be set to 0. In the case that Way 2 or Way3 is referenced, LRU [2] is set to 1 or 0. The symbol '-' means the value before the update is kept.…”
Section: -Way Set-associative Cachementioning
confidence: 99%
See 2 more Smart Citations