Parallelism
This algorithm can be parallelized because gates are sized independently of each other.
Delay computation and identification of critical gates are not easily parallelized.
Results found that sizing accounted for about 60% of the runtime.
- Maximum possible speedup is then about 2.5 if just concentrate on gate sizing.
To get better speedup, would need to parallelize delay computation and identification critical gates.