Sciweavers

456 search results - page 56 / 92
» Compiler Optimizations for Improving Data Locality
Sort
View
IEEEPACT
2000
IEEE
15 years 2 months ago
A Lightweight Algorithm for Dynamic If-Conversion during Dynamic Optimization
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
Kim M. Hazelwood, Thomas M. Conte
PPOPP
2009
ACM
15 years 10 months ago
Mapping parallelism to multi-cores: a machine learning based approach
The efficient mapping of program parallelism to multi-core processors is highly dependent on the underlying architecture. This paper proposes a portable and automatic compiler-bas...
Zheng Wang, Michael F. P. O'Boyle
PR
2006
164views more  PR 2006»
14 years 9 months ago
Locally linear metric adaptation with application to semi-supervised clustering and image retrieval
Many computer vision and pattern recognition algorithms are very sensitive to the choice of an appropriate distance metric. Some recent research sought to address a variant of the...
Hong Chang, Dit-Yan Yeung
LCPC
2009
Springer
15 years 2 months ago
Speculative Optimizations for Parallel Programs on Multicores
The advent of multicores presents a promising opportunity for exploiting fine grained parallelism present in programs. Programs parallelized in the above fashion, typically involv...
Vijay Nagarajan, Rajiv Gupta
SERVICES
2008
103views more  SERVICES 2008»
14 years 11 months ago
Grouping Distributed Stream Query Services by Operator Similarity and Network Locality
Distributed stream query services must simultaneously process a large number of complex, continuous queries with stringent performance requirements while utilizing distributed pro...
Sangeetha Seshadri, Bhuvan Bamba, Brian F. Cooper,...