Abstract
This paper explores the inherent parallelism in different steps of three layer channel routing algorithm based on merging method in Shared Memory SIMD computer using CRCW model. Overall algorithm is structured as set of sequential steps, implemented by calling several procedures, namely finding longest path of a directed graph, finding minimum or maximum value among a set, merging two nodes in a directed graph, searching a graph for a particular node. Studying the inherent parallelism, each procedure is restructured for parallel operation on SIMD model. The speed-up and complexity analysis is performed at each step considering unbounded parallelism. The overall complexity of this algorithm reduces from O(n2) to O(n* log n) using O(n) processors for n nets.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
