Timothy J. Rolfe
Abstract
The linear assignment problem requires the determination of an optimal permutation vector for the assignment of tasks to agents. Even the backtracking implementation supports a rather powerful bounding function. An earlier article discussed the fundamental problem and executing the backtracking in parallel. This article addresses the branch-and-bound approach and shows transforming that into a parallel algorithm.
- Timothy J. Rolfe, "The Assignment Problem: Exploring Parallelism", inroads, Vol. 41, No. 2 (June 2009), pp. 127--31. Google Scholar
Digital Library
- The complete chapter on Branch and Bound from Sartaj Sahni's Data Structures, Algorithms, and Applications in Java (Silicon Press, 2004) is at http://www.cise.ufl.edu/~sahni/dsaaj/chapters.htm Google ScholarDigital Library
Index Terms
- The assignment problem: further exploring parallelism
Recommendations
The assignment problem: exploring parallelism
The linear assignment problem requires the determination of an optimal permutation vector for the assignment of tasks to agents. Even the backtracking implementation supports a rather powerful bounding function. Since the processing of permutation ...
PASM: A Partitionable SIMD/MIMD System for Image Processing and Pattern Recognition
PASM, a large-scale multimicroprocessor system being designed at Purdue University for image processing and pattern recognition, is described. This system can be dynamically reconfigured to operate as one or more independent SIMD and/or MIMD machines. ...
The NYU Ultracomputer Designing an MIMD Shared Memory Parallel Computer
We present the design for the NYU Ultracomputer, a shared-memory MIMD parallel machine composed of thousands of autonomous processing elements. This machine uses an enhanced message switching network with the geometry of an Omega-network to approximate ...
Comments