BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:1.0
BEGIN:VEVENT
DTSTART:20111117T213000Z
DTEND:20111117T220000Z
LOCATION:TCC 304
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: QCD is a computationally challenging problem that solves the discretized Dirac equation. Its key operation is a matrix-vector product (Dslash operator). We have developed a novel multi-core architecture-friendly Wilson-Dslash operator which delivers 75Gflops (single-precision) on Intel Xeon processor, achieving 60% computational efficiency for datasets that fit in the last-level cache. For larger datasets, performance drops to 50Gflops. Our performance is 2-3x higher than a well-known Chroma implementation when running on the same hardware platform. The novel implementation of QCD reported is based on recently published 3.5D spatial and 4.5D temporal tiling schemes. Both schemes significantly reduce QCD external memory bandwidth requirements, delivering a more compute-bound implementation. The performance advantage of our schemes will become more significant as the gap between compute and memory bandwidth continues to grow. We further demonstrate very good cluster-level scalability achieving 4Tflops using 128 nodes for 32x32x32×256 lattice and 3Tflops for the full CG solver.
SUMMARY:High-Performance Lattice QCD for Multi-core Based Parallel Systems Using a Cache-Friendly Hybrid Threaded-MPI Approach
PRIORITY:3
END:VEVENT
END:VCALENDAR