Sciweavers

456 search results - page 22 / 92
» Compiler Optimizations for Improving Data Locality
Sort
View
ASPLOS
1998
ACM
15 years 1 months ago
Cache-Conscious Data Placement
As the gap between memory and processor speeds continues to widen, cache efficiency is an increasingly important component of processor performance. Compiler techniques have been...
Brad Calder, Chandra Krintz, Simmi John, Todd M. A...
CF
2010
ACM
15 years 2 months ago
ERBIUM: a deterministic, concurrent intermediate representation for portable and scalable performance
Tuning applications for multi-core systems involve subtle concepts and target-dependent optimizations. New languages are being designed to express concurrency and locality without...
Cupertino Miranda, Philippe Dumont, Albert Cohen, ...
ISCI
2008
102views more  ISCI 2008»
14 years 9 months ago
Random walk biclustering for microarray data
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...
Fabrizio Angiulli, Eugenio Cesario, Clara Pizzuti
CASES
2007
ACM
15 years 1 months ago
A simplified java bytecode compilation system for resource-constrained embedded processors
Embedded platforms are resource-constrained systems in which performance and memory requirements of executed code are of critical importance. However, standard techniques such as ...
Carmen Badea, Alexandru Nicolau, Alexander V. Veid...
COMCOM
2006
78views more  COMCOM 2006»
14 years 9 months ago
Performance optimization of an adaptive wireless push system in environments with locality of demand
In many data broadcasting applications clients are grouped into several groups, each one located at a different region, with the members of each group having similar demands. This...
Petros Nicopolitidis, Georgios I. Papadimitriou, M...