Výsledky vyhledávání - Theory of computation → Graph algorithms analysis
-
1
Skywalker: Efficient Alias-Method-Based Graph Sampling and Random Walk on GPUs
Vydáno: IEEE 01.09.2021Vydáno v 2021 30th International Conference on Parallel Architectures and Compilation Techniques (PACT) (01.09.2021)“…Graph sampling and random walk operations, capturing the structural properties of graphs, are playing an important role today as we cannot directly adopt computing-intensive algorithms on large-scale graphs…”
Získat plný text
Konferenční příspěvek -
2
ParGNN: A Scalable Graph Neural Network Training Framework on multi-GPUs
Vydáno: IEEE 22.06.2025Vydáno v 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“… over-partition to alleviate load imbalance. Based on the over-partition results, we present a subgraph pipeline algorithm to overlap communication and computation while maintaining the accuracy of GNN training…”
Získat plný text
Konferenční příspěvek -
3
BlasPart: A Deterministic Parallel Partitioner for Balanced Large-Scale Hypergraph Partitioning
Vydáno: IEEE 22.06.2025Vydáno v 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“… Thus, fast and high-quality deterministic partitioning algorithms are largely in demand…”
Získat plný text
Konferenční příspěvek -
4
ACGraph: Accelerating Streaming Graph Processing via Dependence Hierarchy
Vydáno: IEEE 09.07.2023Vydáno v 2023 60th ACM/IEEE Design Automation Conference (DAC) (09.07.2023)“…Streaming graph processing needs to timely evaluate continuous queries. Prior systems suffer from massive redundant computations due to the irregular order of processing vertices influenced by updates…”
Získat plný text
Konferenční příspěvek -
5
DS-GL: Advancing Graph Learning via Harnessing Nature's Power within Scalable Dynamical Systems
Vydáno: IEEE 29.06.2024Vydáno v 2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA) (29.06.2024)“… problems and have been adopted for traditional graph computation, such as max-cut. However, when performing complex Graph Learning (GL…”
Získat plný text
Konferenční příspěvek -
6
SumPA: Efficient Pattern-Centric Graph Mining with Pattern Abstraction
Vydáno: IEEE 01.09.2021Vydáno v 2021 30th International Conference on Parallel Architectures and Compilation Techniques (PACT) (01.09.2021)“…Graph mining aims to explore interesting structural information of a graph. Pattern-centric systems typically transform a generic-purpose graph mining problem into a series of subgraph matching problems for high performance…”
Získat plný text
Konferenční příspěvek -
7
PIMGCN: A ReRAM-Based PIM Design for Graph Convolutional Network Acceleration
Vydáno: IEEE 05.12.2021Vydáno v 2021 58th ACM/IEEE Design Automation Conference (DAC) (05.12.2021)“…Graph Convolutional Network (GCN) is a promising but computing- and memory-intensive learning model…”
Získat plný text
Konferenční příspěvek -
8
NeuraChip: Accelerating GNN Computations with a Hash-based Decoupled Spatial Accelerator
Vydáno: IEEE 29.06.2024Vydáno v 2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA) (29.06.2024)“…Graph Neural Networks (GNNs) are emerging as a formidable tool for processing non-euclidean data across various domains, ranging from social network analysis to bioinformatic…”
Získat plný text
Konferenční příspěvek -
9
DyGNN: Algorithm and Architecture Support of Dynamic Pruning for Graph Neural Networks
Vydáno: IEEE 05.12.2021Vydáno v 2021 58th ACM/IEEE Design Automation Conference (DAC) (05.12.2021)“…Recently, graph neural networks (GNNs) have achieved great success for graph representation learning tasks…”
Získat plný text
Konferenční příspěvek -
10
Parallelizing Maximal Clique Enumeration on GPUs
Vydáno: IEEE 21.10.2023Vydáno v 2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT) (21.10.2023)“…We present a GPU solution for exact maximal clique enumeration (MCE) that performs a search tree traversal following the Bron-Kerbosch algorithm…”
Získat plný text
Konferenční příspěvek -
11
iG-kway: Incremental k-way Graph Partitioning on GPU
Vydáno: IEEE 22.06.2025Vydáno v 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“…Recent advances in GPU-accelerated graph partitioning have achieved significant performance gains but remain limited to full graph partitioning, lacking support for incremental updates…”
Získat plný text
Konferenční příspěvek -
12
GPart: A GNN-Enabled Multilevel Graph Partitioner
Vydáno: IEEE 22.06.2025Vydáno v 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“…This paper introduces GPart, a scalable multilevel framework for graph partitioning that integrates GNN embeddings with efficient coarsening and refinement techniques…”
Získat plný text
Konferenční příspěvek -
13
LearnGraph: A Learning-Based Architecture for Dynamic Graph Processing
Vydáno: IEEE 22.06.2025Vydáno v 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“…Dynamic graph processing systems using conventional array-based architectures face significant throughput limitations due to inefficient memory access and index management…”
Získat plný text
Konferenční příspěvek -
14
EMGraph: Fast Learning-Based Electromigration Analysis for Multi-Segment Interconnect Using Graph Convolution Networks
Vydáno: IEEE 05.12.2021Vydáno v 2021 58th ACM/IEEE Design Automation Conference (DAC) (05.12.2021)“… VLSI multisegment interconnect trees can be naturally viewed as graphs. Based on this observation, we propose a new graph convolution network (GCN…”
Získat plný text
Konferenční příspěvek -
15
Late Breaking Results: An Efficient and Scalable Track Assignment with GPU Parallelism
Vydáno: IEEE 22.06.2025Vydáno v 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“… Based on the independence and divisibility of track assignment, we propose a GPU-accelerated parallel track assignment algorithm…”
Získat plný text
Konferenční příspěvek -
16
Anchor First, Accelerate Next: Revolutionizing GNNs with PIM by Harnessing Stationary Data
Vydáno: IEEE 22.06.2025Vydáno v 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“…Substantial data movement caused by irregular graph topologies hinders the efficient processing of graph neural networks (GNNs…”
Získat plný text
Konferenční příspěvek -
17
NEO-DNND: Communication-Optimized Distributed Nearest Neighbor Graph Construction
Vydáno: IEEE 17.11.2024Vydáno v SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis (17.11.2024)“…Graph-based approximate nearest neighbor algorithms have shown high neighbor structure representation quality…”
Získat plný text
Konferenční příspěvek -
18
SGIRR: Sparse Graph Index Remapping for ReRAM Crossbar Operation Unit and Power Optimization
ISSN: 1558-2434Vydáno: ACM 29.10.2022Vydáno v 2022 IEEE/ACM International Conference On Computer Aided Design (ICCAD) (29.10.2022)“…Resistive Random Access Memory (ReRAM) Crossbars are a promising process-in-memory technology to reduce enormous data movement overheads of large-scale graph processing between computation and memory units…”
Získat plný text
Konferenční příspěvek -
19
PSMiner: A Pattern-Aware Accelerator for High-Performance Streaming Graph Pattern Mining
Vydáno: IEEE 09.07.2023Vydáno v 2023 60th ACM/IEEE Design Automation Conference (DAC) (09.07.2023)“…Streaming Graph Pattern Mining (GPM) has been widely used in many application fields…”
Získat plný text
Konferenční příspěvek -
20
Dynamic Allocation of Processor Cores to Graph Applications on Commodity Servers
Vydáno: IEEE 21.10.2023Vydáno v 2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT) (21.10.2023)“…Graph processing is increasingly adopted to solve problems that span many application domains, including scientific computing, social networks, and big-data analytics…”
Získat plný text
Konferenční příspěvek