Sciweavers

6299 search results - page 13 / 1260
» Data and Computation Abstractions for Dynamic and Irregular ...
Sort
View
LCPC
2005
Springer
14 years 1 months ago
Applying Data Copy to Improve Memory Performance of General Array Computations
Abstract. Data copy is an important compiler optimization which dynamically rearranges the layout of arrays by copying their elements into local buffers. Traditionally, array copy...
Qing Yi
ICPP
1997
IEEE
14 years 19 days ago
Automatic Partitioning of Data and Computations on Scalable Shared Memory Multiprocessors
Abstract—This paper describes an algorithm for deriving data and computation partitions on scalable shared memory multiprocessors. The algorithm establishes affinity relationshi...
Sudarsan Tandri, Tarek S. Abdelrahman
ICIAR
2009
Springer
14 years 3 months ago
Scale Invariant Feature Transform with Irregular Orientation Histogram Binning
The SIFT (Scale Invariant Feature Transform) descriptor is a widely used method for matching image features. However, perfect scale invariance can not be achieved in practice becau...
Yan Cui, Nils Hasler, Thorsten Thormählen, Ha...
ICS
1999
Tsinghua U.
14 years 21 days ago
Improving memory hierarchy performance for irregular applications
The performance of irregular applications on modern computer systems is hurt by the wide gap between CPU and memory speeds because these applications typically underutilize multi-...
John M. Mellor-Crummey, David B. Whalley, Ken Kenn...
PVM
2010
Springer
13 years 6 months ago
Two Algorithms of Irregular Scatter/Gather Operations for Heterogeneous Platforms
Abstract. In this work we present two algorithms of irregular scatter/gather operations based on the binomial tree and Tr¨aff algorithms. We use the prediction provided by hetero...
Kiril Dichev, Vladimir Rychkov, Alexey L. Lastovet...