By Topic

A Distributed Parallel Algorithm to Solve the 2D Cutting Stock Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Leon, C. ; Univ. de La Laguna, La Laguna ; Miranda, G. ; Rodriguez, C. ; Segura, C.

This work analyses the difficulties of parallelizing the best known sequential algorithm for the 2D cutting stock problem. All the approaches to parallelize the algorithm strive against its highly irregular computation structure and its sequential nature. A distributed-memory parallel algorithm has been designed through a time-driven task intercommunication service. The service allows to introduce a load balancing scheme that tries to hide the non-homogeneous work load nature of the involved single tasks. Experimental results obtained for MVAPICH infiniband and MPICH gigabit Ethernet implementations prove the efficiency of the communication and balancing schemes and show the almost linear speedup achieved by the parallel algorithm.

Published in:

Parallel, Distributed and Network-Based Processing, 2008. PDP 2008. 16th Euromicro Conference on

Date of Conference:

13-15 Feb. 2008