Sciweavers

4355 search results - page 298 / 871
» From Interpretation to Compilation
Sort
View
IPPS
1996
IEEE
15 years 11 months ago
An Adaptive Approach to Data Placement
Programming distributed-memory machines requires careful placement of datato balance the computationalload among the nodes and minimize excess data movement between the nodes. Mos...
David K. Lowenthal, Gregory R. Andrews
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 11 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
AOSD
2007
ACM
15 years 10 months ago
A machine code model for efficient advice dispatch
The primary implementations of AspectJ to date are based on a compile- or load-time weaving process that produces Java byte code. Although this implementation strategy has been cr...
Ryan M. Golbeck, Gregor Kiczales
CASES
2007
ACM
15 years 10 months ago
Lightweight barrier-based parallelization support for non-cache-coherent MPSoC platforms
Many MPSoC applications are loop-intensive and amenable to automatic parallelization with suitable compiler support. One of the key components of any compiler-parallelized code is...
Andrea Marongiu, Luca Benini, Mahmut T. Kandemir
ESTIMEDIA
2007
Springer
15 years 10 months ago
Still Image Processing on Coarse-Grained Reconfigurable Array Architectures
Due to the increasing demands on efficiency, performance and flexibility reconfigurable computational architectures are very promising candidates in embedded systems design. Recent...
Matthias Hartmann, Vasileios (Vassilis) Pantazis, ...