Academic Journal
On Parallelization of Graph Algorithms, Performance Modelling and Autonomous 3D Printable Object Synthesis
| Τίτλος: | On Parallelization of Graph Algorithms, Performance Modelling and Autonomous 3D Printable Object Synthesis |
|---|---|
| Συγγραφείς: | Syed, Shams-ul-Haq |
| Πηγή: | Theses and Dissertations |
| Στοιχεία εκδότη: | Scholar Commons |
| Έτος έκδοσης: | 2024 |
| Συλλογή: | University of South Carolina Libraries: Scholar Commons |
| Θεματικοί όροι: | 3D object synthesis, graph algorithm, high performence computing, parallel graph algorithm, roofline model, vertex connectivity, Computer Sciences, Physical Sciences and Mathematics |
| Περιγραφή: | 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 ... |
| Τύπος εγγράφου: | text |
| Περιγραφή αρχείου: | application/pdf |
| Γλώσσα: | English |
| Relation: | https://scholarcommons.sc.edu/etd/7672; https://scholarcommons.sc.edu/context/etd/article/8580/viewcontent/877703.pdf |
| Διαθεσιμότητα: | https://scholarcommons.sc.edu/etd/7672 https://scholarcommons.sc.edu/context/etd/article/8580/viewcontent/877703.pdf |
| Rights: | © 2024, Shams-ul-Haq Syed |
| Αριθμός Καταχώρησης: | edsbas.6D648A29 |
| Βάση Δεδομένων: | BASE |
| FullText | Text: Availability: 0 CustomLinks: – Url: https://scholarcommons.sc.edu/etd/7672# Name: EDS - BASE (ns324271) Category: fullText Text: View record from BASE |
|---|---|
| Header | DbId: edsbas DbLabel: BASE An: edsbas.6D648A29 RelevancyScore: 880 AccessLevel: 3 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 879.707946777344 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: On Parallelization of Graph Algorithms, Performance Modelling and Autonomous 3D Printable Object Synthesis – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Syed%2C+Shams-ul-Haq%22">Syed, Shams-ul-Haq</searchLink> – Name: TitleSource Label: Source Group: Src Data: Theses and Dissertations – Name: Publisher Label: Publisher Information Group: PubInfo Data: Scholar Commons – Name: DatePubCY Label: Publication Year Group: Date Data: 2024 – Name: Subset Label: Collection Group: HoldingsInfo Data: University of South Carolina Libraries: Scholar Commons – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%223D+object+synthesis%22">3D object synthesis</searchLink><br /><searchLink fieldCode="DE" term="%22graph+algorithm%22">graph algorithm</searchLink><br /><searchLink fieldCode="DE" term="%22high+performence+computing%22">high performence computing</searchLink><br /><searchLink fieldCode="DE" term="%22parallel+graph+algorithm%22">parallel graph algorithm</searchLink><br /><searchLink fieldCode="DE" term="%22roofline+model%22">roofline model</searchLink><br /><searchLink fieldCode="DE" term="%22vertex+connectivity%22">vertex connectivity</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+Sciences%22">Computer Sciences</searchLink><br /><searchLink fieldCode="DE" term="%22Physical+Sciences+and+Mathematics%22">Physical Sciences and Mathematics</searchLink> – Name: Abstract Label: Description Group: Ab Data: 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 ... – Name: TypeDocument Label: Document Type Group: TypDoc Data: text – Name: Format Label: File Description Group: SrcInfo Data: application/pdf – Name: Language Label: Language Group: Lang Data: English – Name: NoteTitleSource Label: Relation Group: SrcInfo Data: https://scholarcommons.sc.edu/etd/7672; https://scholarcommons.sc.edu/context/etd/article/8580/viewcontent/877703.pdf – Name: URL Label: Availability Group: URL Data: https://scholarcommons.sc.edu/etd/7672<br />https://scholarcommons.sc.edu/context/etd/article/8580/viewcontent/877703.pdf – Name: Copyright Label: Rights Group: Cpyrght Data: © 2024, Shams-ul-Haq Syed – Name: AN Label: Accession Number Group: ID Data: edsbas.6D648A29 |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.6D648A29 |
| RecordInfo | BibRecord: BibEntity: Languages: – Text: English Subjects: – SubjectFull: 3D object synthesis Type: general – SubjectFull: graph algorithm Type: general – SubjectFull: high performence computing Type: general – SubjectFull: parallel graph algorithm Type: general – SubjectFull: roofline model Type: general – SubjectFull: vertex connectivity Type: general – SubjectFull: Computer Sciences Type: general – SubjectFull: Physical Sciences and Mathematics Type: general Titles: – TitleFull: On Parallelization of Graph Algorithms, Performance Modelling and Autonomous 3D Printable Object Synthesis Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Syed, Shams-ul-Haq IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 2024 Identifiers: – Type: issn-locals Value: edsbas Titles: – TitleFull: Theses and Dissertations Type: main |
| ResultId | 1 |