Search Results for author:
Found 24 papers, 17 papers with code
GPU sample sort
For uniformly distributed keys our sample sort is at least 25% and on average 68% faster than the best comparison-based sorting algorithm, GPU Thrust merge sort, and on average more than 2 times faster than GPU quicksort.
Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Distributed Evolutionary Graph Partitioning
We present a novel distributed evolutionary algorithm, KaFFPaE, to solve the Graph Partitioning Problem, which makes use of KaFFPa (Karlsruhe Fast Flow Partitioner).
Think Locally, Act Globally: Perfectly Balanced Graph Partitioning
We present a novel local improvement scheme for the perfectly balanced graph partitioning problem.
Parallel Graph Partitioning for Complex Networks
This paper addresses this problem by parallelizing and adapting the label propagation technique originally developed for graph clustering.
Graph Partitioning for Independent Sets
The core innovations of the algorithm are very natural combine operations based on graph partitioning and local search algorithms.
Route Planning in Transportation Networks
We survey recent advances in algorithms for route planning in transportation networks.
Data Structures and Algorithms G.2.1; G.2.2; G.2.3; H.2.8; H.3.5; H.4.2
Incorporating Road Networks into Territory Design
Given a set of basic areas, the territory design problem asks to create a predefined number of territories, each containing at least one basic area, such that an objective function is optimized.
n-Level Hypergraph Partitioning
Using label propagation local search is several times faster than hMetis and gives better quality than PaToH for a VLSI benchmark set.
Data Structures and Algorithms G.2.2; D.1.4
Finding Near-Optimal Independent Sets at Scale
To avoid this problem, we recursively choose vertices that are likely to be in a large independent set (using an evolutionary approach), then further kernelize the graph.
k-way Hypergraph Partitioning via n-Level Recursive Bisection
We develop a multilevel algorithm for hypergraph partitioning that contracts the vertices one at a time.
Data Structures and Algorithms
Concurrent Hash Tables: Fast and General?(!)
Concurrent hash tables are one of the most important concurrent data structures with numerous applications.
Data Structures and Algorithms D.1.3; E.1; E.2
Generating Semi-Synthetic Validation Benchmarks for Embryomics
Systematic validation is an essential part of algorithm development.
Engineering a Distributed Full-Text Index
The result is that our index answers counting queries up to 5. 5 times faster than the distributed suffix array, while using about the same space.
Data Structures and Algorithms
Efficient Random Sampling - Parallel, Vectorized, Cache-Efficient, and Online
We consider the problem of sampling $n$ numbers from the range $\{1,\ldots, N\}$ without replacement on modern architectures.
Data Structures and Algorithms Distributed, Parallel, and Cluster Computing Mathematical Software G.4; G.3; G.2
Engineering a direct k-way Hypergraph Partitioning Algorithm
We also remove several further bottlenecks in processing large hyperedges, develop a faster contraction algorithm, and a new adaptive stopping rule for local search.
Distributed Evolutionary k-way Node Separators
Computing high quality node separators in large graphs is necessary for a variety of applications, ranging from divide-and-conquer algorithms to VLSI design.
3D Cell Nuclei Segmentation with Balanced Graph Partitioning
Cell nuclei segmentation is one of the most important tasks in the analysis of biomedical images.
Communication-free Massively Distributed Graph Generation
Analyzing massive complex networks yields promising insights about our everyday lives.
Distributed, Parallel, and Cluster Computing Data Structures and Algorithms Social and Information Networks
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
We present a refinement framework for multilevel hypergraph partitioning that uses max-flow computations on pairs of blocks to improve the solution quality of a $k$-way partition.
Data Structures and Algorithms G.2.2; G.2.3
Linear Work Generation of R-MAT Graphs
R-MAT is a simple, widely used recursive model for generating `complex network' graphs with a power law degree distribution and community structure.
Data Structures and Algorithms Distributed, Parallel, and Cluster Computing Discrete Mathematics Social and Information Networks
Engineering In-place (Shared-memory) Sorting Algorithms
IPS$^4$o even outperforms the best integer sorting algorithms in a wide range of situations.
Distributed, Parallel, and Cluster Computing F.2.2
Scalable Shared-Memory Hypergraph Partitioning
With just four cores, Mt-KaHyPar is also slightly faster than the fastest sequential multilevel partitioner PaToH while producing better solutions on 83% of all instances.
Distributed, Parallel, and Cluster Computing
Vectorized and performance-portable Quicksort
Recent works showed that implementations of Quicksort using vector CPU instructions can outperform the non-vectorized algorithms in widespread use.
More Recent Advances in (Hyper)Graph Partitioning
In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms.
