A comparative study of massive flock simulations on the cpu and the gpu
| dc.contributor.author | Runvik, Arvid | |
| dc.contributor.author | Karlsson, Leo | |
| dc.contributor.author | Hallqvist, Elias | |
| dc.contributor.author | Lyrstrand, Oskar | |
| dc.contributor.author | Kraft, Jonathan | |
| dc.contributor.department | Chalmers tekniska högskola / Institutionen för data och informationsteknik | sv |
| dc.contributor.examiner | Ahrendt, Wolfgang | |
| dc.contributor.supervisor | Fratarcangeli, Marco | |
| dc.date.accessioned | 2020-10-20T08:21:00Z | |
| dc.date.available | 2020-10-20T08:21:00Z | |
| dc.date.issued | 2019 | sv |
| dc.date.submitted | 2020 | |
| dc.description.abstract | This paper describes how large scale flocks can be simulated efficiently with modern computer graphics using parallelization techniques and spatial data structures. The results show that parallelism is essential in improving performance, both in CPU and GPU implementations. Best performance was achieved using CUDA, uniform grid, and batching which resulted in a simulation of two million agents at a frame rate of 30 frames per second. The simulation was extended with a graphical user interface, predators, colours and user interaction in order to create a simple game. | sv |
| dc.identifier.coursecode | DATX02 | sv |
| dc.identifier.uri | https://hdl.handle.net/20.500.12380/301922 | |
| dc.language.iso | eng | sv |
| dc.setspec.uppsok | Technology | |
| dc.subject | Craig Reynolds | sv |
| dc.subject | Simulation | sv |
| dc.subject | Flock | sv |
| dc.subject | Herd | sv |
| dc.subject | School | sv |
| dc.subject | Multithreading | sv |
| dc.subject | Parallelism | sv |
| dc.subject | GPGPU | sv |
| dc.subject | CUDA | sv |
| dc.subject | TBB | sv |
| dc.subject | Agent | sv |
| dc.subject | Spatial Hashing | sv |
| dc.title | A comparative study of massive flock simulations on the cpu and the gpu | sv |
| dc.type.degree | Examensarbete på kandidatnivå | sv |
| dc.type.uppsok | M2 |