Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network

This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed into a knapsack of size L W and are only obtainable with guillotine-type side to side cuts. The parallel algorithm is described and analyzed for the associative model. The associative model ASC for parallel computation supports a generalized version of an associative style of computing that

• Type: Conference
• Year: 1996
• Where: PDPTA
• Authors: Darrell R. Ulm, Johnnie W. Baker
• Keywords: Associative Model, Associative Model Asc, Knapsack Problem, PDPTA 1996, PDPTA 2007