A parallel approach in switchbox routing

A parallel algorithm, called PARALLEX, has been developed for the switchbox routing problem. The algorithm can be easily implemented on a shared-memory multiprocessor system. Since the algorithm is general-purpose in nature, it can be applied to a variety of routing problems. The number of processes is equal to the number of nets; each process has its own net to be routed. All the nets routed by individual processes are merged to make a conflict-free switchbox. Any conflicts occurring in the merging stage are grouped by conflict nets. From the conflict group belonging to the process each process finds its own solution, which is to be merged with the solutions from other conflict groups. A large-grain parallelism is possible by using as many processes as nets.<
>