Abstract

In heterogeneous computing taskmapping is necessary and has drawn major attention. Task scheduling algorithms at present are less efficient. This generally consists of two phases where first is pritorization and second is task assigning. In this paper a Heterogeneous laxity based improved task scheduling algorithm is proposed. This method of scheduling is represented by directed acyclic graph (DAG). This combines the method Heterogeneous Laxity Based Scheduling (HLBS) and Heterogeneous Scheduling with Improved Task Priority (HSIP) to improve the task scheduling efficiency. Here in this paper we come across with m-processers and n-tasks and we are concentrating on ideal time slot of any m-processers to schedule any n-tasks with shorter laxity and execution time to complete the task. To address the performance issue we are considering three parameters like makespan, Scheduling Length Ratio (SLR) and failure ratio.