This paper presents techniques for speeding up commonly used algorithms forbounding volume (BV) computation, such as the AABB, sphere and k-DOP. Byexploiting the possibilities of parallelismin modern processors, the result exceedsthe expected theoretical result. The methods focus on data-level-parallelism(DLP) using Intel’s SSE instructions, for operations on 4 parallel independentsingle precision floating point values, with a theoretical speed-up factor of 4 ondata throughput. Still, a speed-up between 7–9 are shown in the computation ofAABBs and k-DOPs. For the computation of tight fitting spheres the speed-upfactor halts at approximately 4 due to a limiting data dependency. In addition,further parallelization by multithreading algorithms on multi-core CPUs showsspeed-up factors of 14 on 2 cores and reaching 25 on 4 cores, compared to nonparallel algorithms.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:mdh-9439 |
| Date | January 2010 |
| Creators | Winberg, Olov, Karlsson, Mattias |
| Publisher | Mälardalens högskola, Akademin för innovation, design och teknik, Mälardalens högskola, Akademin för innovation, design och teknik |
| Source Sets | DiVA Archive at Upsalla University |
| Language | Swedish |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0019 seconds