Yanqi Zhou

Yanqi Zhou

Auto-generated profile, based on publicly available information

Yanqi Zhou

Google Deepmind, Mountain View, USA

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
25 March 2016 in ACM SIGARCH Computer Architecture News
Verified
Journal Article
Open access
JBJonathan Balkind
Jonathan Balkind
MMMichael McKeown
Michael McKeown
YFYaosheng Fu
Yaosheng Fu
TNTri Nguyen
Tri Nguyen
YZYanqi Zhou
Yanqi Zhou
DWDavid Wentzlaff
David Wentzlaff
Industry is building larger, more complex, manycore processors on the back of strong institutional knowledge, but academic projects face difficulties in replicating that scale. To alleviate these difficulties and to develop and share knowledge, the community needs open architecture frameworks for simulation, synthesis, and software exploration which support extensibility, scalability, and configurability, alongside an established base of verification tools and supported software. In this paper we present OpenPiton, an open source framework for building scalable architecture research prototypes from 1 core to 500 million cores. OpenPiton is the world's first open source, general-purpose, multithreaded manycore processor and framework. OpenPiton leverages the industry hardened OpenSPARC T1 core with modifications and builds upon it with a scratch-built, scalable uncore creating a flexible, modern manycore design. In addition, OpenPiton provides synthesis and backend scripts for ASIC and FPGA to enable other researchers to bring their designs to implementation. OpenPiton provides a complete verification infrastructure of over 8000 tests, is supported by mature software tools, runs full-stack multiuser Debian Linux, and is written in industry standard Verilog. Multiple implementations of OpenPiton have been created including a taped-out 25-core implementation in IBM's 32nm process and multiple Xilinx FPGA prototypes.

9 April 2025 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
AGAhan Gupta
Ahan Gupta
YYYueming Yuan
Yueming Yuan
DJDevansh Jain
Devansh Jain
YGYuhao Ge
Yuhao Ge
DADavid Aponte
David Aponte
CMCharith Mendis
Charith Mendis
Multi-head-self-attention (MHSA) mechanisms achieve state-of-the-art (SOTA) performance across natural language processing and vision tasks. However, their quadratic dependence on sequence lengths has bottlenecked inference speeds. To circumvent this bottleneck, researchers have proposed various sparse-MHSA models, where a subset of full attention is computed. Despite their promise, current sparse libraries and compilers do not support high-performance implementations for diverse sparse-MHSA patterns due to the underlying sparse formats they operate on. On one end, sparse libraries operate on general sparse formats which target extreme amounts of random sparsity (<10% non-zero values) and have high metadata in O ( nnzs ). On the other end, hand-written kernels operate on custom sparse formats which target specific sparse-MHSA patterns. However, the sparsity patterns in sparse-MHSA are moderately sparse (10-50% non-zero values) and varied, resulting in general sparse formats incurring high metadata overhead and custom sparse formats covering few sparse-MSHA patterns, trading off generality for performance. We bridge this gap, achieving both generality and performance, by proposing a novel sparse format: affine-compressed-sparse-row (ACSR) and supporting code-generation scheme, SPLAT, that generates high-performance implementations for diverse sparse-MHSA patterns on GPUs. Core to our proposed format and code generation algorithm is the observation that common sparse-MHSA patterns have uniquely regular geometric properties. These properties, which can be analyzed just-in-time, expose novel optimizations and tiling strategies that SPLAT exploits to generate high-performance implementations for diverse patterns. To demonstrate SPLAT’s efficacy, we use it to generate code for various sparse-MHSA models, achieving speedups of up-to 2.05x and 4.05x over hand-written kernels written in triton and TVM respectively on A100 GPUs in single-precision.

12 October 2025
Verified
Conference Paper
Open access
YYYifan Yu
Yifan Yu
YGYu Gan
Yu Gan
NSNikhil Sarda
Nikhil Sarda
LTLillian Tsai
Lillian Tsai
JSJiaming Shen
Jiaming Shen
DCDavid Culler
David Culler

24 February 2014 in ACM SIGARCH Computer Architecture News
Verified
Journal Article
Open access
YZYanqi Zhou
Yanqi Zhou
DWDavid Wentzlaff
David Wentzlaff
Businesses and Academics are increasingly turning to Infrastructure as a Service (IaaS) Clouds such as Amazon's Elastic Compute Cloud (EC2) to fulfill their computing needs. Unfortunately, current IaaS systems provide a severely restricted pallet of rentable computing options which do not optimally fit the workloads that they are executing. We address this challenge by proposing and evaluating a manycore architecture, called the Sharing Architecture, specifically optimized for IaaS systems by being reconfigurable on a sub-core basis. The Sharing Architecture enables better matching of workload to micro-architecture resources by replacing static cores with Virtual Cores which can be dynamically reconfigured to have different numbers of ALUs and amount of Cache. This reconfigurability enables many of the same benefits of heterogeneous multicores, but in a homogeneous fabric, and enables the reuse and resale of resources on a per ALU or per KB of cache basis. The Sharing Architecture leverages Distributed ILP techniques, but is designed in a way to be independent of recompilation. In addition, we introduce an economic model which is enabled by the Sharing Architecture and show how different users who have varying needs can be better served by such a flexible architecture. We evaluate the Sharing Architecture across a benchmark suite of Apache, SPECint, and parts of PARSEC, and find that it can achieve up to a 5x more economically efficient market when compared to static architecture multicores. We implemented the Sharing Architecture in Verilog and present area overhead results.

13 October 2021
Verified
Conference Paper
Closed access
XSXiaomeng Song
Xiaomeng Song
MSMengna Shi
Mengna Shi
YZYanqi Zhou
Yanqi Zhou
EWErfu Wang
Erfu Wang
This article proposed a block image encryption scheme based on reversible cellular automata (RCA) and chaotic systems in order to construct an image encryption scheme with great confidentiality effect and high encryption and decryption efficiency. In the preparation phase of this algorithm, the original image is transformed into the frequency domain using the method of integer wavelet transform (IWT). The IWT divides the plaintext image into four frequency blocks. The low-frequency image block containing critical information is treated differently from other high-frequency image blocks in the following procedure. In order to avoid direct processing of image blocks with visual significance, a combined one-dimensional chaotic map is used to rearrange the pixel positions within the image blocks respectively. The chaotic map is then used to acquire various RCA rules and iterations. According to the different importance of the information stored in the image block, the RCA evolution of the image block is carried out with different rules and different iteration times. Finally, the image is scrambled and diffused around the whole image to reduce the blocking effect. The algorithm blocks the images according to different importance and encrypts them at different levels. Avoiding the waste of time and resources caused by the same operation on the whole image.