In this report a concurrent pairwise exchange placement algorithm executing on an array processor is presented. Two force functions and their effects are discussed. The oscillation phenomenon caused by the concurrent computation is investigated and some solutions are suggested. A design for the array processor is presented along with a complexity analysis which indicates that this algorithm is O(N /sup 2/) faster than a conventional sequential placement algorithm if NxN processors are employed.