Algorithms for assignment problems on an array processor

Abstract The innovation of parallel computers has added a new dimension to the design of algorithms. Parallel programming is not a simple extension of serial programming. We describe parallel algorithms for the quadratic assignment problem and present our computational experience using the massively parallel processor, DAP. We further report the speedup obtained by parallelising algorithms for solving the 2-dimensional and 3-dimensional assignment problems on the DAP.

[1]  Michel Balinski,et al.  Signature Methods for the Assignment Problem , 1985, Oper. Res..

[2]  Martin E. Dyer,et al.  On linear programs with random costs , 1986, Math. Program..

[3]  Michael J. Flynn,et al.  Very high-speed computing systems , 1966 .

[4]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[5]  Alan Frieze,et al.  An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice , 1981 .

[6]  Ming S. Hung,et al.  Solving the Assignment Problem by Relaxation , 1980, Oper. Res..

[7]  Dimitri P. Bertsekas,et al.  A new algorithm for the assignment problem , 1981, Math. Program..

[8]  M. Los Comparison of Several Heuristic Algorithms to Solve Quadratic Assignment Problems of the Koopmans-Beckmann Type , 1977 .

[9]  Andrew Whinston,et al.  An Algorithm for the Quadratic Assignment Problem , 1970 .

[10]  H. Kuhn The Hungarian method for the assignment problem , 1955 .

[11]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[12]  D. Parkinson,et al.  Organisational aspects of using parallel computers , 1987, Parallel Comput..

[13]  Leon Steinberg,et al.  The Backboard Wiring Problem: A Placement Algorithm , 1961 .

[14]  Caxton C. Foster Content Addressable Parallel Processors , 1976 .

[15]  R. Burkard Quadratic Assignment Problems , 1984 .

[16]  Dennis Parkinson The Distributed Array Processor (DAP) , 1983 .

[17]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.