Please use this identifier to cite or link to this item: http://dspace.dtu.ac.in:8080/jspui/handle/repository/15604
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGIROTRA, SANCHI-
dc.date.accessioned2017-02-17T06:28:12Z-
dc.date.available2017-02-17T06:28:12Z-
dc.date.issued2015-07-
dc.identifier.urihttp://dspace.dtu.ac.in:8080/jspui/handle/repository/15604-
dc.description.abstractBat algorithm is among the most popular meta-heuristic algorithms for optimization. Traditional bat algorithm work on sequential approach which is not scalable for optimization problems dealing with BIG DATA such a scrawled documents, web request logs, commercial transaction information therefore parallelizing meta-heuristics to run on tens, hundreds or even thousands of machine to reduce runtime is required. In this paper, we introduced two parallel models of BAT algorithm using MapReduce programming model proposed by Google. We used these two models for solving the Software development effort optimization problem. The experiment is conducted using Apache Hadoop implementation of MapReduce on a cluster of 6 machines. These models can be used to solve problems with large search space, dimension and huge computation by simply adding more hardware resources to the cluster and without changing the proposed model code.en_US
dc.language.isoenen_US
dc.relation.ispartofseriesTD NO.1890;-
dc.subjectBAT ALGORITHMen_US
dc.subjectCOCOMO MODELen_US
dc.subjectEFFORT ESTIMATIONen_US
dc.subjectPARALLEL ALGORITHMSen_US
dc.subjectMAPREDUCE MODELen_US
dc.subjectAPACHED HADOOPen_US
dc.titlePARALLELIZATION OF BAT ALGORITHM USING HADOOP MAPREDUCEen_US
dc.typeThesisen_US
Appears in Collections:M.E./M.Tech. Computer Engineering

Files in This Item:
File Description SizeFormat 
FinalThesis.pdf3.29 MBAdobe PDFView/Open
Thesis2k12-CSE-29.pdf3.29 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.