Predicting Performance of Parallel Analytics and Irregular Computations

Bibliographic Details
Main Author:	Zhu, Gangyi
Language:	English
Published:	The Ohio State University / OhioLINK 2019
Subjects:	Computer Science Computer Engineering
Online Access:	http://rave.ohiolink.edu/etdc/view?acc_num=osu1563472235437977

id	ndltd-OhioLink-oai-etd.ohiolink.edu-osu1563472235437977
record_format	oai_dc
spelling	ndltd-OhioLink-oai-etd.ohiolink.edu-osu15634722354379772021-08-03T07:11:54Z Predicting Performance of Parallel Analytics and Irregular Computations Zhu, Gangyi Computer Science Computer Engineering Scientific simulation and computation are becoming more complicated in recent years due to multiple reasons including new data processing paradigms, irregular computation pattern, evolving hardware development, and other factors. Since there is an increasingly large gap between the I/O performance and compute power so that the cost of writing and reading the vast amount of simulated data from disk is expensive, more attentions have been paid to in-situ analytics. Irregular computation, usually arising in domains that use sparse matrices, graphs, or other irregular data structures, introduces a variety of uncertainty to the performance of scientific computation. Moreover, the newly developed hardware platforms such as MIC and GPUs also impose challenges for understanding and improving performance of scientific applications. Hence, there is clearly a need for analyzing the impacts of these factors to scientific computations.We start from predicting performance of the disk-based and in-situ parallel data analytics implemented in MapReduce-like frameworks. We take two distinct approaches towards performance prediction. We first expand SKOPE (a SKeleton framewOrk for Performance Exploration) with performance models for disk data read, cache performance, and page fault penalty. Second, an analytical performance model is also developed. Next, we take irregular computations into consideration for performance prediction. Cache performance of irregular computations is highly input-dependent. Based on the sparse matrix view of irregular computation as well as the cache locality analysis, we propose a novel sampling approach named Adaptive Stratified Row sampling -- this method is capable of generating a representative sample that delivers cache performance similar to the original input. On top of our sampling method, we incorporate reuse distance analysis to accommodate different cache configurations with high efficiency. Besides, we modify SKOPE, a code skeleton framework, to predict the execution time for irregular applications with the predicted cache performance.We extend the work of modeling irregular computations to the SIMD scenario. Our first insight is that developing a universal sampling approach for all sparse matrices is unpractical. According to the non-zero distribution of the sparse matrix, we propose two novel sampling strategies: Stride Average sampling and Random Tile sampling, which are suitable for uniform and skewed sparse matrices respectively. To help categorize a sparse matrix as uniform or skewed, we introduce clustering coefficient as an important feature which can be propagated into the decision tree model. We also adapt Random Node Neighbor sampling approach for efficient estimation of clustering coefficient.Finally, we target another topic of irregular computation on GPUs: sparse matrix format selection for Sparse Matrix-Vector Multiplication (SpMV). Based on the storage properties and processing granularity of different formats, we develop three novel sampling schemes: Row Crop sampling, Random Warp sampling, and Diagonal Align sampling. Then we obtain the base performance for each format by executing SpMV over the generated samples. The best format is predicted by scaling the base performance based on the difference of parallelism between the original matrix and the sampled one. 2019-10-23 English text The Ohio State University / OhioLINK http://rave.ohiolink.edu/etdc/view?acc_num=osu1563472235437977 http://rave.ohiolink.edu/etdc/view?acc_num=osu1563472235437977 unrestricted This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws.
collection	NDLTD
language	English
sources	NDLTD
topic	Computer Science Computer Engineering
spellingShingle	Computer Science Computer Engineering Zhu, Gangyi Predicting Performance of Parallel Analytics and Irregular Computations
author	Zhu, Gangyi
author_facet	Zhu, Gangyi
author_sort	Zhu, Gangyi
title	Predicting Performance of Parallel Analytics and Irregular Computations
title_short	Predicting Performance of Parallel Analytics and Irregular Computations
title_full	Predicting Performance of Parallel Analytics and Irregular Computations
title_fullStr	Predicting Performance of Parallel Analytics and Irregular Computations
title_full_unstemmed	Predicting Performance of Parallel Analytics and Irregular Computations
title_sort	predicting performance of parallel analytics and irregular computations
publisher	The Ohio State University / OhioLINK
publishDate	2019
url	http://rave.ohiolink.edu/etdc/view?acc_num=osu1563472235437977
work_keys_str_mv	AT zhugangyi predictingperformanceofparallelanalyticsandirregularcomputations
_version_	1719456313444925440

Predicting Performance of Parallel Analytics and Irregular Computations

Similar Items