An Alternative Analytical Approach to Associative Processing

被引:2
|
作者
Khoram, Soroosh [1 ]
Zha, Yue [1 ]
Li, Jing [1 ]
机构
[1] Univ Wisconsin, Dept Elect & Comp Engn, 1415 Johnson Dr, Madison, WI 53706 USA
基金
美国国家科学基金会;
关键词
Associative processors; analysis of algorithms and problem complexity; modeling techniques; models of computation;
D O I
10.1109/LCA.2018.2789424
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Associative Processing (AP) is a promising alternative to the Von Neumann model as it addresses the memory wall problem through its inherent in-memory computations. However, because of the countless design parameter choices, comparisons between implementations of two so radically different models are challenging for simulation-based methods. To tackle these challenges, we develop an alternative analytical approach based on a new concept called architecturally-determined complexity. Using this method, we asymptotically evaluate the runtime/storage/energy bounds of the two models, i.e., AP and Von Neumann. We further apply the method to gain more insights into the performance bottlenecks of traditional AP and develop a new machine model named Two Dimensional AP to address these limitations. Finally, we experimentally validate our analytical method and confirm that the simulation results match our theoretical projections.
引用
收藏
页码:113 / 116
页数:4
相关论文
共 50 条