A novel framework and policies for on-line block of cores allotment for multiple DAGs on NoC

Computer industry has widely accepted that future performance increases must largely come from increasing the number of processing cores on a die. This has led to NoC processors. Task scheduling is one of the most challenging problems facing parallel programmers today which is known to be NP-complete. A good principle is space-sharing of cores and to schedule multiple DAGs simultaneously on NoC processor. Hence the need to find optimal number of cores for a DAG and further which region of cores on NoC, to be allotted for a DAG . In this work, a method is proposed to find near-optimal minimal block of cores for a DAG on a NoC processor. Further, a time efficient framework and three on-line block allotment policies to submitted DAGs are experimented. The objectives of the policies, is to improve the total completion time for the submitted set of DAGs, hence the throughput. The policies are experimented on a simulator and found to deliver better performance than the policies found in literature.