Please use this identifier to cite or link to this item:
http://10.1.7.192:80/jspui/handle/123456789/9196
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Vadiwala, Priyanka | - |
dc.date.accessioned | 2020-07-22T06:49:13Z | - |
dc.date.available | 2020-07-22T06:49:13Z | - |
dc.date.issued | 2019-06-01 | - |
dc.identifier.uri | http://10.1.7.192:80/jspui/handle/123456789/9196 | - |
dc.description.abstract | Plasma, the 4th matter can be simulated using fluid models, kinetic models and hybrid models. Out of these kinetic models are most accurate but simultaneously computation- ally most expensive too. Kinetic modelling involves study of plasma using molecular dynamics simulations. This method track the evolution of millions of charged particles based on its interactions. As time duration for which simulation is to be carried out and number of charged particles are huge serial code takes tremendous time to complete simulation. Multi-level and multi-tire level for simultaneous execution for varied param- eters so simulation time can be reduced extensively by parallelizing the code using these and reducing memory intensive operations. The speed performance can be evaluated by comparing simulation time of the parallel code and serial code. | en_US |
dc.publisher | Institute of Technology | en_US |
dc.relation.ispartofseries | 17MCEN14; | - |
dc.subject | Computer 2017 | en_US |
dc.subject | Project Report 2017 | en_US |
dc.subject | Computer Project Report | en_US |
dc.subject | Project Report | en_US |
dc.subject | 17MCEN | en_US |
dc.subject | 17MCEN14 | en_US |
dc.subject | NT | en_US |
dc.subject | NT 2017 | en_US |
dc.subject | CE (NT) | en_US |
dc.title | Optimizing Code Parallelization for Molecular Dynamics Simulations | en_US |
dc.type | Dissertation | en_US |
Appears in Collections: | Dissertation, CE (NT) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
17mcen14.pdf | 17mcen14 | 2.06 MB | Adobe PDF | ![]() View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.