SCHEDULE: NOV 16-22, 2013
When viewing the Technical Program schedule, on the far righthand side is a column labeled "PLANNER." Use this planner to build your own schedule. Once you select an event and want to add it to your personal schedule, just click on the calendar icon of your choice (outlook calendar, ical calendar or google calendar) and that event will be stored there. As you select events in this manner, you will have your own schedule to guide you through the week.
Enabling Low I/O-Cost Fine-Grained Checkpointing in QMCPack
SESSION: ACM Student Research Competition Poster Reception
EVENT TYPE: ACM Student Research Competition Posters, ACM Student Research Competition
TIME: 5:15PM - 7:00PM
AUTHOR(S):Michael Matheny
ROOM:Mile High Pre-Function
ABSTRACT:
As simulation size increases, the likelihood of a node crash and the cost of checkpointing increases. This is more of a problem as flops increase exponentially while I/O speeds increase at a slower rate. The cost of saving data is even higher when checkpointed data is used for in-situ or in-transit analyses such as for visualization or for atom proximity identifications.
QMCPack is one such example that is limited by its checkpointing implementation. QMCPack uses serial HDF5 to write checkpointing data to disk. As the number of processes increase, the associated I/O cost grows significantly. Preliminary results showed that even for simple simulations, the time spent in I/O associated to a checkpointing could make up 90% of the execution time on systems with large numbers of nodes. In this poster we use ADIOS to tackle the problem of enabling more efficient fine-grained checkpointing in QMCPack while limiting the I/O overhead.
Chair/Author Details:
Michael Matheny - University of Delaware
Click here to download .ics calendar file
