Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
A Distributed Parallel Algorithm to Solve the 2D Cutting Stock Problem
By: Leon, C.; Segura, C.; Rodriguez, C.; Miranda, G.;
2008 / IEEE / 978-0-7695-3089-5
This item was taken from the IEEE Conference ' A Distributed Parallel Algorithm to Solve the 2D Cutting Stock Problem ' 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.
Mpich Gigabit Ethernet
2d Cutting Stock Problem
Distributed-memory Parallel Algorithm
Time-driven Task Intercommunication Service
Algorithm Design And Analysis
Cutting Stock Problem
Local Area Networks