A parallel solution to the cutting stock problem for a cluster of workstations

The paper describes the design and implementation of a solution to the constrained 2D cutting stock problem on a cluster of workstations. The constrained 2D cutting stock problem is an irregular problem with a dynamically modified global data set and irregular amounts and patterns of communication. A replicated data structure is used for the parallel solution since the ratio of reads to writes is known to be large. Mutual exclusion and consistency are maintained using a token based lazy consistency mechanism, and a randomized protocol for dynamically balancing the distributed work queue is employed. Speedups are reported for three benchmark problems executed on a cluster of workstations interconnected by a 10 Mbps Ethernet.

[1]  Ralph E. Gomory,et al.  The Theory and Computation of Knapsack Functions , 1966, Oper. Res..

[2]  Nicos Christofides,et al.  An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..

[3]  P. Y. Wang,et al.  Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems , 1983, Oper. Res..

[4]  Vaidy S. Sunderam,et al.  PVM: A Framework for Parallel Distributed Computing , 1990, Concurr. Pract. Exp..

[5]  M. Hill,et al.  Weak ordering-a new definition , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.

[6]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[7]  JoséFernando Oliveira,et al.  An improved version of Wang's algorithm for two-dimensional cutting problems , 1990 .

[8]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .

[9]  R. W. Haessler,et al.  Cutting stock problems and solution procedures , 1991 .

[10]  Henri E. Bal,et al.  Replication techniques for speeding up parallel applications on distributed systems , 1992, Concurr. Pract. Exp..

[11]  William B. Dowsland.  On a Research Bibliography for Cutting and Packing Problems , 1992 .

[12]  Alan L. Cox,et al.  Lazy release consistency for software distributed shared memory , 1992, ISCA '92.

[13]  Katherine A. Yelick,et al.  Implementing an irregular application on a distributed memory multiprocessor , 1993, PPOPP '93.

[14]  ChakrabartiSoumen,et al.  Implementing an irregular application on a distributed memory multiprocessor , 1993 .

[15]  A. Bagchi,et al.  Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems , 1993, Oper. Res..

[16]  Stefan Tschöke,et al.  A New Parallel Approach to the Constrained Two-Dimensional Cutting Stock Problem , 1995, IRREGULAR.