|
|
|
|
|
|
|
|
|
|
|
|
|
| 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 |
|||||||||||
