Task scheduling of applications represented by a directed acyclic graph (DAG) on multiprocessors is an NP-HARD problem Garey and Johnson [1979]. The growing requirement to utilize the underlying parallelism for quick ...