Demo Data from EDBT 2026 / reviewers in the wild / expert
Xiangyu Zhang 0011
dblp:95/3760-11
· DBLP profile ↗
3ranked-venue papers
2as first author
1since 2021 · last 2021
0000-0002-9820-1331ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 2 first-author · 1 since 2021Software engineering, systems software and programming languages · 3 · 2 first-author · 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
3 papers |
Hardware accelerators and domain-specific architectures · 41% Emerging computing paradigms · 32% Performance modeling and evaluation · 27% | |
| Artificial intelligence
3 papers |
Probabilistic and Bayesian machine learning · 100% |
Topics — the 6 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Emerging computing paradigms › approximate and stochastic computing
stochastic computing |
0.6 | 2 | 2018 | Architecting a Stochastic Computing Unit with Molecular Optical Devices · ISCA 2018 Accelerating Markov Random Field Inference Using Molecular Optical Gibbs Sampling Units · ISCA 2016 |
Performance modeling and evaluation › benchmarking › computer architecture benchmarking
accelerator benchmarking |
0.5 | 1 | 2021 | Statistical robustness of Markov chain Monte Carlo accelerators · ASPLOS 2021 |
Hardware accelerators and domain-specific architectures › scientific computing accelerator
MCMC accelerator |
0.5 | 1 | 2021 | Statistical robustness of Markov chain Monte Carlo accelerators · ASPLOS 2021 |
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods
markov chain monte carlo |
0.2 | 2 | 2021 | Statistical robustness of Markov chain Monte Carlo accelerators · ASPLOS 2021 Architecting a Stochastic Computing Unit with Molecular Optical Devices · ISCA 2018 |
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods › markov chain monte carlo
gibbs sampling |
0.1 | 1 | 2018 | Architecting a Stochastic Computing Unit with Molecular Optical Devices · ISCA 2018 |
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
markov random field inference |
0.1 | 1 | 2016 | Accelerating Markov Random Field Inference Using Molecular Optical Gibbs Sampling Units · ISCA 2016 |
Methods — techniques the papers use, named apart from their topics
markov chain monte carlo · 1.7approximation techniques · 1.0gibbs sampling · 0.7optical gibbs sampling · 0.5emulation-based evaluation · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Statistical robustness of Markov chain Monte Carlo acceleratorsabstractStatistical machine learning often uses probabilistic models and algorithms, such as Markov Chain Monte Carlo (MCMC), to solve a wide range of problems. Probabilistic computations, often considered too slow on conventional processors, can be accelerated with specialized hardware by exploiting parallelism and optimizing the design using various approximation techniques. Current methodologies for evaluating correctness of probabilistic accelerators are often incomplete, mostly focusing only on end-point result quality ("accuracy"). It is important for hardware designers and domain experts to look beyond end-point "accuracy" and be aware of how hardware optimizations impact statistical properties. Xiangyu Zhang 0011, Ramin Bashizade, Sayan Mukherjee 0001, Alvin R. Lebeck |
ASPLOS | 1 |
| 2018 | Architecting a Stochastic Computing Unit with Molecular Optical DevicesabstractThe increasing difficulty in leveraging CMOS scaling for improved performance requires exploring alternative technologies. A promising technique is to exploit the physical properties of devices to specialize certain computations. A recently proposed approach uses molecular-scale optical devices to construct a Resonance Energy based Sampling Unit (RSU) to accelerate sampling from parameterized probability distributions. Sampling is an important component of many algorithms, including statistical machine learning. This paper explores the relationship between application result quality and RSU design. The previously proposed RSU-G focuses on Gibbs sampling using Markov Chain Monte Carlo (MCMC) solvers for Markov Random Field (MRF) Bayesian Inference. By quantitatively analyzing the result quality across three computer vision applications, we find that the previously proposed RSU-G lacks both sufficient precision and dynamic range in key design parameters, which limits the overall result quality compared to software-only MCMC implementations. Naively scaling the problematic parameters to increase precision and dynamic range consumes too much area and power. Therefore, we introduce a new RSU-G microarchitecture that exploits an alternative approach to increase precision that incurs 1.27x power and equivalent area, while maintaining the significant speedups of the previous design and supporting a wider set of applications. Xiangyu Zhang 0011, Ramin Bashizade, Craig LaBoda, Chris Dwyer, Alvin R. Lebeck |
ISCA | 1 |
| 2016 | Accelerating Markov Random Field Inference Using Molecular Optical Gibbs Sampling UnitsabstractThe increasing use of probabilistic algorithms from statistics and machine learning for data analytics presents new challenges and opportunities for the design of computing systems. One important class of probabilistic machine learning algorithms is Markov Chain Monte Carlo (MCMC) sampling, which can be used on a wide variety of applications in Bayesian Inference. However, this probabilistic iterative algorithm can be inefficient in practice on today's processors, especially for problems with high dimensionality and complex structure. The source of inefficiency is generating samples from parameterized probability distributions. This paper seeks to address this sampling inefficiency and presents a new approach to support probabilistic computing that leverages the native randomness of Resonance Energy Transfer (RET) networks to construct RET-based sampling units (RSU). Although RSUs can be designed for a variety of applications, we focus on the specific class of probabilistic problems described as Markov Random Field Inference. Our proposed RSU uses a RET network to implement a molecular-scale optical Gibbs sampling unit (RSU-G) that can be integrated into a processor / GPU as specialized functional units or organized as a discrete accelerator. We experimentally demonstrate the fundamental operation of an RSU using a macro-scale hardware prototype. Emulation-based evaluation of two computer vision applications for HD images reveal that an RSU augmented GPU provides speedups over a GPU of 3 and 16. Analytic evaluation shows a discrete accelerator that is limited by 336 GB/s DRAM produces speedups of 21 and 54 versus the GPU implementations. Siyang Wang 0001, Xiangyu Zhang 0011, Ramin Bashizade, Chris Dwyer, Alvin R. Lebeck |
ISCA | 2 |