12 citations · 12 across the 5 of their papers we have counts for
4 papers · 1 filter
Overcoming Latency-bound Limitations of Distributed Graph Algorithms using the HPX Runtime System
Karame Mohammadiporshokooh, Panagiotis Syskakis, Andrew Lumsdaine +1
Graph processing at scale presents many challenges, including the irregular structure of graphs, the latency-bound nature of graph algorithms, and the overhead associated with dist…
An Initial Evaluation of Distributed Graph Algorithms using NWGraph and HPX
Karame Mohammadiporshokooh, Panagiotis Syskakis, Hartmut Kaiser
Graphs are central to modeling relationships in scientific computing, data analysis, and AI/ML, but their growing scale can exceed the memory and compute capacity of single nodes,…
A New Execution Model and Executor for Adaptively Optimizing the Performance of Parallel Algorithms Using HPX Runtime System
Karame Mohammadiporshokooh, Steven R. Brandt, Hartmut Kaiser
Developing parallel algorithms efficiently requires careful management of concurrency across diverse hardware architectures. C++ executors provide a standardized interface that sim…
Quantifying Overheads in Charm++ and HPX using Task Bench
Nanmiao Wu, Ioannis Gonidelis, Simeng Liu +6
Asynchronous Many-Task (AMT) runtime systems take advantage of multi-core architectures with light-weight threads, asynchronous executions, and smart scheduling. In this paper, we…