Prospects of Solving Grand Challenge Problems
Rajan Gupta
Abstract
The recent woes of the supercomputer industry and changes in federal funding have caused some scientists to re-evaluate the means by which they hope to solve Grand Challenge problems. I evaluate the potential of Massively Parallel Processors (MPP) within this context and the state of today's MPP. I stress that for solving large-scale problems MPP are crucial and that it is essential to seek a balance between CPU performance, memory access time, inter-node communications, and I/O. To achieve this it is important to preserve certain characteristics of the hardware while selecting the hottest processor to design the machine around. I emphasize that for long term stability and growth of parallel computing priority should be given to standardizing software so that the same code can run on different platforms and on machines ranging from clusters of workstations to MPP.
Create a lesson
Related papers
Computability of GPDs near x=ξ in Lattice QCD
Yushan Su, Xiangdong Ji, Yizhuang Liu et al.
Numerical Investigations of Phase Transitions in Lattice Field Theories
Vamika Longia
Symplectic lattice gauge theories in the Grid framework: domain wall fermions and continuum extrapolations
Ed Bennett, Peter A. Boyle, Luigi Del Debbio et al.
The soft-gluon limit of the Landau gauge ghost-gluon vertex: results for pure Yang-Mills SU(3) theory from lattice simulations
Nuno Brito, Orlando Oliveira, Paulo J. Silva
Testing strong isospin breaking effects in QCD thermodynamics
D. A. Clarke, B. B. Brandt
A Vector-Vector-Axial Anomaly in 4D
Evan Berkowitz, Shi Chen, Aleksey Cherman