Fig. 1From: Distributed large-scale graph processing on FPGAsa A given sample graph. b Edge blocks results of preprocessing concept [48]. The ❶, ❷, ❸ and ❹ are referred to as the produced edge blocks using GridGraph partitioning [73]. Here, the number of partitions is P = 2, producing \(P^2\) edge blocksBack to article page