This book is about a new approach to identify parallel segments from a given application or program. Program segment is represented using Program Dependence Graph, then by applying topological sort and reachability definition algorithm a new approach is suggested to identify segments, which can be executed concurrently. The performance of the suggested approach has been demonstrated and analysed at the end and also few examples are discussed using parallelization.