Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chenyang Yin

dblp:277/3048 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 since 2021Computer networks · 2 · 1 first-author · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Reconfigurable computing and FPGAs · 50% Hardware accelerators and domain-specific architectures · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs
coarse-grained reconfigurable architecture
0.912025
Enhancing CGRA Efficiency Through Aligned Compute and Communication Provisioning · ASPLOS (1) 2025
Hardware accelerators and domain-specific architectures
edge accelerator
0.912025
Enhancing CGRA Efficiency Through Aligned Compute and Communication Provisioning · ASPLOS (1) 2025
YearPublicationVenuePosition
2025 Enhancing CGRA Efficiency Through Aligned Compute and Communication Provisioning
abstract
Coarse-grained Reconfigurable Arrays (CGRAs) are domain-agnostic accelerators that enhance the energy efficiency of resource-constrained edge devices. The CGRA landscape is diverse, exhibiting trade-offs between performance, efficiency, and architectural specialization. However, CGRAs often overprovision communication resources relative to their modest computing capabilities. This occurs because the theoretically provisioned programmability for CGRAs often proves superfluous in practical implementations.
Zhaoying Li 0004, Pranav Dangi, Chenyang Yin, Thilini Kaushalya Bandara, Rohan Juneja, Cheng Tan 0002, Zhenyu Bai, Tulika Mitra
ASPLOS (1)3
2025 Towards Self-Explainable Information Cascade Popularity Prediction
Yang Liu 0245, Zhangtao Cheng, Chenyang Yin, Yichen Xin, Zhonghai He, Fan Zhou 0002
ICC3
2024 OriGen: Enhancing RTL Code Generation with Code-to-Code Augmentation and Self-Reflection
abstract
Recent studies have demonstrated the significant potential of Large Language Models (LLMs) in generating Register Transfer Level (RTL) code, with notable advancements showcased by commercial models such as GPT-4 and Claude3-Opus. However, these proprietary LLMs often raise concerns regarding privacy and security. While open-source LLMs offer solutions to these concerns, they typically underperform commercial models in RTL code generation tasks, primarily due to the scarcity of high-quality open-source RTL datasets. To address this challenge, we introduce OriGen, a fully open-source framework that incorporates self-reflection capabilities and a novel dataset augmentation methodology for generating high-quality, large-scale RTL code. Our approach employs a code-to-code augmentation technique to enhance the quality of open-source RTL code datasets. Furthermore, OriGen can rectify syntactic errors through a self-reflection process that leverages compiler feedback.
Fan Cui, Chenyang Yin, Kexing Zhou, Youwei Xiao, Guangyu Sun 0003, Qiang Xu 0001, Qipeng Guo, Yun Liang 0001, Xingcheng Zhang, Demin Song, Dahua Lin
ICCAD2
2022 ADSA: A Multi-path Transmission Scheduling Algorithm based on Deep Reinforcement Learning in Vehicle Networks
abstract
Cognitive Radio (CR) enabled vehicles in Vehicle Networks can use multiple Radio Access Networks (RANs) for data transmission. The simultaneous use of multiple RANs for transmission requires the design of a specific multi-path transmission protocol. Many scholars have studied the scheduling algorithm to improve the quality of multi-path transmission. However, most of the existing scheduling algorithms are difficult to deal with the challenges brought by the diversity and heterogeneity of the vehicle network. To deal with these challenges, this paper proposes an IP layer Deep Reinforcement Learning (DRL) multi-path transmission scheduling algorithm named Adaptive Dynamic Scheduling Algorithm (ADSA), which can dynamically generate the optimal scheduling policy through the interaction between agent and network environment. This paper first models the data packet scheduling strategy of multi-path transmission into an optimization problem of multi-path transmission efficiency. Then this paper transforms the optimization problem into a DRL problem and finds the optimal scheduling strategy through DRL model training. This paper evaluates the network performance of ADSA in different network scenarios compared with traditional scheduling algorithms. Simulation results show that ADSA increases the throughput by 8.9 Mbps compared with the three traditional scheduling algorithms and reduces the transmission delay by 4.3 ms.
Chenyang Yin, Xiaojiang Du, Hongke Zhang
ICC1