1140 search results - page 36 / 228 » Generating compilers for generated datapaths |
107
click to vote
SC
1991
ACM
15 years 6 months ago
1991
ACM
We present a new approach that enables compiler optimization of procedure calls and loop nests containing procedure calls. We introduce two interprocedural transformationsthat mov...
127
click to vote
PROCEDIA
2010
14 years 9 months ago
2010
We argue that producing maintainable high-performance implementations of finite element methods for multiple targets requires that they are written using a high-level domain-speci...
103
click to vote
GPCE
2005
Springer
15 years 8 months ago
2005
Springer
Saving the internal data of an application in an external form is called marshalling. A generic marshaller is difficult to optimize because the format of the data that will be mars...
131
click to vote
CGO
2003
IEEE
15 years 8 months ago
2003
IEEE
Run-time code generation is a well-known technique for improving the efficiency of programs by exploiting dynamic information. Unfortunately, the difficulty of constructing run-...
120
click to vote
PERCOM
2007
ACM
16 years 2 months ago
2007
ACM
Pervasive computing applications are tedious to develop because they combine a number of problems ranging from device heterogeneity, to middleware constraints, to lack of programm...