BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:1.0
BEGIN:VEVENT
DTSTART:20141118T231500Z
DTEND:20141119T010000Z
LOCATION:New Orleans Theater Lobby
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: Monte Carlo (MC) search with Metropolis judgment has been used widely to solve inverse problems; in particular, reverse Monte Carlo (RMC) analysis has been shown to make a possible configration of particles in terms of the structure factor S(q) obtained by X-ray scattering experiments. In general, MC search proceeds sequentially, because each judgement of the MC trial depends on its previous state. In the present study, we have developed a new “SimpleRMC” parallel code for RMC analysis for a system with millions of particles. In this code, two hotspots are identified and optimized for the histogram h(r) and difference of histogram Δh(r) calculations. For the histogram kernel, we achieved 339 Tflops performance (32.3% of the peak) on 8,192 nodes of the K computer using a 33,554,432-particle system. This newly developed “prediction–correction” method improves both the parallel performance of the Δh(r) calculation and its elapse time.
SUMMARY:New Parallelization Model of Sequential Monte Carlo Analysis with Prediction-Correction Computing
PRIORITY:3
END:VEVENT
END:VCALENDAR