Mario Inostroza

Learn More
This article presents a scheduling algorithm that assigns tasks represented in a directed acyclic graph (DAG). The behavior of the proposed algorithm is compared with the dominant sequence clustering (DSC) algorithm on a set of DAG tests. The tests were carried out on two sets of DAGs, one with tasks of arbitrary duration, and the other with tasks of unit(More)
  • 1