Parallel algorithms for corner stitching

Corner stitching is a data structuring technique that can be used to represent rectangular objects in interactive VLSI layout editing systems. This thesis pro-poses parallel algorithms for the batch insertion and deletion operations of the corner stitching data structure. By adding parallel constructs to the serial corner stitching algorithms, new ones are developed that generate multiple streams of instructions and/or data to be executed in parallel on multiple processors. These parallel algorithms were implemented in C on a distributed network composed mainly of SUN workstations using PVM. When efficiently developed, significant run time improvement over the serial version of the batch insertion and deletion operations was observed.