Efficient Parallel Algorithms for Sparse Matrix Operations on a GPU with Applications

dc.contributor.guideKishore Kothapalli
dc.coverage.spatial
dc.creator.researcherDharma Teja Vooturi
dc.date.accessioned2024-08-19T11:03:12Z
dc.date.available2024-08-19T11:03:12Z
dc.date.awarded2024
dc.date.completed2024
dc.date.registered2012
dc.description.abstractComputational approaches use computing machines to perform functional tasks like image classification, newlinespeech recognition, fluid flow simulation, etc. A computational approach is composed of newlinemany computational tasks, and the time taken to perform a functional task using a computational newlineapproach depends on the time taken to process the underlying computational tasks of that computational newlineapproach. Furthermore, the time taken to perform a computational task depends on three newlinefactors: the computing machine, algorithm and data structures, and the input to the computational newlinetask. Improved run time performance for a computational task can be obtained by co-designing newlinealgorithm and data structures while being aware of the target computing machine and the input. newlineA computational approach, when applied to a functional task, achieves a certain level of accuracy newlineand takes a certain amount of time to perform. While accuracy is independent of the computing newlinemachine, time is dependent on the choice of the computing machine. Hence, better computational newlineapproaches can be designed by being aware of the computing machine. The proposed research newlinework is categorized into two themes: 1) Design efficient algorithms and data structures for newlinea computational task on a given instance of (computing machine, input class). 2) Design efficient newlinecomputational approaches for a functional task on a given computing machine. In these themes, newlinethere are choices to be made on the computing machine, computational tasks, and computational newlineapproaches. We chose GPU for the computing machine due to its high throughput, high memory newlinebandwidth, and its applicability in accelerating a wide variety of computational tasks from different newlineapplication domains. We chose sparse matrix operations for the computational tasks, as they play newlinea crucial role in computational approaches that are used to solve problems in application domains newlinelike scientific computing, artificial intelligence(AI), and graph analytics. We chose Artificial Neural newlineNetworks(ANN) for the computational ap
dc.description.note
dc.format.accompanyingmaterialNone
dc.format.dimensions
dc.format.extent
dc.identifier.urihttp://hdl.handle.net/10603/583643
dc.languageEnglish
dc.publisher.institutionComputer Science and Engineering
dc.publisher.placeHyderabad
dc.publisher.universityInternational Institute of Information Technology, Hyderabad
dc.relation
dc.rightsuniversity
dc.source.universityUniversity
dc.subject.keywordComputer Science
dc.subject.keywordComputer Science Software Engineering
dc.subject.keywordEngineering and Technology
dc.titleEfficient Parallel Algorithms for Sparse Matrix Operations on a GPU with Applications
dc.title.alternative
dc.type.degreePh.D.

Files

Original bundle

Now showing 1 - 5 of 15
Loading...
Thumbnail Image
Name:
80_recommendation.pdf
Size:
86.44 KB
Format:
Adobe Portable Document Format
Description:
Attached File
Loading...
Thumbnail Image
Name:
abstract.pdf
Size:
91.54 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
annexures.pdf
Size:
122.36 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
chapter1.pdf
Size:
1.29 MB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
chapter2.pdf
Size:
686.84 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.79 KB
Format:
Plain Text
Description: