A computation of D(9) using FPGA Supercomputing

04/06/2023
by   Lennart Van Hirtum, et al.
0

This preprint makes the claim of having computed the 9^th Dedekind Number. This was done by building an efficient FPGA Accelerator for the core operation of the process, and parallelizing it on the Noctua 2 Supercluster at Paderborn University. The resulting value is 286386577668298411128469151667598498812366. This value can be verified in two steps. We have made the data file containing the 490M results available, each of which can be verified separately on CPU, and the whole file sums to our proposed value.

READ FULL TEXT
research
07/03/2018

Best-Effort FPGA Programming: A Few Steps Can Go a Long Way

FPGA-based heterogeneous architectures provide programmers with the abil...
research
08/23/2022

Accelerating Monte-Carlo Tree Search on CPU-FPGA Heterogeneous Platform

Monte Carlo Tree Search (MCTS) methods have achieved great success in ma...
research
12/23/2021

Hardware Support for FPGA Resource Elasticity

FPGAs are increasingly being deployed in the cloud to accelerate diverse...
research
08/20/2021

Power Reduction of Automatic Heterogeneous Device Offloading

In recent years, utilization of heterogeneous hardware other than small ...
research
04/14/2022

A Unified Programming Model for Heterogeneous Computing with CPU and Accelerator Technologies

This paper consists of three parts. The first part provides a unified pr...
research
02/23/2012

How to Bypass Verified Boot Security in Chromium OS

Verified boot is an interesting feature of Chromium OS that supposedly c...
research
08/15/2022

ECI: a Customizable Cache Coherency Stack for Hybrid FPGA-CPU Architectures

Unlike other accelerators, FPGAs are capable of supporting cache coheren...

Please sign up or login with your details

Forgot password? Click here to reset