Sciweavers

500 search results - page 43 / 100
» Compiling SA-C Programs to FPGAs: Performance Results
Sort
View
PEPM
2011
ACM
14 years 7 months ago
Allocation removal by partial evaluation in a tracing JIT
The performance of many dynamic language implementations suffers from high allocation rates and runtime type checks. This makes dynamic languages less applicable to purely algorit...
Carl Friedrich Bolz, Antonio Cuni, Maciej FijaBkow...
ICS
2001
Tsinghua U.
15 years 8 months ago
Global optimization techniques for automatic parallelization of hybrid applications
This paper presents a novel technique to perform global optimization of communication and preprocessing calls in the presence of array accesses with arbitrary subscripts. Our sche...
Dhruva R. Chakrabarti, Prithviraj Banerjee
LOPSTR
2005
Springer
15 years 9 months ago
An Algorithm for Local Variable Elimination in Normal Logic Programs
A variable is local if it occurs in a clause body but not in its head. Local variables appear naturally in practical logic programming, but they complicate several aspects such as ...
Javier Álvez, Paqui Lucio
SC
2000
ACM
15 years 7 months ago
Tiling Optimizations for 3D Scientific Computations
Compiler transformations can significantly improve data locality for many scientific programs. In this paper, we show iterative solvers for partial differential equations (PDEs) i...
Gabriel Rivera, Chau-Wen Tseng
PEPM
2009
ACM
16 years 1 months ago
Program interpolation
Program interpolation is a new type of transformation that given an input program written in a specially constructed Domain Specific Language (DSL), produces a family of function...
Andrew Moss, Dan Page