.png){kind=icon}
返回
A Graphics Parallel Memory Organization Exploiting Request Correlations
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2010.48.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Real-time graphics applications require memory organizations featuring parallel pixel access and low-cost implementation. This work bases on a nonlinear skew mapping scheme and exploits the correlation between consecutive requests for pixels to design an efficient parallel memory organization. The mapping achieves parallel access, of mn pixels in various shapes, to the memory organized with mn banks. The proposed design technique combines the mapping properties and the spatial correlations among pixel requests to eliminate conflicts by spending at most one extra cycle every mn consecutive parallel pixel accesses. Consequently, the technique ensures that any pixel pattern-among these commonly used in graphics-can be accessed in a single cycle from any image location. The address computations become straightforward as the numbers of the requested pixels and the banks-apart from equal-can be powers of 2.
Keyword:
Parallel processing
graphics processors
storage devices
interleaved memories
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
暂无机构信息
引用论文
How Many Cores Does Systematic Prostate Biopsy Need?: A Large‐Sample Retrospective Analysis系统前列腺活检需要多少针取样？：一项大样本回顾性分析
PREAI
分享收藏分享收藏The association of obesity with health insurance coverage and demographic characteristics: a statewide cross-sectional study.png)
Medicine
OAAI
MedicineIF0
OAAI分享收藏分享收藏
查看更多内容