Search Results for author: Masatoshi Hanai

Found 4 papers, 1 papers with code

Time-Efficient and High-Quality Graph Partitioning for Graph Dynamic Scaling

no code implementations18 Jan 2021 Masatoshi Hanai, Nikos Tziritas, Toyotaro Suzumura, Wentong Cai, Georgios Theodoropoulos

In the case of distributed graph processing, changing the number of the graph partitions while maintaining high partitioning quality imposes serious computational overheads as typically a time-consuming graph partitioning algorithm needs to execute each time repartitioning is required.

graph partitioning Distributed, Parallel, and Cluster Computing Databases Discrete Mathematics Data Structures and Algorithms Social and Information Networks

Performance Evaluation of Dynamic Scaling on MPI

1 code implementation30 Dec 2019 Masatoshi Hanai, Georgios Theodoropoulos

Our dynamic scaling implementation allows the new MPI processes from new hosts to communicate with the original ones immediately.

Distributed, Parallel, and Cluster Computing

Cannot find the paper you are looking for? You can Submit a new open access paper.