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 Field | Value | Language |
---|---|---|
dc.contributor.author | GIROTRA, SANCHI | - |
dc.date.accessioned | 2017-02-17T06:28:12Z | - |
dc.date.available | 2017-02-17T06:28:12Z | - |
dc.date.issued | 2015-07 | - |
dc.identifier.uri | http://dspace.dtu.ac.in:8080/jspui/handle/repository/15604 | - |
dc.description.abstract | Bat 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.iso | en | en_US |
dc.relation.ispartofseries | TD NO.1890; | - |
dc.subject | BAT ALGORITHM | en_US |
dc.subject | COCOMO MODEL | en_US |
dc.subject | EFFORT ESTIMATION | en_US |
dc.subject | PARALLEL ALGORITHMS | en_US |
dc.subject | MAPREDUCE MODEL | en_US |
dc.subject | APACHED HADOOP | en_US |
dc.title | PARALLELIZATION OF BAT ALGORITHM USING HADOOP MAPREDUCE | en_US |
dc.type | Thesis | en_US |
Appears in Collections: | M.E./M.Tech. Computer Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FinalThesis.pdf | 3.29 MB | Adobe PDF | View/Open | |
Thesis2k12-CSE-29.pdf | 3.29 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.