DeepAI AI Chat
Log In Sign Up

Substream-Centric Maximum Matchings on FPGA

by   Maciej Besta, et al.

Developing high-performance and energy-efficient algorithms for maximum matchings is becoming increasingly important in social network analysis, computational sciences, scheduling, and others. In this work, we propose the first maximum matching algorithm designed for FPGAs; it is energy-efficient and has provable guarantees on accuracy, performance, and storage utilization. To achieve this, we forego popular graph processing paradigms, such as vertex-centric programming, that often entail large communication costs. Instead, we propose a substream-centric approach, in which the input stream of data is divided into substreams processed independently to enable more parallelism while lowering communication costs. We base our work on the theory of streaming graph algorithms and analyze 14 models and 28 algorithms. We use this analysis to provide theoretical underpinning that matches the physical constraints of FPGA platforms. Our algorithm delivers high performance (more than 4x speedup over tuned parallel CPU variants), low memory, high accuracy, and effective usage of FPGA resources. The substream-centric approach could easily be extended to other algorithms to offer low-power and high-performance graph processing on FPGAs.


page 3

page 13

page 14

page 15

page 16

page 17

page 22

page 26


Proceedings of the Workshop on High Performance Energy Efficient Embedded Systems (HIP3ES) 2019

Proceedings of the Workshop on High Performance Energy Efficient Embedde...

GPOP: A cache- and work-efficient framework for Graph Processing Over Partitions

The past decade has seen development of many shared-memory graph process...

WLAN Specific IoT Enable Power Efficient RAM Design on 40nm FPGA

Increasing the speed of computer is one of the important aspects of the ...

Accelerating Genome Sequence Analysis via Efficient Hardware/Algorithm Co-Design

Genome sequence analysis plays a pivotal role in enabling many medical a...

Accelerating Irregular Applications via Efficient Synchronization and Data Access Techniques

Irregular applications comprise an increasingly important workload domai...

Towards real-time and energy efficient Siamese tracking – a hardware-software approach

Siamese trackers have been among the state-of-the-art solutions in each ...

GraVF-M: Graph Processing System Generation for Multi-FPGA Platforms

Due to the irregular nature of connections in most graph datasets, parti...