2002
DOI: 10.1007/3-540-46117-5_89
|View full text |Cite
|
Sign up to set email alerts
|

XPP-VC: A C Compiler with Temporal Partitioning for the PACT-XPP Architecture

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
36
0
2

Year Published

2005
2005
2016
2016

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 30 publications
(38 citation statements)
references
References 3 publications
0
36
0
2
Order By: Relevance
“…Another benefit of using a coarse-grained architecture is the reduced configuration data size and hence reduced reconfiguration latency which can allow faster context switching. Because of this apparent advantage, researchers have explored a number of ASIC implementations of coarse-grained reconfigurable architectures (CGRAs) [17], [18], [19], [20], [21], [22], [23], [24], [25]. Some key features that enabled these architectures to address signal processing and high performance computing problems more efficiently include: energy efficiency, ease of programming, fast compilation and reconfiguration.…”
Section: Coarse-grained Reconfigurable Devicesmentioning
confidence: 99%
“…Another benefit of using a coarse-grained architecture is the reduced configuration data size and hence reduced reconfiguration latency which can allow faster context switching. Because of this apparent advantage, researchers have explored a number of ASIC implementations of coarse-grained reconfigurable architectures (CGRAs) [17], [18], [19], [20], [21], [22], [23], [24], [25]. Some key features that enabled these architectures to address signal processing and high performance computing problems more efficiently include: energy efficiency, ease of programming, fast compilation and reconfiguration.…”
Section: Coarse-grained Reconfigurable Devicesmentioning
confidence: 99%
“…An alternative approach is loop disserving, described in [32] as applied to the PACT-XPP CGRA, in which the underlying hardware is reconfigured inside loop bodies as many times at each kernel iteration. Loop disserving does not need temporary arrays to store intermediate data, but presents a much higher configuration overhead.…”
Section: Partitioning Of Computational Kernelsmentioning
confidence: 99%
“…Typically the applications which belong to the application domain of CGRAs are characterized by high data transfer rate between the processor and the memory. Only a few approaches ( [4], [6], [7], [8], and [9]) have been followed to tackle the problem of the limited memory bandwidth in CGRAs for exploiting the hardware parallelism.…”
Section: Related Workmentioning
confidence: 99%
“…A series of vertical and horizontal buses establish communication among the PEs while for storing the intermediate data values shared memory banks exist on the left and the right side of each array's row. To reduce the number of memory accesses, the compiler [7] only reads one element per iteration and generates shift registers to store the data reuse values when array references inside loops read subsequent element positions.…”
Section: Related Workmentioning
confidence: 99%