Peng Jiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Peng Jiang has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
Gagan Agrawal
The Ohio State University
9 shared publicationsLinchuan Chen
Google
3 shared publications- Franck Cappello
Argonne National Laboratory, Lemont, USA
2 shared publications - Gagan Agrawal
University of Georgia, Athens, GA, USA
2 shared publications - Sheng Di
Argonne National Laboratory, Lemont, IL, USA
2 shared publications - Shihui Song
University of Iowa, Iowa City, USA
2 shared publications
Latest Publications
- Open Access
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 527-538
DCSM: Enabling Inter-Batch Parallelism for Continuous Subgraph Matching on GPU
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 527-538
Open AccessDCSM: Enabling Inter-Batch Parallelism for Continuous Subgraph Matching on GPU
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1966-1979
What to Support When You’re Compressing
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1966-1979
Open AccessWhat to Support When You’re Compressing
- Open Access
- 3 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 309-321
CereSZ: Enabling and Scaling Error-bounded Lossy Compression on Cerebras CS-2
Today's scientific applications running on supercomputers produce large volumes of data, leading to critical data storage and communication challenges. To tackle the challenges, error-bounded lossy compression is commonly adopted since it can reduce data size drastically within a user-defined error threshold. Previous work has shown that compression techniques can significantly reduce the storage and I/O overhead while retaining good data quality. However, the existing compressors are mainly designed for CPU and GPU. As new AI chips are being incorporated into supercomputers and increasingly used for accelerating scientific computing, there is a growing demand for efficient data compression on the new architecture. In this paper, we propose an efficient lossy compressor, CereSZ, based on the Cerebras CS-2 system. The compression algorithm is mapped onto Cerebras using both data parallelism and pipeline parallelism. In order to achieve a balanced workload on each processing unit, we propose an algorithm to evenly distribute the pipeline stages. Our experiments with six scientific datasets demonstrate that CereSZ can achieve a throughput from 227.93 GB/s to 773.8 GB/s, 2.43x to 10.98x faster than existing GPU compressors.
- 3 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 309-321
Open AccessCereSZ: Enabling and Scaling Error-bounded Lossy Compression on Cerebras CS-2
Today's scientific applications running on supercomputers produce large volumes of data, leading to critical data storage and communication challenges. To tackle the challenges, error-bounded lossy compression is commonly adopted since it can reduce data size drastically within a user-defined error threshold. Previous work has shown that compression techniques can significantly reduce the storage and I/O overhead while retaining good data quality. However, the existing compressors are mainly designed for CPU and GPU. As new AI chips are being incorporated into supercomputers and increasingly used for accelerating scientific computing, there is a growing demand for efficient data compression on the new architecture. In this paper, we propose an efficient lossy compressor, CereSZ, based on the Cerebras CS-2 system. The compression algorithm is mapped onto Cerebras using both data parallelism and pipeline parallelism. In order to achieve a balanced workload on each processing unit, we propose an algorithm to evenly distribute the pipeline stages. Our experiments with six scientific datasets demonstrate that CereSZ can achieve a throughput from 227.93 GB/s to 773.8 GB/s, 2.43x to 10.98x faster than existing GPU compressors.
- Open Access
- 19 February 2020
- Published by Association for Computing Machinery (ACM)
- p. 376-388
A novel data transformation and execution strategy for accelerating sparse matrix multiplication on GPUs
- 19 February 2020
- Published by Association for Computing Machinery (ACM)
- p. 376-388
Open AccessA novel data transformation and execution strategy for accelerating sparse matrix multiplication on GPUs
- Open Access
- 19 February 2020
- Published by Association for Computing Machinery (ACM)
- p. 160-172
Scaling out speculative execution of finite-state machines with parallel merge
- 19 February 2020
- Published by Association for Computing Machinery (ACM)
- p. 160-172
Open AccessScaling out speculative execution of finite-state machines with parallel merge
- 1 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 445-456
A Methodology for Characterizing Sparse Datasets and Its Application to SIMD Performance Prediction
Irregular computations are commonly seen in many scientific and engineering domains that use unstructured meshes or sparse matrices. The performance of an irregular application is very dependent upon the dataset. This paper poses the following question: "given an unstructured mesh or a graph, what method(s) can be used to sample it, such that the execution on the resulting sampled dataset can accurately reflect performance characteristics on the full dataset". 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. We apply our unstructured dataset characterization approach to modeling the performance for SIMD irregular applications, where the sampled dataset obtained is used to predict cache miss rate and SIMD utilization ratio. We also build analytical models to estimate overheads incurred by load imbalance among threads. With knowledge of these factors, we adapt a code skeleton framework SKOPE to capture the workload behaviors and aggregate performance statistics for execution time prediction.
- 1 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 445-456
A Methodology for Characterizing Sparse Datasets and Its Application to SIMD Performance Prediction
Irregular computations are commonly seen in many scientific and engineering domains that use unstructured meshes or sparse matrices. The performance of an irregular application is very dependent upon the dataset. This paper poses the following question: "given an unstructured mesh or a graph, what method(s) can be used to sample it, such that the execution on the resulting sampled dataset can accurately reflect performance characteristics on the full dataset". 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. We apply our unstructured dataset characterization approach to modeling the performance for SIMD irregular applications, where the sampled dataset obtained is used to predict cache miss rate and SIMD utilization ratio. We also build analytical models to estimate overheads incurred by load imbalance among threads. With knowledge of these factors, we adapt a code skeleton framework SKOPE to capture the workload behaviors and aggregate performance statistics for execution time prediction.
- Open Access
- 16 February 2019
- Published by Association for Computing Machinery (ACM)
- p. 17-28
Enabling prefix sum parallelism pattern for recurrences with principled function reconstruction
- 16 February 2019
- Published by Association for Computing Machinery (ACM)
- p. 17-28
Open AccessEnabling prefix sum parallelism pattern for recurrences with principled function reconstruction
- Open Access
- 1 November 2018
- Published by Association for Computing Machinery (ACM)
- p. 1-13
Revealing parallel scans and reductions in recurrences through function reconstruction
- 1 November 2018
- Published by Association for Computing Machinery (ACM)
- p. 1-13
Open AccessRevealing parallel scans and reductions in recurrences through function reconstruction
- Open Access
- 24 February 2018
- Published by Association for Computing Machinery (ACM)
- p. 175-187
Conflict-free vectorization of associative irregular applications with recent SIMD architectural advances
Irregular applications that involve indirect memory accesses were traditionally considered unsuitable for SIMD processing. Though some progress has been made in recent years, the existing approaches require either expensive data reorganization or favorable input distribution to deliver good performance. In this work, we propose a novel vectorization approach called in-vector reduction that can efficiently accelerate a class of associative irregular applications. This approach exploits associativity in the irregular reductions to resolve the data conflicts within SIMD vectors. We implement in-vector reduction with the new conflict detecting instructions that are supported in Intel AVX-512 instruction set and provide a programming interface to facilitate the vectorization of such associative irregular applications. Compared with previous approaches, in-vector reduction eliminates a large part of the overhead of data reorganization and achieves high SIMD utilization even under adverse input distributions. The evaluation results show that our approach is efficient in vectorizing a diverse set of irregular applications, including graph algorithms, particle simulation codes, and hash-based aggregation. Our vectorization achieves 1.5x to 5.5x speedups over the original sequential codes on a single core of Intel Xeon Phi and outperforms a competing approach, conflict-masking based vectorization, by 1.4x to 11.8x.
- 24 February 2018
- Published by Association for Computing Machinery (ACM)
- p. 175-187
Open AccessConflict-free vectorization of associative irregular applications with recent SIMD architectural advances
Irregular applications that involve indirect memory accesses were traditionally considered unsuitable for SIMD processing. Though some progress has been made in recent years, the existing approaches require either expensive data reorganization or favorable input distribution to deliver good performance. In this work, we propose a novel vectorization approach called in-vector reduction that can efficiently accelerate a class of associative irregular applications. This approach exploits associativity in the irregular reductions to resolve the data conflicts within SIMD vectors. We implement in-vector reduction with the new conflict detecting instructions that are supported in Intel AVX-512 instruction set and provide a programming interface to facilitate the vectorization of such associative irregular applications. Compared with previous approaches, in-vector reduction eliminates a large part of the overhead of data reorganization and achieves high SIMD utilization even under adverse input distributions. The evaluation results show that our approach is efficient in vectorizing a diverse set of irregular applications, including graph algorithms, particle simulation codes, and hash-based aggregation. Our vectorization achieves 1.5x to 5.5x speedups over the original sequential codes on a single core of Intel Xeon Phi and outperforms a competing approach, conflict-masking based vectorization, by 1.4x to 11.8x.
- Open Access
- 14 June 2017
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Efficient SIMD and MIMD parallelization of hash-based aggregation by conflict mitigation
As the rate of data generation is growing exponentially each year, data aggregation has become one of the most common and expensive operations for data analysis. Previous efforts to accelerate data aggregation have been mainly focused on multi-core CPUs, improving single-core cache performance and/or reducing multi-core data synchronization overheads. In this paper, we aim at utilizing both SIMD and MIMD of a modern processor with a more recent (and wide lane) SIMD instruction set. We find that a straightforward method for vectorization of hash table often cannot deliver good performance, because wider SIMD vector increases data conflicts among the lanes (especially with skewed data). To address this problem, we design a variant of basic bucket hashing and a bucketized aggregation procedure that can utilize both SIMD and MIMD parallelism efficiently. Our approach first adds distinct offsets to input rows on different SIMD lanes, which reduces the possibility of different lanes accessing identical slot in the hash table. An efficient bucketized aggregation procedure is invoked to save space when the hash table is saturated, or to calculate the final results after all input rows have been inserted into the hash table. For parallelization across cores, we adopt separate hash tables and optimize with parallel reduction and a hybrid approach. We evaluate our methods with input datasets of different distributions. On a single core of Intel Xeon Phi, we obtain 1.6x to 2.9x speedup (over serial code) using our SIMD approach, and outperform a straightforward SIMD implementation by up to 7x. Over multiple cores, our approach has a near-linear scalability.
- 14 June 2017
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessEfficient SIMD and MIMD parallelization of hash-based aggregation by conflict mitigation
As the rate of data generation is growing exponentially each year, data aggregation has become one of the most common and expensive operations for data analysis. Previous efforts to accelerate data aggregation have been mainly focused on multi-core CPUs, improving single-core cache performance and/or reducing multi-core data synchronization overheads. In this paper, we aim at utilizing both SIMD and MIMD of a modern processor with a more recent (and wide lane) SIMD instruction set. We find that a straightforward method for vectorization of hash table often cannot deliver good performance, because wider SIMD vector increases data conflicts among the lanes (especially with skewed data). To address this problem, we design a variant of basic bucket hashing and a bucketized aggregation procedure that can utilize both SIMD and MIMD parallelism efficiently. Our approach first adds distinct offsets to input rows on different SIMD lanes, which reduces the possibility of different lanes accessing identical slot in the hash table. An efficient bucketized aggregation procedure is invoked to save space when the hash table is saturated, or to calculate the final results after all input rows have been inserted into the hash table. For parallelization across cores, we adopt separate hash tables and optimize with parallel reduction and a hybrid approach. We evaluate our methods with input datasets of different distributions. On a single core of Intel Xeon Phi, we obtain 1.6x to 2.9x speedup (over serial code) using our SIMD approach, and outperform a straightforward SIMD implementation by up to 7x. Over multiple cores, our approach has a near-linear scalability.