Non-relational database systems (NRDS) such as graph and key-value have gained attention in various trending business and analytical application domains. However, while …
Graph processing has become an important part of various areas, such as machine learning, computational sciences, medical applications, social network analysis, and many …
Y Chi, L Guo, J Cong - Proceedings of the 2022 ACM/SIGDA …, 2022 - dl.acm.org
The single-source shortest path (SSSP) problem is one of the most important and well- studied graph problems widely used in many application domains, such as road navigation …
S Murray, W Floyd-Jones, G Konidaris… - 2019 IEEE 30th …, 2019 - ieeexplore.ieee.org
We have designed a programmable architecture to accelerate collision detection and graph search, two of the principal components of robotic motion planning. The programmability …
K Matsumoto, N Nakasato… - 2011 IEEE International …, 2011 - ieeexplore.ieee.org
This paper presents a blocked algorithm for the all-pairs shortest paths (APSP) problem for a hybrid CPU-GPU system. In the blocked APSP algorithm, the amount of data communication …
This paper present a framework for automatic mapping of perfectly nested loops with constant dependences onto regular processor arrays, suitable for direct implementation on …
Modern robots are complex heterogeneous systems composed of different Processing Elements (PEs) with multiple sensors and actuators. This implies that different experts are …
T Okuyama, F Ino, K Hagihara - International Journal of …, 2012 - inderscienceonline.com
This paper proposes an acceleration method for finding the all-pairs shortest paths (APSPs) using the graphics processing unit (GPU). Our method is based on Harish's iterative …
T Okuyama, F Ino, K Hagihara - 2008 IEEE International …, 2008 - ieeexplore.ieee.org
This paper proposes a fast method for computing the costs of all-pairs shortest paths (APSPs) on the graphics processing unit (GPU). The proposed method is implemented …