BUDA: Budget and Deadline Aware Scheduling Algorithm for Task Graphs in Heterogeneous Systems

Task graphs are widely used to represent data-intensive applications. To efficiently execute these applications on heterogeneous systems, each task must be properly scheduled on the processors of the system. The NP-completeness of the task scheduling problem has motivated researchers to propose various heuristic methods. Recently, Quality of Service (QoS) aware scheduling is becoming an active research area in heterogeneous systems because the end-user has different QoS requirements. Generally, time and cost are the most relevant user concerns. However, it is challenging to find a feasible scheduling plan which minimizes the total execution time of the user’s application (makespan) while satisfying both budget and deadline constraints. In this paper, we present a novel heuristic algorithm called Budget-Deadline-Aware-Scheduling (BUDA) that addresses task graphs scheduling under budget and deadline constraints in heterogeneous systems. The novelty of the BUDA algorithm is based on a Heterogeneous Time-Cost Matrix (HTCM) that is used to prioritize tasks and for processor selection. In addition, we introduce a new Heterogeneous Time-Cost Trade-off factor (HTCT) that tries to adjust the time and cost for the current task among all processors. The experiments based on randomly generated graphs and real-world applications graphs show that the BUDA algorithm outperforms the state-of-the-art algorithms in terms of makespan, time efficiency, and success rate.