Search NASA⌕ Search

Engineering topics

Zhang, Yongzhe

Publications and source records attributed to Zhang, Yongzhe.

Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite

The analysis of connected data is an increasingly important application in high-performance computing. Such analyses can reveal fraudulent patterns in financial transactions, optimize telecommunications networks, predict information flow in social networks, etc. However, the landscape of graph analytics is highly diverse. Graph algorithms stress processor architectures differently, and no one graph can represent all topologies. Consequently, no single approach or framework is expected to be optimal for all graph analytics problems. To help make sense of this diverse landscape, we evaluated four approaches to graph analytics: GraphBLAS, Galois, BGL17, GraphIt; and compare them against hand-tuned implementations that take advantage of hardware features on our test platform. Graph- BLAS formulates graph analytics as sparse linear algebra. Galois provides syntactic constructs for data parallelism over irregular data structures. BGL17 is a generic C++ template library for implementing graph algorithms. GraphIt provides a domain- specific language to describe and optimize graph algorithms. We use the GAP Benchmark Suite to establish baseline performance and guide the side-by-side evaluation of each framework. GAP consists of 30 tests: six graph analytics algorithms (breadth- first search, single-source shortest path, PageRank, betweenness centrality, connected components, and triangle counting) run on five graphs, each with different topological characteristics (e.g., high diameter, skewed degree distribution, high average degree). High-performance reference implementations are included for each benchmark algorithm. Because a graph can be loaded into memory a number of ways (e.g., flat file on disk, compressed sparse format, data frames, retrieved from SQL or NoSQL databases), our evaluation focused on computational performance rather than I/O. Our results show the relative strengths of each framework.

Graph algorithms, Benchmarking, shared-memory prog↗

Parallel algorithms for finding connected components using linear algebra

Finding connected components is one of the most widely used operations on a graph. Optimal serial algorithms for the problem have been known for half a century, and many competing parallel algorithms have been proposed over the last several decades under various different models of parallel computation. This paper presents a class of parallel connected-component algorithms designed using linear-algebraic primitives. These algorithms are based on a PRAM algorithm by Shiloach and Vishkin and can be designed using standard GraphBLAS operations. Here, we demonstrate two algorithms of this class, one named LACC for Linear Algebraic Connected Components, and the other named FastSV which can be regarded as LACC’s simplification. With the support of the highly-scalable Combinatorial BLAS library, LACC and FastSV outperform the previous state-of-the-art algorithm by a factor of up to 12x for small to medium scale graphs. For large graphs with more than 50B edges, LACC and FastSV scale to 4K nodes (262K cores) of a Cray XC40 supercomputer and outperform previous algorithms by a significant margin. This remarkable performance is accomplished by (1) exploiting sparsity that was not present in the original PRAM algorithm formulation, (2) using high-performance primitives of Combinatorial BLAS, and (3) identifying hot spots and optimizing them away by exploiting algorithmic insights.

97 MATHEMATICS AND COMPUTING↗

Simulation of double buffer layer on CIGS solar cell with SCAPS software

In a CIGS thin film solar cell, the buffer layer is interposed between the absorber layer and the window layer, which plays an important role in interface electricity. CdS is often used as a buffer layer in CIGS cells. Beside the toxicity of Cd, the main drawback of CdS is its relatively narrow band gap (2.4 eV), which can lead to the current loss due to parasitic absorption. In order to reduce the use of CdS, we try other buffer layers instead of CdS and optimize buffer layer structure. Numerical simulation has been used to explore the effect of different buffer layer materials (CdS and ZnSe) on the performance of CuInGaSe{sub 2} solar cells with SCAPS-1D software. The main photovoltaic parameters of the analog device: open circuit voltage, short circuit current density, fill factor and conversion efficiency (η) were compared and analyzed. The results show that different buffer materials and thickness have great influence on the performance of the cell. In this simulation, CdS buffer layer was replaced by ZnSe material, which has a wider band gap. However, the efficiency of this kind of cell is lower than that of CIGS device with CdS buffer layer because of the bad energy band alignment. In order to improve the short-wave absorption and the efficiency of CIGS cell, we simulated a novel CdS/ZnSe double buffer layer structure. The efficiency of the optimized cell with double buffer layer increases from 18.47% (conventional cell with the same CdS buffer layer thickness) to 19.01%.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗