TY - GEN
T1 - Cocoa
T2 - 30th Great Lakes Symposium on VLSI, GLSVLSI 2020
AU - Xia, Tian
AU - Zong, Pengchen
AU - Zhao, Haoran
AU - Tong, Jianming
AU - Zhao, Wenzhe
AU - Zheng, Nanning
AU - Ren, Pengju
N1 - Publisher Copyright:
© 2020 Association for Computing Machinery.
PY - 2020/9/7
Y1 - 2020/9/7
N2 - In domain of parallel computation, most works focus on optimizing PE organization or memory hierarchy to pursue the maximum efficiency, while the importance of data contents has been overlooked for a long time. Actually for structured data, insights on data contents (i.e. values and locations within a structured form) can greatly benefit the computation performance, as fine-grained data manipulation can be performed. In this paper, we claim that by providing a flexible and adaptive data path, an efficient architecture with capability of fine-grained data manipulation can be built. Specifically, we propose COCOA, a novel content-oriented configurable architecture, which integrates multi-functional data reorganization networks in traditional computing scheme to handle the contents of data during the transmission path, so that they can be processed more efficiently. We evaluate COCOA on various problems: complex matrix algorithm (matrix inversion) and sparse DNN. The results indicates that COCOA is versatile enough to achieve high computation efficiency in both cases.
AB - In domain of parallel computation, most works focus on optimizing PE organization or memory hierarchy to pursue the maximum efficiency, while the importance of data contents has been overlooked for a long time. Actually for structured data, insights on data contents (i.e. values and locations within a structured form) can greatly benefit the computation performance, as fine-grained data manipulation can be performed. In this paper, we claim that by providing a flexible and adaptive data path, an efficient architecture with capability of fine-grained data manipulation can be built. Specifically, we propose COCOA, a novel content-oriented configurable architecture, which integrates multi-functional data reorganization networks in traditional computing scheme to handle the contents of data during the transmission path, so that they can be processed more efficiently. We evaluate COCOA on various problems: complex matrix algorithm (matrix inversion) and sparse DNN. The results indicates that COCOA is versatile enough to achieve high computation efficiency in both cases.
KW - Computing Architecture
KW - Data Reorgonization
KW - Hiph-performance Computing
KW - Transmission Network
UR - https://www.scopus.com/pages/publications/85091293445
U2 - 10.1145/3386263.3406924
DO - 10.1145/3386263.3406924
M3 - 会议稿件
AN - SCOPUS:85091293445
T3 - Proceedings of the ACM Great Lakes Symposium on VLSI, GLSVLSI
SP - 253
EP - 258
BT - GLSVLSI 2020 - Proceedings of the 2020 Great Lakes Symposium on VLSI
PB - Association for Computing Machinery
Y2 - 7 September 2020 through 9 September 2020
ER -