Algorithms for assignment problems on an array processor
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Cellular automata (computational aspects) (68Q80) Algorithms in computer science (68W99)
The paper presents parallel algorithms designed for assignment problems, in particular the quadratic assignment problem. The complexity of the algorithms is measured in terms of computer operations. The algorithms are implemented on the Distributed Array Processor (a SIMD computer). It consists of \(n^ 2\) processors organized as a 2-dimensional mesh. Each processor can communicate directly with its four neighbours, but is also connected via row and column highways to a set of edge registers. The authors programmed the algorithms in DAP-FORTRAN. The computational results show that as the problem get larger, so do the savings in computation time.
- The single-finger keyboard layout problem
- An assignment algorithm with applications to integrated circuit layout
- A parallel branch and bound algorithm for the quadratic assignment problem
- Simulated annealing and tabu search in the long run: A comparison on QAP tasks
- Correct translation of data parallel assignment onto array processors
- A study of diversification strategies for the quadratic assignment problem
- An efficient processor allocation algorithm using two-dimensional packing
- A user's guide to tabu search
- D\&C method for solving large problems in fixed size processor array
- L_p-norm regularization algorithms for optimization over permutation matrices
- A Multistage Linear Array Assignment Problem
- An algorithm for assigning multiplexer inputs
- scientific article; zbMATH DE number 4068242 (Why is no real title available?)
- A systolic array for the assignment problem
- scientific article; zbMATH DE number 515940 (Why is no real title available?)
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem
- scientific article; zbMATH DE number 1482180 (Why is no real title available?)
- Aligators for Arrays (Tool Paper)
- An orthogonal systolic design for the assignment problem
This page was built for publication: Algorithms for assignment problems on an array processor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124328)