On single row routing

A parallel algorithm for the single-row routing problem without backward moves and interstreet crossings is presented. The algorithm requires O(log N log log N) time with N processors on a concurrent-read-concurrent-write shared-memory model or alternatively O(log/sup 2/ N) time with N processors on a concurrent-read-exclusive-write shared-memory model. The algorithm is then modified to run sequentially in O(N) time.<
>