V
Vitaly Osipov
Researcher at Karlsruhe Institute of Technology
Publications - 18
Citations - 661
Vitaly Osipov is an academic researcher from Karlsruhe Institute of Technology. The author has contributed to research in topics: Graph partition & Auxiliary memory. The author has an hindex of 13, co-authored 18 publications receiving 630 citations. Previous affiliations of Vitaly Osipov include Max Planck Society.
Papers
More filters
Proceedings ArticleDOI
GPU sample sort
TL;DR: In this paper, the authors present a sample sort algorithm for manycore GPUs, which is robust to different distributions and entropy levels of keys and scales almost linearly with the input size.
Journal ArticleDOI
PEPPHER: Efficient and Productive Usage of Hybrid Computing Systems
Siegfried Benkner,Sabri Pllana,Jesper Larsson Träff,Philippas Tsigas,Uwe Dolinsky,C. Augonnet,Beverly Bachmayer,Christoph Kessler,David Moloney,Vitaly Osipov +9 more
TL;DR: This article outlines the PEPPHER performance-aware component model, performance prediction means, runtime system, and other aspects of the project that address efficient utilization of hybrid systems consisting of multicore CPUs with GPU-type accelerators.
PEPPHER: Ecient and Productive Usage of Hybrid Computing Systems
Siegfried Benkner,Sabri Pllana,Philippas Tsigas,Uwe Dolinsky,Beverly Bachmayer,Christoph Kessler,David Moloney,Vitaly Osipov +7 more
Proceedings Article
The Filter-Kruskal minimum spanning tree algorithm
TL;DR: A simple modification of Kruskal's algorithm that avoids sorting edges that are "obviously" not in the MST, and has very good practical performance over the entire range of edge densities.
Book ChapterDOI
Improved external memory BFS implementations
TL;DR: The implementation of the deterministic variant of MM_BFS is presented and it is shown that in most cases, it outperforms the randomized variant, and the running time for BFS traversal is improved with a heuristic that preserves the worst case guarantees of MM-BFS.