Sciweavers

456 search results - page 34 / 92
» Compiler Optimizations for Improving Data Locality
Sort
View
DYNAMO
2000
74views more  DYNAMO 2000»
14 years 11 months ago
A framework for remote dynamic program optimization
Dynamic program optimization allows programs to be generated that are highly tuned for a given environment and input data set. Optimization techniques can be applied and re-applie...
Michael Voss, Rudolf Eigenmann
IASTEDSEA
2004
14 years 11 months ago
Java bytecode verification with dynamic structures
Java applets run on a Virtual Machine that checks code's integrity and correctness before execution using a module called Bytecode Verifier. Java Card technology allows Java ...
Cinzia Bernardeschi, Luca Martini, Paolo Masci
APLAS
2006
ACM
15 years 1 months ago
A Localized Tracing Scheme Applied to Garbage Collection
We present a method to visit all nodes in a forest of data structures while taking into account object placement. We call the technique a Localized Tracing Scheme as it improves lo...
Yannis Chicha, Stephen M. Watt
PDPTA
2000
14 years 11 months ago
Evaluation of Neural and Genetic Algorithms for Synthesizing Parallel Storage Schemes
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
Mayez A. Al-Mouhamed, Husam Abu-Haimed
LCTRTS
2009
Springer
15 years 4 months ago
Eliminating the call stack to save RAM
Most programming languages support a call stack in the programming model and also in the runtime system. We show that for applications targeting low-power embedded microcontroller...
Xuejun Yang, Nathan Cooprider, John Regehr