Title: SparseWeaver: Converting Sparse Operations as Dense Operations on GPUs for Graph Workloads
Award ID(s):
2316176
PAR ID:
10621708
Author(s) / Creator(s):
; ; ; ; ; ; ; ;
Publisher / Repository:
IEEE
Date Published:
ISSN:
2378-203X
ISBN:
979-8-3315-0647-6
Page Range / eLocation ID:
1437 to 1451
Subject(s) / Keyword(s):
Location:
Las Vegas, NV, USA
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
  2. Abstract The Doubly Connected Edge List (DCEL) is an edge-list structure widely used in spatial applications, primarily for planar topological and geometric computations. However, it is also applicable to various types of data, including 3D models and geographic data. An essential operation is theoverlay operation, which combines the DCELs of two input polygon layers and can easily support spatial queries on polygons like the intersection, union, and difference between these layers. However, existing techniques for spatial overlay operations suffer from two main limitations. First, they fail to handle many large datasets practically used in real applications. Second, they cannot handle arbitrary spatial lines that practically form polygons, e.g., city blocks, but they are given as a set of scattered lines. This work proposes a distributed and scalable way to compute the overlay operation and its related supported queries. Our operations also support arbitrary spatial lines through a scalable polygonization process. We address the issues of efficiently distributing the lines and overlay operators and offer various optimizations that improve performance. Our experiments demonstrate that the proposed scalable solution can efficiently compute the overlay of large real datasets. 
    more » « less
  3. Abstract We prove an equivariant version of the Cosmetic Surgery Conjecture for strongly invertible knots. Our proof combines a recent result of Hanselman with the Khovanov multicurve invariants. We apply the same techniques to reprove a result of Wang about the Cosmetic Crossing Conjecture and split links. Along the way, we show that Kh and BN detect if a Conway tangle is split. 
    more » « less