Sciweavers

1821 search results - page 281 / 365
» Security-Aware Program Transformations
Sort
View
ICS
1992
Tsinghua U.
14 years 2 months ago
Optimizing for parallelism and data locality
Previous research has used program transformation to introduce parallelism and to exploit data locality. Unfortunately,these twoobjectives have usuallybeen considered independentl...
Ken Kennedy, Kathryn S. McKinley
DLS
2007
138views Languages» more  DLS 2007»
14 years 2 months ago
OMeta: an object-oriented language for pattern matching
This paper introduces OMeta, a new object-oriented language for pattern matching. OMeta is based on a variant of Parsing Expression Grammars (PEGs) [5]--a recognitionbased foundat...
Alessandro Warth, Ian Piumarta
RTA
2010
Springer
14 years 1 months ago
Simulation in the Call-by-Need Lambda-Calculus with letrec
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-nee...
Manfred Schmidt-Schauß, David Sabel, Elena M...
FPL
2009
Springer
132views Hardware» more  FPL 2009»
14 years 1 months ago
Binary Synthesis with multiple memory banks targeting array references
High-Level Synthesis (HLS) is the field of transforming a high-level programming language, such as C, into a register transfer level(RTL) description of the design. In HLS, Binary...
Yosi Ben-Asher, Nadav Rotem
ICASSP
2009
IEEE
14 years 1 months ago
Generating high performance pruned FFT implementations
We derive a recursive general-radix pruned Cooley-Tukey fast Fourier transform (FFT) algorithm in Kronecker product notation. The algorithm is compatible with vectorization and pa...
Franz Franchetti, Markus Püschel