Technology / WORLD

Anechoic speeds Max-Cut trials on an FPGA

Researchers at ETH Zurich and Yonsei University developed a parallel FPGA system for Max-Cut optimization. For the K2000 case, the paper gives a 99% target success-probability threshold for a 12-engine portfolio at a 0.05 ms round time.

The source does not state the event date; the period shown is the source review period.

Reading sizeSources ↓Share story ↗
Conceptual illustration of technology, processors and connected information.Illustration
Symbolic illustration

Anechoic applies a correction intended to reduce the return of a previous step’s influence when an Ising machine updates spins in parallel. The team implemented the algorithm as hand-written RTL engines on an AMD Alveo V80 FPGA and evaluated it on the fully connected, 2,000-node K2000 Max-Cut instance.

Twelve engines running at 250 MHz reached the paper’s TTS99 portfolio threshold for a cut of at least 33,000 on K2000 at a 0.05 ms round time. The paper estimates this probability from p=0.338 measured over 2,052 single trials; 99% is not an observed success rate across those trials. Energy was reported as 5.4 mJ per solution. The 22 nm ASIC results are estimates, not measurements from a manufactured chip.

Data

Table

FPGA Max-Cut benchmark

Measurements are for the 2,000-node K2000 instance.

1299K2000; 12-engine portfolio, 0.05 ms round; 99% target threshold estimated from 2,052 single trials
Methodology

Twelve engines at 250 MHz on an AMD Alveo V80 FPGA were tested for the time and probability of reaching a cut of at least 33,000 over 2,052 trials.

Updated:

Structured coverage

Subjects and places

Subject proposals

Taxonomy version: IPTC Media Topics 2026-Q2

Continue reading

Technology

AWS study finds PostgreSQL prewarming cuts restore delays

AWS compared Amazon RDS for PostgreSQL instances restored from the same snapshot. One 1,200-GiB database on gp3 was prewarmed with 15 parallel pg_prewarm sessions; another hydrated passively. The first instance completed storage initialization in about five hours.

AWS Database Blog1 min read Data included
Technology

AlphaNIST trains a robot assembly policy in simulation

Researchers tested multi-step assembly using one reinforcement-learning policy with sparse rewards.

arXiv preprint by NVIDIA and University of Washington researchers1 min read Data included