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

Yu-Jung Cheng

dblp:75/7695 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2014
0000-0003-1786-7447ORCID · corroborated

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

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 1Theory of computation · 1

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
Energy-efficient computing · 70% GPUs and heterogeneous computing · 30%

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

TopicWeightPapersLastEvidence papers
GPUs and heterogeneous computing
GPU power management
0.112011
Power gating strategies on GPUs · ACM Trans. Archit. Code Optim. 2011
Energy-efficient computing
leakage power reduction
0.112011
Power gating strategies on GPUs · ACM Trans. Archit. Code Optim. 2011
Energy-efficient computing
power gating
0.112011
Power gating strategies on GPUs · ACM Trans. Archit. Code Optim. 2011
Energy-efficient computing
dynamic power reduction
0.012011
Power gating strategies on GPUs · ACM Trans. Archit. Code Optim. 2011

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

time-out power gating · 0.1predictive shader shutdown · 0.1deferred geometry pipeline · 0.1
YearPublicationVenuePosition
2014 An implementation of the efficient huge amount of pseudo-random unique numbers generator and the acceleration analysis of parallelization
abstract
Random unique number generator can be used for generating a series of unpredictable and unrepeatable numbers within limited ranges of data and numbers. These numbers are usually distributed equally, random, independent, unpredictable and unrepeatable. A good random number generator has to be effective for a long period and has good statistical distribution and efficient generating performance. This study proposes a computational methodology to generate pseudo-random numbers based on random base polynomial, which uses less memory but generates a great deal of unrepeated pseudo-random numbers. Then this method adopts the multi-thread parallelization to effectively get the benefits of multi-core processors to accelerate the generation of a huge amount of pseudo-random numbers.
Yun-Te Lin, Yung-Hsiang Huang, Yu-Jung Cheng, Jih-Sheng Chang, Sheng-Wen Wang, Fang-Pang Lin, Chung-Ming Wang
DSAA4
2012 A cycle-level SIMT-GPU simulation framework
abstract
The massive parallelism provided by the modern graphics processing units (GPUs) makes them the attractive processors to accelerate the applications with high data-level parallelism. Therefore, the GPU architecture has recently gained a lot of attention in research community. However, the advance in the GPU architecture is impeded by the limited documents released from the major GPU vendors. Furthermore, current studies on GPUs often focus only on general-purpose (GPGPU) applications. The behaviors of the graphics applications, which are considered as the major GPU workloads, are often overlooked in these studies. A GPU design good for the GPGPU applications is not necessarily good for the graphics applications. Therefore, a simulation framework that is able to provide performance characterization for both applications is mandatory for the innovation of the GPU architecture.
Po-Han Wang 0001, Chien-Wei Lo, Chia-Lin Yang, Yu-Jung Cheng
ISPASS4
2011 Power gating strategies on GPUs
abstract
As technology continues to shrink, reducing leakage is critical to achieving energy efficiency. Previous studies on low-power GPUs (Graphics Processing Units) focused on techniques for dynamic power reduction, such as DVFS (Dynamic Voltage and Frequency Scaling) and clock gating. In this paper, we explore the potential of adopting architecture-level power gating techniques for leakage reduction on GPUs. We propose three strategies for applying power gating on different modules in GPUs. The Predictive Shader Shutdown technique exploits workload variation across frames to eliminate leakage in shader clusters. Deferred Geometry Pipeline seeks to minimize leakage in fixed-function geometry units by utilizing an imbalance between geometry and fragment computation across batches. Finally, the simple time-out power gating method is applied to nonshader execution units to exploit a finer granularity of the idle time. Our results indicate that Predictive Shader Shutdown eliminates up to 60% of the leakage in shader clusters, Deferred Geometry Pipeline removes up to 57% of the leakage in the fixed-function geometry units, and the simple time-out power gating mechanism eliminates 83.3% of the leakage in nonshader execution units on average. All three schemes incur negligible performance degradation, less than 1%.
Po-Han Wang 0001, Chia-Lin Yang, Yen-Ming Chen, Yu-Jung Cheng
ACM Trans. Archit. Code Optim.4