by V N Alexandrov (University of Liverpool) & G M Megson (University of Reading)

This book brings together current research direction in the mapping of dynamic programming recurrence equations for Knapsack Type problems, which include Unbounded Knapsack Problem, 0/1 Knapsack Problem, Subset Sum Problem, Change Making Problem, onto so-called regular parallel architectures. In particular, it focuses on heuristic and more formal techniques for mapping. The text is based on substantially revised papers published by the authors and their colleagues in the literature but re-written to provide an overall view of the subject area.

• Linear Arrays
• Probabilistic Bounds
• Designing 2D Regular Arrays
• Distributed Memory Implementation
• Mapping Integral Recurrences onto Regular Arrays
• Mapping onto Fixed Size Arrays with Lower Dimensions
• Comparison of Techniques