Model-Based Algorithm Selection Techniques

Simple item page
dc.contributor.advisorNorris, Boyana
dc.contributor.authorSrinivasan, Sudharshan
dc.date.accessioned2019-09-18T19:33:47Z
dc.date.available2019-09-18T19:33:47Z
dc.date.issued2019-09-18
dc.description.abstractWith significant research going into the development of scientific software over the years, there exist a plethora of toolkits using different algorithms to solve the same problem. But the performance of these toolkits are very much problem specific and depend on multiple factors, including experimental setup and hardware configurations. This makes it very difficult to choose a suitable software beforehand without testing them for specific problems while the wrong choice of software contributes to severe performance downgrade. In this thesis, we address this selection challenge by proposing a faster and reliable model-based approach instead of empirically running time-consuming experiments to select suitable software toolkits. In specific, we would be looking at selection for two classes of algorithms that solve parallel graph processing applications and systems of linear equations. Appropriate metrics have also been introduced to evaluate the quality of selection techniques.en_US
dc.identifier.urihttps://hdl.handle.net/1794/24962
dc.language.isoen_US
dc.publisherUniversity of Oregon
dc.rightsAll Rights Reserved.
dc.subjectIterative solversen_US
dc.subjectLearning to ranken_US
dc.subjectParallel graph processingen_US
dc.titleModel-Based Algorithm Selection Techniques
dc.typeElectronic Thesis or Dissertation
thesis.degree.disciplineDepartment of Computer and Information Science
thesis.degree.grantorUniversity of Oregon
thesis.degree.levelmasters
thesis.degree.nameM.S.

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Srinivasan_oregon_0171N_12566.pdf
Size:
1.13 MB
Format:
Adobe Portable Document Format
Download

Collections

Theses and Dissertations
Computer Science Theses and Dissertations