Academic Journal
On Parallelization of Graph Algorithms, Performance Modelling and Autonomous 3D Printable Object Synthesis
| Title: | On Parallelization of Graph Algorithms, Performance Modelling and Autonomous 3D Printable Object Synthesis |
|---|---|
| Authors: | Syed, Shams-ul-Haq |
| Source: | Theses and Dissertations |
| Publisher Information: | Scholar Commons |
| Publication Year: | 2024 |
| Collection: | University of South Carolina Libraries: Scholar Commons |
| Subject Terms: | 3D object synthesis, graph algorithm, high performence computing, parallel graph algorithm, roofline model, vertex connectivity, Computer Sciences, Physical Sciences and Mathematics |
| Description: | The degree of hardware level parallelism offered by today’s GPU architecture makes it ideal for problem domains with massive inherent parallelism potential, fields such as computer vision, image processing, graph theory and graph computations. We have identified three problem areas for purpose of this research dissertation, under the umbrella of performance improvement by harnessing the power of GPUs for novel applications. The first area is concerned with k-vertex connectivity in graph theory, the second area deals performance evaluation using extended roofline models for GPU parallel applications and finally the third problem area is related to synthesis 3D printable objects from 2D images. In this thesis we examined k-vertex connectivity in undirected graphs, its applications and measure the performance of GPU computations using the CUDA Toolkit. Matthews and Sumner in 1984 presented the conjecture that every 4-connected claw-free graph is Hamiltonian. In the initial paper [1] it was shown that every 3-connected claw-free graph on fewer than 20 vertices is Hamiltonian. Over the years there have been several papers establishing the result for connectivity higher than 4. So, all that remains is the case for 4 connected claw-free graphs conjectured by C. Thomassen [2]. We present a new CUDA based parallel k-vertex connectivity test algorithm to determine the connectivity of any vi given claw-free graph. The parallel algorithm is several orders of magnitude faster when compared to the serial counterpart. It is a major step towards efficiently finding whether the conjecture holds for graphs with connectivity exactly equal to 4. Our parallel algorithm can also be applied to find the value of k (connectedness) for a given graph. It is validated using number of different types of graphs such as complete graphs, complete bipartite graphs, and chorded cycle graphs of sizes ranging from ����,�� , 20 ≤ �� ≤ 300. For GPU architecture we proposed the unified cache aware roofline model which provides better insights by ... |
| Document Type: | text |
| File Description: | application/pdf |
| Language: | English |
| Relation: | https://scholarcommons.sc.edu/etd/7672; https://scholarcommons.sc.edu/context/etd/article/8580/viewcontent/877703.pdf |
| Availability: | https://scholarcommons.sc.edu/etd/7672 https://scholarcommons.sc.edu/context/etd/article/8580/viewcontent/877703.pdf |
| Rights: | © 2024, Shams-ul-Haq Syed |
| Accession Number: | edsbas.6D648A29 |
| Database: | BASE |
| Description not available. |