Yunji Chen

Yunji Chen

Auto-generated profile, based on publicly available information

Yunji Chen

State Key Lab of Processors, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 May 2016 in IEEE Transactions on Computers
Verified
Journal Article
Open access
TLTao Luo
Tao Luo
SLShaoli Liu
Shaoli Liu
LLLing Li
Ling Li
YWYuqing Wang
Yuqing Wang
SZShijin Zhang
Shijin Zhang
YCYunji Chen
Yunji Chen
Many companies are deploying services largely based on machine-learning algorithms for sophisticated processing of large amounts of data, either for consumers or industry. The state-of-the-art and most popular such machine-learning algorithms are Convolutional and Deep Neural Networks (CNNs and DNNs), which are known to be computationally and memory intensive. A number of neural network accelerators have been recently proposed which can offer high computational capacity/area ratio, but which remain hampered by memory accesses. However, unlike the memory wall faced by processors on general-purpose workloads, the CNNs and DNNs memory footprint, while large, is not beyond the capability of the on-chip storage of a multi-chip system. This property, combined with the CNN/DNN algorithmic characteristics, can lead to high internal bandwidth and low external communications, which can in turn enable high-degree parallelism at a reasonable area cost. In this article, we introduce a custom multi-chip machine-learning architecture along those lines, and evaluate performance by integrating electrical and optical inter-chip interconnects separately. We show that, on a subset of the largest known neural network layers, it is possible to achieve a speedup of 656.63× over a GPU, and reduce the energy by 184.05× on average for a 64-chip system. We implement the node down to the place and route at 28 nm, containing a combination of custom storage and computational units, with electrical inter-chip interconnects.

17 July 2019 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
LZLei Zhang
Lei Zhang
SZShengyuan Zhou
Shengyuan Zhou
TZTian Zhi
Tian Zhi
ZDZidong Du
Zidong Du
YCYunji Chen
Yunji Chen
Continuous-valued deep convolutional networks (DNNs) can be converted into accurate rate-coding based spike neural networks (SNNs). However, the substantial computational and energy costs, which is caused by multiple spikes, limit their use in mobile and embedded applications. And recent works have shown that the newly emerged temporal-coding based SNNs converted from DNNs can reduce the computational load effectively. In this paper, we propose a novel method to convert DNNs to temporal-coding SNNs, called TDSNN. Combined with the characteristic of the leaky integrate-andfire (LIF) neural model, we put forward a new coding principle Reverse Coding and design a novel Ticking Neuron mechanism. According to our evaluation, our proposed method achieves 42% total operations reduction on average in large networks comparing with DNNs with no more than 0.5% accuracy loss. The evaluation shows that TDSNN may prove to be one of the key enablers to make the adoption of SNNs widespread.

18 January 2021 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
XSXinkai Song
Xinkai Song
TZTian Zhi
Tian Zhi
ZFZhe Fan
Zhe Fan
ZZZhenxing Zhang
Zhenxing Zhang
XZXi Zeng
Xi Zeng
YCYunji Chen
Yunji Chen
Graph neural networks (GNNs), which extend traditional neural networks for processing graph-structured data, have been widely used in many fields. The GNN computation mainly consists of the edge processing to generate messages by combining the edge/vertex features and the vertex processing to update the vertex features with aggregated messages. In addition to nontrivial vector operations in the edge processing, huge random accesses and neural network operations in the vertex processing, the graph topology of GNNs may also vary during the computation (i.e., dynamic GNNs). The above characteristics pose significant challenges on existing architectures. In this article, we propose a novel accelerator named CAMBRICON-G for efficient processing of both dynamic and static GNNs. The key of CAMBRICON-G is to abstract the irregular computation of a broad range of GNN variants to the process of regularly tiled adjacent cuboid (which extends the traditional adjacent matrix of graph by adding the dimension of vertex features). The intuition is that the adjacent cuboid facilitates exploitation of both data locality and parallelism by offering multidimensional multilevel tiling (including spatial and temporal tiling) opportunities. To perform the multidimensional spatial tiling , the CAMBRICON-G architecture mainly consists of the cuboid engine (CE) and hybrid on-chip memory. The CE has multiple vertex processing units (VPUs) working in a coordinated manner to efficiently process the sparse data and dynamically update the graph topology with dedicated instructions. The hybrid on-chip memory contains the topology-aware cache and multiple scratchpad memory to reduce off-chip memory access. To perform the multidimensional temporal tiling , an easy-to-use programming model is provided to flexibly explore different tiling options for large graphs. Experimental results show that compared against Nvidia P100 GPU, the performance and energy efficiency can be improved by $7.14\times $ and $20.18\times $ , respectively, on various GNNs, which validates both the versatility and energy efficiency of CAMBRICON-G.

13 May 2015 in IEEE Micro
Verified
Journal Article
Closed access
TCTianshi Chen
Tianshi Chen
ZDZidong Du
Zidong Du
NSNinghui Sun
Ninghui Sun
JWJia Wang
Jia Wang
CWChengyong Wu
Chengyong Wu
OTOlivier Temam
Olivier Temam
The authors designed an accelerator architecture for large-scale neural networks, with an emphasis on the impact of memory on accelerator design, performance, and energy. In this article, they present a concrete design at 65 nm that can perform 496 16-bit fixed-point operations in parallel every 1.02 ns, that is, 452 gop/s, in a 3.02mm2, 485-mw footprint (excluding main memory accesses).

18 April 2016 in Frontiers of Computer Science
Verified
Journal Article
Closed access
PDF file
YWYue Wu
Yue Wu
CLChao Lu
Chao Lu
YCYunji Chen
Yunji Chen

1 January 2025 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
ZZZhen-Xing Zhang
Zhen-Xing Zhang
YWYuan-Bo Wen
Yuan-Bo Wen
HLHan-Qi Lyu
Han-Qi Lyu
CLChang Liu
Chang Liu
RZRui Zhang
Rui Zhang
YCYun-Ji Chen
Yun-Ji Chen