179 search results - page 7 / 36 » Compiling Process Graphs into Executable Code |
CC
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. This paper presents the design, implementation and experimental evaluation of a practical region-based partial dead code elimination (PDE) algorithm on predicated code in...
EMSOFT
2010
Springer
13 years 7 months ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
APPINF
2003
13 years 11 months ago
2003
Whenever large homogeneous data structures need to be processed in a non-trivial way, e.g. in computational sciences, image processing, or system simulation, high-level array prog...
PDCAT
2007
Springer
14 years 4 months ago
2007
Springer
We present the architecture of nreduce, a distributed virtual machine which uses parallel graph reduction to run programs across a set of computers. It executes code written in a ...
SAC
2006
ACM
14 years 3 months ago
2006
ACM
Dynamic languages typically allow programs to be written y high level of abstraction. But their dynamic nature makes it very hard to compile such languages, meaning that a price h...