•Objectives :
ØDesign
of an efficient Algorithm to convert an arbitrary NSP DAG to SP DAG
Ø- Correctness
preserving
-Identifying different graph
topologies
-
ØAnalysis
of Space and Time complexities
-Bound on increase in critical path length
-
ØPerform
empirical analysis using cilk
Ø