Loading...

Parallelizing Voronoi Diagrams and Polygon Overlaying Algorithms for Multi-core Systems

Tavakoli Ghinani, Mohammad | 2011

1118 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 42295 (19)
  4. University: Sharif University of Technology
  5. Department: Computer Engineering
  6. Advisor(s): Ghodsi, Mohammad
  7. Abstract:
  8. Todays we do not have the traditional hardware speed acceleration anymore. We have reached to the highest possible speed of single core processors. Thus, in order to run an algorithm faster we need either to improve the algorithm and make it more efficient, or to use a more powerful hardware to run it. For algorithms which we have reached to their lower bounds, we can not improve their efficiency. Furthermore, we can not have any faster traditional processor, so the only way is to use the power of parallel computation. With the advent of multicore processors the software industry has faced a new challenge, to adapt the softwares to use the power of these new processors. There are a lot of usage of these processors in the field of computational geometry, since the usual problems in this field have a lot of inputs. Most of researches in the field of parallel computational geometry were consist of finding the lower bound of algorithms with having polynomial number of processors. But the multicore algorithms is talking about the real speed up in case of having two, four or more processors. In this dissertation voronoi diagram algorithm and polygons overlaying algorithm have been converted for multicore processors. We have obtained a good speedup for both of them
  9. Keywords:
  10. Parallel Algorithm ; Computational Geometry ; Voronoi Diagram ; Multi-Core Algorithms ; Polygons Overlapping

 Digital Object List

 Bookmark