Show simple item record

dc.contributor.authorBora, Prachi Champalalen_US
dc.date.accessioned2014-03-14T20:40:52Z
dc.date.available2014-03-14T20:40:52Z
dc.date.issued2003-06-17en_US
dc.identifier.otheretd-06302003-143933en_US
dc.identifier.urihttp://hdl.handle.net/10919/33823
dc.description.abstractGrid environments are inherently heterogeneous. If the computational power provided by collaborations on the Grid is to be harnessed in the true sense, there is a need for applications that can automatically adapt to changes in the execution environment. The application writer should not be burdened with the job of choosing the right algorithm and implementation every time the resources on which the application runs are changed. A lot of research has been done in adapting applications to changing conditions. The existing systems do not address the issue of providing a unified interface to permit algorithm selection at runtime. The goal of this research is to design and develop a unified interface to applications in order to permit seamless access to different algorithms providing similar functionalities. Long running, computationally intensive scientific applications can produce huge amounts of performance data. Often, this data is discarded once the applicationâ s execution is complete. This data can be utilized in extracting information about algorithms and their performance. This information can be used to choose algorithms intelligently. The research described in this thesis aims at designing and developing a component based unified interface for runtime algorithm selection in grid environments. This unified interface is necessary so that the application code does not change if a new algorithm is used to solve the problem. The overhead associated with making the algorithm choice transparent to the application is evaluated. We use a data mining approach to algorithm selection and evaluate its potential effectiveness for scientific applications.en_US
dc.publisherVirginia Techen_US
dc.relation.haspartPrachiBoraThesis.pdfen_US
dc.rightsI hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dissertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to Virginia Tech or its agents the non-exclusive license to archive and make accessible, under the conditions specified below, my thesis, dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, dissertation, or project report.en_US
dc.subjectCommon Component Architectureen_US
dc.subjectLinear Equationsen_US
dc.subjectAlgorithm Selectionen_US
dc.subjectGrid Computingen_US
dc.subjectRecommender Systemsen_US
dc.titleRuntime Algorithm Selection For Grid Environments: A Component Based Frameworken_US
dc.typeThesisen_US
dc.contributor.departmentComputer Scienceen_US
dc.description.degreeMaster of Scienceen_US
thesis.degree.nameMaster of Scienceen_US
thesis.degree.levelmastersen_US
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen_US
thesis.degree.disciplineComputer Scienceen_US
dc.contributor.committeechairRibbens, Calvin J.en_US
dc.contributor.committeememberRamakrishnan, Narenen_US
dc.contributor.committeememberVaradarajan, Srinidhien_US
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-06302003-143933/en_US
dc.date.sdate2003-06-30en_US
dc.date.rdate2004-07-22
dc.date.adate2003-07-22en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record