T. Oppelstrup, D. Jefferson, V. Bulatov, L. Zepeda-Ruiz
{"title":"精确平行动力学蒙特卡洛150万任务","authors":"T. Oppelstrup, D. Jefferson, V. Bulatov, L. Zepeda-Ruiz","doi":"10.1145/2901378.2901403","DOIUrl":null,"url":null,"abstract":"We have created a scalable implementation of the kinetic Monte-Carlo method, SPOCK (Scalable Parallel Optimistic Crystal Kinetics). Unlike most reported parallel implementations relying on approximation to achieve parallelism, our parallelization is exact and accomplished using the Time Warp paradigm. We demonstrate that our implementation exhibits near perfect scaling for two different and important classes of systems. It runs efficiently on Vulcan, a 24 thousand node BlueGene/Q machine, using all ~400 thousand cores and ~1.6 million MPI tasks. Further, we have run production simulations using the full Vulcan machine and requiring nearly all available system memory. In this paper we demonstrate these results, and discuss some important implementation details. The kinetic Monte-Carlo method is ubiquitous within the natural sciences, and important classes of problems have so far been limited to sequential simulation. For many scientific simulations, an exact parallel implementation of the kinetic Monte-Carlo method has the potential of being game changing.","PeriodicalId":325258,"journal":{"name":"Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"SPOCK: Exact Parallel Kinetic Monte-Carlo on 1.5 Million Tasks\",\"authors\":\"T. Oppelstrup, D. Jefferson, V. Bulatov, L. Zepeda-Ruiz\",\"doi\":\"10.1145/2901378.2901403\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We have created a scalable implementation of the kinetic Monte-Carlo method, SPOCK (Scalable Parallel Optimistic Crystal Kinetics). Unlike most reported parallel implementations relying on approximation to achieve parallelism, our parallelization is exact and accomplished using the Time Warp paradigm. We demonstrate that our implementation exhibits near perfect scaling for two different and important classes of systems. It runs efficiently on Vulcan, a 24 thousand node BlueGene/Q machine, using all ~400 thousand cores and ~1.6 million MPI tasks. Further, we have run production simulations using the full Vulcan machine and requiring nearly all available system memory. In this paper we demonstrate these results, and discuss some important implementation details. The kinetic Monte-Carlo method is ubiquitous within the natural sciences, and important classes of problems have so far been limited to sequential simulation. For many scientific simulations, an exact parallel implementation of the kinetic Monte-Carlo method has the potential of being game changing.\",\"PeriodicalId\":325258,\"journal\":{\"name\":\"Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2901378.2901403\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2901378.2901403","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
SPOCK: Exact Parallel Kinetic Monte-Carlo on 1.5 Million Tasks
We have created a scalable implementation of the kinetic Monte-Carlo method, SPOCK (Scalable Parallel Optimistic Crystal Kinetics). Unlike most reported parallel implementations relying on approximation to achieve parallelism, our parallelization is exact and accomplished using the Time Warp paradigm. We demonstrate that our implementation exhibits near perfect scaling for two different and important classes of systems. It runs efficiently on Vulcan, a 24 thousand node BlueGene/Q machine, using all ~400 thousand cores and ~1.6 million MPI tasks. Further, we have run production simulations using the full Vulcan machine and requiring nearly all available system memory. In this paper we demonstrate these results, and discuss some important implementation details. The kinetic Monte-Carlo method is ubiquitous within the natural sciences, and important classes of problems have so far been limited to sequential simulation. For many scientific simulations, an exact parallel implementation of the kinetic Monte-Carlo method has the potential of being game changing.