Parallelization of Bin Packing on Multicore Systems

We study effective parallelization of approximation algorithms for the one-dimensional bin packing problem on a multicore platform. Bin packing is a classic combinatorial optimization problem that aims to pack a given sequence of items into a minimum number of equal-sized bins. The problem potential...

Full description

Bibliographic Details

Published in:	2016 IEEE 23rd International Conference on High Performance Computing (HiPC) pp. 311 - 320
Main Authors:	Ghosh, Sayan, Gebremedhin, Assefaw H.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.12.2016
Subjects:	Algorithm design and analysis Approximation algorithms Bin packing Combinatorial optimization problems Dynamic scheduling First Fit Decreasing Heuristic algorithms Multicore processing OpenMP Parallel algorithms Upper bound
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!