Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Oded Green"'
Publikováno v:
2022 IEEE/ACM Workshop on Irregular Applications: Architectures and Algorithms (IA3).
Publikováno v:
2022 IEEE High Performance Extreme Computing Conference (HPEC).
Autor:
Oded Green
Publikováno v:
ACM Transactions on Parallel Computing. 8:1-17
In this article, we introduce HashGraph, a new scalable approach for building hash tables that uses concepts taken from sparse graph representations—hence, the name HashGraph. HashGraph introduces a new way to deal with hash-collisions that does no
Publikováno v:
2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC).
Autor:
Oded Green
Publikováno v:
2021 IEEE High Performance Extreme Computing Conference (HPEC).
Autor:
Alok Tripathy, Oded Green
Publikováno v:
IEEE BigData
Point-to-point shortest path (PPSP), or s-t connectivity, is a variant of the shortest path problem found in graph theory. In this problem, we are given a graph and pairs of vertices over time, and the output is the shortest path between each pair of
Publikováno v:
HPEC
Scale free networks are abundant in many natural, social, and engineering phenomena for which there exists a substantial corpus of theory able to elucidate many of their underlying properties. In this paper we study the scalability of some widely ava
Publikováno v:
FTXS@SC
For the problem of computing the connected components of a graph, this paper considers the design of algorithms that are resilient to transient hardware faults, like bit flips. More specifically, it applies the technique of \emph{self-stabilization}.
Autor:
Oded Green
Publikováno v:
IEEE Transactions on Image Processing. 27:2217-2228
Median filtering is a smoothing technique for noise removal in images. While there are various implementations of median filtering for a single-core CPU, there are few implementations for accelerators and multi-core systems. Many parallel implementat
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 28:2428-2439
We present an efficient distributed memory parallel algorithm for computing connected components in undirected graphs based on Shiloach-Vishkin’s PRAM approach. We discuss multiple optimization techniques that reduce communication volume as well as