.png){kind=icon}
Return
Optimal cache usage for separable image processing algorithms on general purpose workstations
.png){kind=icon}
PRE
AI
DOI：10.1016/S0165-1684(97)00041-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Modern workstations are equipped with fast cache memory to enable the CPU to access the relatively slow main memory without noticeable delay. However, two typical cache characteristics (limited associativeness and power of two based memory address mapping on cache lines) cause the complete class of separable image processing algorithms to give the worst possible performance regarding data cache utilization on large images. We present three methods based on transposing the image to improve the data cache usage for both write-through and write-back caches. Experiments with a 3 x 3 uniform filter and the fast Fourier transform performed on a range of Sun workstations show that the proposed methods improve the performance considerably. (C) 1997 Elsevier Science B.V.
Keywords:
memory hierarchy
cache
fast Fourier transform
separable image processing
general purpose workstations
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
10.0K
Citations:
1.7W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave