Parallel processing of graph reachability in databases

Wolfson, O; Zhang, W; Butani, H; Kawaguchi, A; Mok, K

doi:10.1007/BF01421676

Title: Parallel processing of graph reachability in databases

Full Record
Other Related Research

Abstract

In this paper we consider parallel processing of a graph represented by a database relation, and we achieved two objectives. First, we propose a methodology for analyzing the speedup of a parallel processing strategy with the purpose of selecting at runtime one of several candidate strategies, depending the hardware architecture and the input graph. Second, we study the single source reachability problem, namely the problem of computing the set of nodes reachable from a given node in a directed graph. We propose several parallel strategies for solving this problem, and we analyze their performance using our new methodology. The analysis is confirmed experimentally in a UNIX-Ethernet environment. We also extend the results to the transitive closure problem.

Authors:

Wolfson, O ^[1]; Zhang, W ^[2]; Butani, H ^[1]; Kawaguchi, A; Mok, K ^[3]

Univ. of Illinois, Chicago, IL (United States)
Univ. of Lethbridge, Alberta (Canada)
Columbia Univ., New York, NY (United States)

Publication Date:: Sat Aug 01 00:00:00 EDT 1992

OSTI Identifier:: 7240760

Resource Type:: Journal Article

Journal Name:: International Journal of Parallel Programming; (United States)

Additional Journal Information:: Journal Volume: 21:4; Journal ID: ISSN 0885-7458

Country of Publication:: United States

Language:: English

Subject:: 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; DATA BASE MANAGEMENT; PARALLEL PROCESSING; DATA-FLOW PROCESSING; OPTIMIZATION; ALGORITHMS; MANAGEMENT; MATHEMATICAL LOGIC; PROGRAMMING; 990200* - Mathematics & Computers

Citation Formats


                    Wolfson, O, Zhang, W, Butani, H, Kawaguchi, A, and Mok, K. Parallel processing of graph reachability in databases.  United States: N. p., 1992. 
        Web.  doi:10.1007/BF01421676.

Copy to clipboard


                    Wolfson, O, Zhang, W, Butani, H, Kawaguchi, A, & Mok, K. Parallel processing of graph reachability in databases.  United States.  https://doi.org/10.1007/BF01421676

Copy to clipboard


                    Wolfson, O, Zhang, W, Butani, H, Kawaguchi, A, and Mok, K. 1992.  
        "Parallel processing of graph reachability in databases".  United States.  https://doi.org/10.1007/BF01421676.

Copy to clipboard


                    
@article{osti_7240760,

  title        = {Parallel processing of graph reachability in databases},

  author       = {Wolfson, O and Zhang, W and Butani, H and Kawaguchi, A and Mok, K},

  abstractNote = {In this paper we consider parallel processing of a graph represented by a database relation, and we achieved two objectives. First, we propose a methodology for analyzing the speedup of a parallel processing strategy with the purpose of selecting at runtime one of several candidate strategies, depending the hardware architecture and the input graph. Second, we study the single source reachability problem, namely the problem of computing the set of nodes reachable from a given node in a directed graph. We propose several parallel strategies for solving this problem, and we analyze their performance using our new methodology. The analysis is confirmed experimentally in a UNIX-Ethernet environment. We also extend the results to the transitive closure problem.},

  doi          = {10.1007/BF01421676},

  url          = {https://www.osti.gov/biblio/7240760},
  journal      = {International Journal of Parallel Programming; (United States)},

  issn         = {0885-7458},

  number       = ,

  volume       = 21:4,

  place        = {United States},

  year         = {Sat Aug 01 00:00:00 EDT 1992},

  month        = {Sat Aug 01 00:00:00 EDT 1992}

}

Copy to clipboard

Journal Article:

https://doi.org/10.1007/BF01421676

Other availability

Find in Google Scholar

Search WorldCat to find libraries that may hold this journal

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)

Technical Report Shen, Xipeng

The development of modern processors exhibits two trends that complicate the optimizations of modern software. The first is the increasing sensitivity of processors' throughput to irregularities in computation. With more processors produced through a massive integration of simple cores, future systems will increasingly favor regular data-level parallel computations, but deviate from the needs of applications with complex patterns. Some evidences are already shown on Graphic Processing Units (GPU): Irregular data accesses (e.g., indirect references A[D[i]]) and conditional branches are limiting many GPU applications' performance at a level an order of magnitude lower than the peak of GPU. The second hardwaremore »« less
https://doi.org/10.2172/1576175

Full Text Available
ARENA: Asynchronous Reconfigurable Accelerator Ring to Enable Data-Centric Parallel Computing

Journal Article Tan, Cheng; Xie, Chenhao; Geng, Tong; ... - IEEE Transactions on Parallel and Distributed Systems

The next generation HPC and data centers are likely to be reconfigurable and data-centric due to the trend of hardware specialization and the emergence of data-driven applications. In this work, we propose ARENA – an asynchronous reconfigurable accelerator ring architecture as a potential scenario on how the future HPC and data centers will be like. Despite using the coarse-grained reconfigurable arrays (CGRAs) as the substrate platform, our key contribution is not only the CGRA-cluster design itself, but also the ensemble of a new architecture and programming model that enables asynchronous tasking across a cluster of reconfigurable nodes, so as tomore »« less
https://doi.org/10.1109/tpds.2021.3081074

Full Text Available
Profiling the BLAST bioinformatics application for load balancing on high-performance computing clusters

Journal Article Cheng, Trinity; Chin, Pei-Ju; Cha, Kenny; ... - BMC Bioinformatics

Abstract Background The Basic Local Alignment Search Tool (BLAST) is a suite of commonly used algorithms for identifying matches between biological sequences. The user supplies a database file and query file of sequences for BLAST to find identical sequences between the two. The typical millions of database and query sequences make BLAST computationally challenging but also well suited for parallelization on high-performance computing clusters. The efficacy of parallelization depends on the data partitioning, where the optimal data partitioning relies on an accurate performance model. In previous studies, a BLAST job was sped up by 27 times by partitioning the databasemore »« less
https://doi.org/10.1186/s12859-022-05029-7
Parallel Quantum Rapidly-Exploring Random Trees

Journal Article Lathrop, Paul; Boardman, Beth; Martínez, Sonia - IEEE Access

In this paper, we present the Parallel Quantum Rapidly-Exploring Random Tree (Pq-RRT) algorithm, a parallel version of the Quantum Rapidly-Exploring Random Trees (q-RRT) algorithm. Parallel Quantum RRT is a parallel quantum algorithm formulation of a sampling-based motion planner that uses Quantum Amplitude Amplification to search databases of reachable states for addition to a tree. In this work we investigate how parallel quantum devices can more efficiently search a database, as the quantum measurement process involves the collapse of the superposition to a base state, erasing probability information and therefore the ability to efficiently find multiple solutions. Pq-RRT uses a manager/parallel-quantum-workersmore »« less
https://doi.org/10.1109/ACCESS.2024.3383313
HBMax: Optimizing Memory Efficiency for Parallel Influence Maximization on Multicore Architectures

Conference Chen, Xinyu; Minutoli, Marco; Tian, Jiannan; ...

The goal of influence maximization is to select k most-influential vertices or seeds in a network, where influence is defined by a given diffusion process. The problem has a number of important applications such as viral marketing, information spread, and epidemic control. Although computing optimal seed set is NP-Hard, due to the submodular nature of the problem efficient approximation algorithms exist. However, even state-of-the-art parallel implementations are limited by a sampling step that incurs large memory footprints. This in turn limits the problem size reach and approximation quality. In this work, we study the memory footprint of the sampling processmore »« less
https://doi.org/10.1145/3559009.3569647

Similar Records