HU Qiang-qiang, Jiang Shun-liang, Xu Shao-ping, Dong Tian-wen
{"title":"基于CUDA的离散粒子系统仿真与实现","authors":"HU Qiang-qiang, Jiang Shun-liang, Xu Shao-ping, Dong Tian-wen","doi":"10.1109/BCGIN.2011.132","DOIUrl":null,"url":null,"abstract":"In this paper, NVIDIA's parallel computing architecture CUDA is used to implement a discrete particle simulation system. In the neighbor search part, an algorithm based on hash list is used. In the collision part, the stream of CUDA is used to split one step simulation to four parallel streams, the asynchronous copy method is used to output, then an efficient way to use the CUDA memory model is designed. The results shown that the CUDA's discrete particle system is efficient and effective.","PeriodicalId":127523,"journal":{"name":"2011 International Conference on Business Computing and Global Informatization","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"The Simulation and Implementation of Discrete Particle System based on CUDA\",\"authors\":\"HU Qiang-qiang, Jiang Shun-liang, Xu Shao-ping, Dong Tian-wen\",\"doi\":\"10.1109/BCGIN.2011.132\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, NVIDIA's parallel computing architecture CUDA is used to implement a discrete particle simulation system. In the neighbor search part, an algorithm based on hash list is used. In the collision part, the stream of CUDA is used to split one step simulation to four parallel streams, the asynchronous copy method is used to output, then an efficient way to use the CUDA memory model is designed. The results shown that the CUDA's discrete particle system is efficient and effective.\",\"PeriodicalId\":127523,\"journal\":{\"name\":\"2011 International Conference on Business Computing and Global Informatization\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Business Computing and Global Informatization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BCGIN.2011.132\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Business Computing and Global Informatization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BCGIN.2011.132","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Simulation and Implementation of Discrete Particle System based on CUDA
In this paper, NVIDIA's parallel computing architecture CUDA is used to implement a discrete particle simulation system. In the neighbor search part, an algorithm based on hash list is used. In the collision part, the stream of CUDA is used to split one step simulation to four parallel streams, the asynchronous copy method is used to output, then an efficient way to use the CUDA memory model is designed. The results shown that the CUDA's discrete particle system is efficient and effective.