3836 search results - page 284 / 768 » Optimizing the Use of High Performance Software Libraries |
145
Voted
CORR
2006
Springer
15 years 4 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
121
click to vote
DAGM
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we present a new method for self-localization on wafers using geometric hashing. The proposed technique is robust to image changes induced by process variations, as o...
118
click to vote
HPCA
2006
IEEE
16 years 5 months ago
2006
IEEE
Transactional memory (TM) simplifies parallel programming by guaranteeing that transactions appear to execute atomically and in isolation. Implementing these properties includes p...
124
click to vote
ASPLOS
2008
ACM
15 years 6 months ago
2008
ACM
Many code analysis techniques for optimization, debugging, or parallelization need to perform runtime disambiguation of sets of addresses. Such operations can be supported efficie...
108
click to vote
CGO
2006
IEEE
15 years 11 months ago
2006
IEEE
Dynamic optimization relies on phase detection for two important functions (1) To detect change in code working set and (2) To detect change in performance characteristics that ca...