Sciweavers

179 search results - page 21 / 36
» Compiling Process Graphs into Executable Code
Sort
View
DYNAMO
2000
110views more  DYNAMO 2000»
13 years 11 months ago
Machine-adaptable dynamic binary translation
Dynamic binary translation is the process of translating and optimizing executable code for one machine to another at runtime, while the program is "executing" on the ta...
David Ung, Cristina Cifuentes
COMSIS
2007
128views more  COMSIS 2007»
13 years 9 months ago
Constructing program animations using a pattern-based approach
The aim of this paper is to discuss how our pattern-based strategy for the visualization of data and control flow can effectively be used to animate the program and exhibit its beh...
Daniela Carneiro da Cruz, Pedro Rangel Henriques, ...
ASPLOS
2010
ACM
14 years 4 months ago
MacroSS: macro-SIMDization of streaming applications
SIMD (Single Instruction, Multiple Data) engines are an essential part of the processors in various computing markets, from servers to the embedded domain. Although SIMD-enabled a...
Amir Hormati, Yoonseo Choi, Mark Woh, Manjunath Ku...
ICFP
1997
ACM
14 years 2 months ago
Implementing Bit-addressing with Specialization
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
Scott Draves
CGO
2003
IEEE
14 years 1 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue