# Window-based Streaming Graph Partitioning Algorithm

## TL;DR

This paper introduces WStream, a window-based streaming graph partitioning algorithm that efficiently partitions large graphs in a single pass, reducing load imbalance and edge cuts while minimizing communication.

## Contribution

The paper presents a novel window-based streaming algorithm for graph partitioning that improves efficiency and balance over existing streaming methods.

## Key findings

- WStream reduces load imbalance significantly.
- The algorithm minimizes edge cuts effectively.
- It performs well on real large-scale datasets.

## Abstract

In the recent years, the scale of graph datasets has increased to such a degree that a single machine is not capable of efficiently processing large graphs. Thereby, efficient graph partitioning is necessary for those large graph applications. Traditional graph partitioning generally loads the whole graph data into the memory before performing partitioning; this is not only a time consuming task but it also creates memory bottlenecks. These issues of memory limitation and enormous time complexity can be resolved using stream-based graph partitioning. A streaming graph partitioning algorithm reads vertices once and assigns that vertex to a partition accordingly. This is also called an one-pass algorithm. This paper proposes an efficient window-based streaming graph partitioning algorithm called WStream. The WStream algorithm is an edge-cut partitioning algorithm, which distributes a vertex among the partitions. Our results suggest that the WStream algorithm is able to partition large graph data efficiently while keeping the load balanced across different partitions, and communication to a minimum. Evaluation results with real workloads also prove the effectiveness of our proposed algorithm, and it achieves a significant reduction in load imbalance and edge-cut with different ranges of dataset.