How to Keep a Supercomputer from Gridlock ✎ express

Original: "Exploiting Parallelism on Shared Memory in the QED Particle-in-Cell Code PICADOR with Greedy Load Balancing"
arXiv:1905.08217 · 2019-05-20 · arXiv non-exclusive · independent analysis · 1 min
Scientists have found a way to evenly distribute particles among processors, making laser plasma simulations tens of times faster.

📄 Showing the "Simple" version — "Advanced" is not ready yet. Add it to favorites to help prioritize it.

A supercomputer simulating laser plasma is like a kitchen where hundreds of chefs are preparing a single dish. If ten people crowd around one stove while another stands empty, the work grinds to a halt. The same happens in simulations: plasma particles bunch up in certain regions of space, leaving others nearly empty. Processors assigned to the 'hot' zones work at full tilt, while the rest wait.

The authors of the study proposed cutting each computational cell into small chunks, like dicing vegetables for a salad so each chef gets a handful. These chunks are dynamically handed out to free processor threads. If one region gets too crowded, the chunks are split even finer and redistributed. This way, the load balances itself without manual tuning.

In experiments on one-, two-, and three-dimensional problems, the new method proved 2.1–10 times faster than previous schemes in the PICADOR code.

This means the same calculations can be done on fewer computers or in less time. For physicists studying quantum cascades in extreme laser fields, this speed is a chance to test hypotheses faster and move toward new discoveries.

In one test, the processor load changed every few microseconds of simulated time, as if a checkout line were rearranging itself dozens of times per second.

In Liu Cixin's novel 'The Three-Body Problem,' aliens solve a similar problem of distributed computing, but on a galactic scale.

Scientists
Erwin SchrödingerHugh Everett IIIDavid DeutschJohn Stewart BellLouis de BroglieLov Grover
Concepts
parallel processing quantum algorithm hybrid algorithm memory memory cell quantum computing resource optimization supercomputer data center error propagation medicine complexity gpu quantum key distribution scalable quantum computer lattice calculation lattice qcd graphics card rydberg atom simulator kinetic simulation braiding