Scheduling of Task Graph Using DAG with Dual Mode Processors in Heterogeneous Distributed Computing System
Functional programming is a very important factor to obtain the load of equilibrium in the distributed environment of distributed computers. A set of m tasks, scheduling and allotment of such set of task to the n processors (m >> n) is an important problem. CPU “Self- Reconfiguration is very important parameter to enhance the performance of distributed computing system Through our performance effective scheduling algorithm we want to present a adaptive scheduling algorithm which is the mix output of effective task allocation using DAG and Self –Reconfiguration of assigned processors. Self-reconfiguration processors can configure itself with respect to hardware as well as software according to requirement of computing. With the use of DAG we included EST and ECT, earliest starting time and earliest completion time respectively. finally an Performance based task Scheduling algorithm(PBTSA) based on highest directed Edge path HDEP with Self-Reconfiguration processors is proposed which generate the better tasks assignments and reduce the overall make span. The several set of input data are considered to test the complexity and efficiency of the algorithm.