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

Ying Zhang 0016

dblp:13/6769-16 · DBLP profile ↗
← Back
11ranked-venue papers
6as first author
1since 2021 · last 2021
—ORCID · conflict

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

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

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
5 papers
Processor architecture and microarchitecture · 28% Memory systems · 27% Cloud and datacenter computing · 23%

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

TopicWeightPapersLastEvidence papers
Memory systems
memory bandwidth
0.722021
LIBRA: Clearing the Cloud Through Dynamic Memory Bandwidth Management · HPCA 2021
Increasing off-chip bandwidth in multi-core processors with switchable pins · ISCA 2014
Cloud and datacenter computing
resource management
0.512021
LIBRA: Clearing the Cloud Through Dynamic Memory Bandwidth Management · HPCA 2021
Electronic design automation
design space exploration
0.212014
Comprehensive and Efficient Design Parameter Selection for Soft Error Resilient Processors via Universal Rules · IEEE Trans. Computers 2014
Hardware reliability and fault tolerance
soft errors
0.212014
Comprehensive and Efficient Design Parameter Selection for Soft Error Resilient Processors via Universal Rules · IEEE Trans. Computers 2014
Energy-efficient computing › energy-constrained computing
dark silicon
0.212013
Lighting the dark silicon by exploiting heterogeneity on future processors · DAC 2013
Processor architecture and microarchitecture › multicore design
heterogeneous processor architecture
0.212013
Lighting the dark silicon by exploiting heterogeneity on future processors · DAC 2013
Processor architecture and microarchitecture
multicore design
0.212013
Lighting the dark silicon by exploiting heterogeneity on future processors · DAC 2013
Energy-efficient computing
power delivery
0.112014
Increasing off-chip bandwidth in multi-core processors with switchable pins · ISCA 2014

Methods — techniques the papers use, named apart from their topics

hardware throttling · 0.5dynamic resource control · 0.5control policy · 0.5phase change memory · 0.3dynamic pin switching · 0.3simulation · 0.2patient rule induction method · 0.2classification and regression tree · 0.2performance modeling · 0.2design space exploration · 0.2
YearPublicationVenuePosition
2021 LIBRA: Clearing the Cloud Through Dynamic Memory Bandwidth Management
abstract
Modern Cloud Service Providers (CSP) heavily co-schedule tasks with different priorities on the same computing node to increase server utilization. To ensure the performance of high priority jobs, CSPs usually employ Quality-of-Service (QoS) mechanisms to manage or regulate the usage of shared hardware resources. Among the critical shared hardware resources, there has been very limited analysis on effective sharing of memory bandwidth among co-scheduled jobs, mainly for two reasons: (1) The correlation between application performance and its memory bandwidth allocation is complicated. (2) An effective hardware throttling mechanism for precise memory bandwidth control is unavailable. These limitations drive CSPs to design conservative policies to ensure the performance of the high priority tasks, which significantly degrades the throughput of batch jobs and reduces the overall benefits of workload co-scheduling. This paper proposes LIBRA, a holistic framework for dynamic memory bandwidth management in production data centers. LIBRA incorporates a novel hardware throttling mechanism, Dynamic Resource Control, to support self-adaptive memory bandwidth regulation. It also employs a lightweight control policy to further enhance the bandwidth scalability for the throttled tasks. Our evaluation results on a cluster demonstrate that LIBRA is capable of increasing the performance of batch jobs by up to 52.8% compared to existing QoS schemes.
Ying Zhang 0016, Xiaowei Jiang, Ian M. Steiner, Andrew Herdrich, Kevin Shu, Ripan Das, Long Cui, Litrin Jiang
HPCA1
2017 Using Switchable Pins to Increase Off-Chip Bandwidth in Chip-Multiprocessors
abstract
Off-chip memory bandwidth has been considered as one of the major limiting factors of processor performance, especially for multi-cores and many-cores. Conventional processor design allocates a large portion of off-chip pins to deliver power, leaving a small number of pins for processor signal communication. We observe that a processor requires much less power during memory intensive stages than is available. This is due to the fact that the frequencies of processor cores waiting for data to be fetched from offchip memories can be scaled down in order to save power without degrading performance. Motivated by this observation, we propose a dynamic pin switching technique to alleviate this bandwidth limitation. This technique is introduced to dynamically exploit surplus power delivery pins to provide extra bandwidth during memory intensive program phases, thereby significantly boosting performance. This work is extended to compare two approaches for increasing off chip bandwidths using switchable pins. Additionally, it shows significant performance improvements for memory intensive workloads on a memory subsystem using Phase Change Memory.
Shaoming Chen, Samuel Irving, Lu Peng 0001, Ying Zhang 0016, Ashok Srivastava
IEEE Trans. Parallel Distributed Syst.5
2015 NBTI alleviation on FinFET-made GPUs by utilizing device heterogeneity
Ying Zhang 0016, Sui Chen, Lu Peng 0001, Shaoming Chen
Integr.1
2014 QoS management on heterogeneous architecture for parallel applications
abstract
Quality of service (QoS) management is widely employed to provide differentiable performance to programs with distinctive priorities on conventional chip multi-processor (CMP) platforms. Recently, heterogeneous architecture integrating diverse processor cores on the same silicon has been proposed to better serve various application domains and it is expected to be an important design paradigm of future processors. Therefore, the QoS management on emerging heterogeneous systems will be of great significance. On the other hand, parallel applications are becoming increasingly important in modern computing community in order to explore the benefit of thread-level parallelism on CMPs. However, considering the diverse characteristics of thread synchronization, data sharing, and parallelization pattern, governing the execution of multiple parallel programs with different performance requirements becomes a complicated yet significant problem. In this paper, we study QoS management for parallel applications running on heterogeneous CMP systems. We comprehensively assess a series of task-to-core mapping policies on a real heterogeneous hardware (QuickIA) by characterizing their impacts on performance of individual applications. Our evaluation results show that the proposed QoS policies are effective to improve the performance of programs with highest priority while striking good tradeoff with system fairness.
Ying Zhang 0016, Li Zhao 0002, Ramesh Illikkal, Ravi R. Iyer 0001, Andrew Herdrich, Lu Peng 0001
ICCD1
2014 Increasing off-chip bandwidth in multi-core processors with switchable pins
abstract
Off-chip memory bandwidth has been considered as one of the major limiting factors to processor performance, especially for multi-cores and many-cores. Conventional processor design allocates a large portion of off-chip pins to deliver power, leaving a small number of pins for processor signal communication. We observed that the processor requires much less power than that can be supplied during memory intensive stages. This is due to the fact that the frequencies of processor cores waiting for data to be fetched from off-chip memories can be scaled down in order to save power without degrading performance. In this work, motivated by this observation, we propose a dynamic pin switch technique to alleviate the bandwidth limitation issue. The technique is introduced to dynamically exploit the surplus pins for power delivery in the memory intensive phases and uses them to provide extra bandwidth for the program executions, thus significantly boosting the performance.
Shaoming Chen, Ying Zhang 0016, Lu Peng 0001, Jesse Ardonne, Samuel Irving, Ashok Srivastava
ISCA3
2014 Comprehensive and Efficient Design Parameter Selection for Soft Error Resilient Processors via Universal Rules
abstract
Soft errors have been significantly degrading the reliability of current processors whose feature sizes and supply voltages are fast scaling down. In this paper, we propose two effective approaches to characterize processor reliability against soft errors at presilicon stage. By utilizing a rule search strategy named Patient Rule Induction Method (PRIM), we are capable of generating a set of selective rules on key design parameters. These rules quantify the design space subregion with the lowest effective soft error rate (SER), thus providing useful guidelines in designing reliable processors. Furthermore, we also propose to use Classification and Regression Trees (CART) to partition the design space into a number of small subregions each being associated with a representative SER value. This gives the processor designer a global view of the SER distribution, enabling a comprehensive analysis over the entire design space. More importantly, both approaches generate “universal” models whose effectiveness is validated with a set of test programs unseen to training. Compared to traditional application-specific design space studies, our models’ cross-program capability can save great training effort in the era of multithreading. Finally, a case study on multiprocessors is performed to simultaneously balance multiple design metrics, including reliability, performance, and power.
Lide Duan, Ying Zhang 0016, Bin Li 0008, Lu Peng 0001
IEEE Trans. Computers2
2013 Lighting the dark silicon by exploiting heterogeneity on future processors
abstract
As we embrace the deep submicron era, dark silicon caused by the failure of Dennard scaling impedes us from attaining commensurate performance benefit from the increased number of transistors. To alleviate the dark silicon and effectively leverage the advantage of decreased feature size, we consider a set of design paradigms by exploiting heterogeneity in the processor manufacturing. We conduct a thorough investigation on these design patterns from different evaluation perspectives including performance, energy-efficiency, and cost-efficiency. Our observations can provide insightful guidance to the design of future processors in the presence of dark silicon.
Ying Zhang 0016, Lu Peng 0001, Xin Fu 0001
DAC1
2011 Tree structured analysis on GPU power study
abstract
Graphics Processing Units (GPUs) have emerged as a promising platform for parallel computation. With a large number of processor cores and abundant memory bandwidth, GPUs deliver substantial computation power. While providing high computation performance, a GPU consumes high power and needs sufficient power supplies and cooling systems. It is essential to institute an efficient mechanism for evaluating and understanding the power consumption when running real applications on high-end GPUs. In this paper, we present a high-level GPU power consumption model using sophisticated tree-based random forest methods which correlate and predict the power consumption using a set of performance variables. We demonstrate that this statistical model not only predicts the GPU runtime power consumption more accurately than existing regression based approaches, but more importantly, it provides sufficient insights into understanding the correlation of the GPU power consumption with individual performance metrics. We use a GPU simulator that can collect more runtime performance metrics than hardware counters. We measure the power consumption of a wide-range of CUDA kernels on an experimental system with GTX 280 GPU to collect statistical samples for power analysis. The proposed method is applicable to other GPUs as well.
Jianmin Chen, Bin Li 0008, Ying Zhang 0016, Lu Peng 0001, Jih-Kwon Peir
ICCD3
2011 Universal rules guided design parameter selection for soft error resilient processors
abstract
High-performance processors suffer from soft error vulnerability due to the increasing on-chip transistor density, shrinking processor feature size, lower threshold voltage, etc. In this paper, we propose to use a rule search strategy, i.e. Patient Rule Induction Method (PRIM), to optimize processor soft error robustness. By exploring a huge microarchitectural design space on the Architectural Vulnerability Factor (AVF), we are capable of generating a set of selective rules on key design parameters. Applying these rules at early design stage effectively identifies the configurations that are inherently reliable to soft errors. Furthermore, we propose a generic approach capable of generating a set of “universal” rules that achieves the optimization of the output variable for different programs in execution. The effectiveness of the universal rule set is validated on programs that are not used in training. This cross-program capability is very useful in the era of multi-threading. Finally, the proposed scheme is extended to multiprocessors where multiple design metrics including reliability, performance and power are balanced. Our proposed methodology is able to generate quantitative and universal solutions for both uniprocessors and multiprocessors.
Lide Duan, Ying Zhang 0016, Bin Li 0008, Lu Peng 0001
ISPASS2
2011 Performance and Power Analysis of ATI GPU: A Statistical Approach
abstract
We present a comprehensive study on the performance and power consumption of a recent ATI GPU. By employing a rigorous statistical model to analyze execution behaviors of representative general-purpose GPU (GPGPU) applications, we conduct insightful investigations on the target GPU architecture. Our results demonstrate that the GPU execution throughput and the power dissipation are dependent on different architectural variables. Furthermore, we design a set of micro-benchmarks to study the power consumption features of different function units on the GPU. Based on those results, we derive instructive principles that can guide the design of power-efficient high performance computing systems.
Ying Zhang 0016, Bin Li 0008, Lu Peng 0001
NAS1
2010 Expediating IP lookups with reduced power via TBM and SST supernode caching
Ying Zhang 0016, Lu Peng 0001, Wencheng Lu, Lide Duan, Suresh Rai
Comput. Commun.1