Proceedings 20th IEEE International Parallel &Amp; Distributed Processing Symposium 2006
DOI: 10.1109/ipdps.2006.1639433
|View full text |Cite
|
Sign up to set email alerts
|

A cost-effective context memory structure for dynamically reconfigurable processors

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 9 publications
0
5
0
Order By: Relevance
“…Compression techniques are a classic method that can alleviate memory bandwidth bottlenecks [145][146][147]. These works mainly compress the configuration binaries sent to CGRAs offline with common compression algorithms, e.g., Run Length coding, Huffman coding, arithmetic coding and LZSS coding.…”
Section: Trend 4: Efficient Memory Systemmentioning
confidence: 99%
“…Compression techniques are a classic method that can alleviate memory bandwidth bottlenecks [145][146][147]. These works mainly compress the configuration binaries sent to CGRAs offline with common compression algorithms, e.g., Run Length coding, Huffman coding, arithmetic coding and LZSS coding.…”
Section: Trend 4: Efficient Memory Systemmentioning
confidence: 99%
“…For a decade, many dynamically reconfigurable architectures have been developed but only a few can be considered as multi-context architectures, as they locally store one or more parallel contexts. NEC-DRP [7] is a massively parallel processor architecture. Reconfiguration processes are managed by a central manager which can select one futur context from 16 multi-contextmemories.…”
Section: Related Workmentioning
confidence: 99%
“…In the hybrid one, while a part of the contexts are statically reconfigurable, the others are dynamically reconfigurable, like RaPiD. From a context size perspective, evolution of the configuration has taken place over three periods along with the increasing complexity of applications: singlecontext [18,19], multi-context [20][21][22], and configuration cache [12,23]. The number of operations in computational kernels is smaller, several times larger and many times larger than the dimension of the array in the three periods respectively.…”
Section: Introductionmentioning
confidence: 99%