Search Results - Theory of computation-Design and analysis of algorithms
-
1
Late Breaking Results: An Efficient and Scalable Track Assignment with GPU Parallelism
Published: IEEE 22.06.2025Published in 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…”
Get full text
Conference Proceeding -
2
DS-GL: Advancing Graph Learning via Harnessing Nature's Power within Scalable Dynamical Systems
Published: IEEE 29.06.2024Published in 2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA) (29.06.2024)“…With the rapid digitization of the world, an increasing number of real-world applications are turning to non-Euclidean data, modeled as graphs. Due to their…”
Get full text
Conference Proceeding -
3
Invited: Algorithms and Architectures for Accelerating Long Read Sequence Analysis
Published: IEEE 09.07.2023Published in 2023 60th ACM/IEEE Design Automation Conference (DAC) (09.07.2023)“…; and three, novel algorithms and domain-specific architectures for rapid in situ analysis of third-generation sequencing data…”
Get full text
Conference Proceeding -
4
Optimal Memory Allocation and Scheduling for DMA Data Transfers under the LET Paradigm
Published: IEEE 05.12.2021Published in 2021 58th ACM/IEEE Design Automation Conference (DAC) (05.12.2021)“…The Logical Execution Time (LET) paradigm is increasingly used to achieve predictable communications in modern multicore automotive applications. Direct Memory…”
Get full text
Conference Proceeding -
5
Skywalker: Efficient Alias-Method-Based Graph Sampling and Random Walk on GPUs
Published: IEEE 01.09.2021Published in 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…”
Get full text
Conference Proceeding -
6
BlasPart: A Deterministic Parallel Partitioner for Balanced Large-Scale Hypergraph Partitioning
Published: IEEE 22.06.2025Published in 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“… Thus, fast and high-quality deterministic partitioning algorithms are largely in demand…”
Get full text
Conference Proceeding -
7
PertNAS: Architectural Perturbations for Memory-Efficient Neural Architecture Search
Published: IEEE 09.07.2023Published in 2023 60th ACM/IEEE Design Automation Conference (DAC) (09.07.2023)“… This leads to GPU-memory bottlenecks that hamper the algorithm's scalability. To resolve these bottlenecks, we propose a perturbations-based evolutionary approach…”
Get full text
Conference Proceeding -
8
BLESS: Bandwidth and Locality Enhanced SMEM Seeding Acceleration for DNA Sequencing
Published: IEEE 29.06.2024Published in 2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA) (29.06.2024)“… The seeding process, which aims to find locations of super-maximal exact matches (SMEM) between the DNA samples and reference genome for comparative analysis, has emerged as a major bottleneck due to its memory-intensive characteristics…”
Get full text
Conference Proceeding -
9
ParGNN: A Scalable Graph Neural Network Training Framework on multi-GPUs
Published: IEEE 22.06.2025Published in 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…”
Get full text
Conference Proceeding -
10
A Universal Method for Task Allocation on FP-FPS Multiprocessor Systems with Spin Locks
Published: IEEE 09.07.2023Published in 2023 60th ACM/IEEE Design Automation Conference (DAC) (09.07.2023)“… Unfortunately, these existing methods either are tailored for specific scheduling and analysis approaches, or introduce runtime overhead that undermines their applicability…”
Get full text
Conference Proceeding -
11
GARL: Genetic Algorithm-Augmented Reinforcement Learning to Detect Violations in Marker-Based Autonomous Landing Systems
ISSN: 1558-1225Published: IEEE 26.04.2025Published in Proceedings / International Conference on Software Engineering (26.04.2025)“… To address these issues, we introduce GARL, a framework combining a genetic algorithm (GA) and reinforcement learning (RL…”
Get full text
Conference Proceeding -
12
Parallelizing Maximal Clique Enumeration on GPUs
Published: IEEE 21.10.2023Published in 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…”
Get full text
Conference Proceeding -
13
SumPA: Efficient Pattern-Centric Graph Mining with Pattern Abstraction
Published: IEEE 01.09.2021Published in 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…”
Get full text
Conference Proceeding -
14
ACGraph: Accelerating Streaming Graph Processing via Dependence Hierarchy
Published: IEEE 09.07.2023Published in 2023 60th ACM/IEEE Design Automation Conference (DAC) (09.07.2023)“… To address this issue, we propose ACGraph, a novel streaming graph processing approach for monotonic graph algorithms…”
Get full text
Conference Proceeding -
15
Placement Tomography-Based Routing Blockage Generation for DRV Hotspot Mitigation
ISSN: 1558-2434Published: ACM 27.10.2024Published in Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design (27.10.2024)“…A fundamental goal in modern physical design is for the post-route layout to have a fixable number of remaining design rule violations (DRVs). We study how to…”
Get full text
Conference Proceeding -
16
InnerSP: A Memory Efficient Sparse Matrix Multiplication Accelerator with Locality-Aware Inner Product Processing
Published: IEEE 01.09.2021Published in 2021 30th International Conference on Parallel Architectures and Compilation Techniques (PACT) (01.09.2021)“…Sparse matrix multiplication is one of the key computational kernels in large-scale data analytics. However, a naive implementation suffers from the overheads…”
Get full text
Conference Proceeding -
17
Asynchronous Distributed-Memory Parallel Algorithms for Influence Maximization
Published: IEEE 17.11.2024Published in SC24: International Conference for High Performance Computing, Networking, Storage and Analysis (17.11.2024)“… We propose distributed-memory parallel algorithms for the two main kernels of a state-of-the-art implementation of one IM algorithm, influence maximization via martingales (IMM…”
Get full text
Conference Proceeding -
18
BLOwing Trees to the Ground: Layout Optimization of Decision Trees on Racetrack Memory
Published: IEEE 05.12.2021Published in 2021 58th ACM/IEEE Design Automation Conference (DAC) (05.12.2021)“…Modern distributed low power systems tend to integrate machine learning algorithms, which are directly executed on the distributed devices (on the edge…”
Get full text
Conference Proceeding -
19
NEO-DNND: Communication-Optimized Distributed Nearest Neighbor Graph Construction
Published: IEEE 17.11.2024Published in 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…”
Get full text
Conference Proceeding -
20
pSyncPIM: Partially Synchronous Execution of Sparse Matrix Operations for All-Bank PIM Architectures
Published: IEEE 29.06.2024Published in 2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA) (29.06.2024)“…Recent commercial incarnations of processing-in-memory (PIM) maintain the standard DRAM interface and employ the all-bank mode execution to maximize bank-level…”
Get full text
Conference Proceeding