Parallelizing generalized one-dimensional bin packing problem using MapReduce

Parallelizing generalized one-dimensional bin packing problem using MapReduce

                            Parallelizing generalized one-dimensional bin packing problem using MapReduce.Bin packing problem is one amongstthe major problems which need attention in this era of distributed computing. In this optimization is attained by packing a set of items in as fewer bins as possible. Its application can vary from placing data on multiple disks to jobs scheduling, packing advertisements in fixed length radio/TV station breaks etc.

MapReduce-Projects

MapReduce-Projects

The efforts have been put to parallelize the bin packing solution with the well-known programming model, MapReduce which is highly supportive for distributed computing over large cluster of computers.Here we have proposed two different algorithms using two different approaches, for parallelizing generalized bin packing problem. The results obtained were tested on the hadoop cluster organization and complexities were estimated thereafter. It is found that working on the problem set in parallel results in significant time efficient solutions for Bin Packing Problem

Similar IEEE Project Titles

Save

Save

Save


Work Progress

PHD - 24

M.TECH - 125

B.TECH -95

BIG DATA -110.

HADOOP -90.

ON-GOING Hadoop Projects

HADOOP MAP -90.

HADOOP YARN -27.

HADOOP HEBROS - 25.

HADOOP ZOOKEEPER -18.

Achievements – Hadoop Solutions

Hadoop-Projects-Achievement-Awards

Twitter Feed

Customer Review

Hadoop Solutions 5 Star Rating: Recommended 4.9 - 5 based on 1000+ ratings. 1000+ user reviews.