Response Time Analysis of Typed DAG Tasks for G-FP Scheduling

Abstract

With the increasing trend towards using multi-cores architecture for embedded systems, the study of parallel tasks on the heterogeneous platform becomes attractive and desirable in the literature. Although several work studying parallel task models has been proposed, the problem of precise scheduling analysis for the multiprocessor case has largely remained open. To this end, this paper concentrates on analyzing the response time for typed DAG real-time tasks scheduled on a multiprocessor platform under global fixed priority scheduling. Firstly, we use the state-of-the-art method of the single typed DAG task to bound the intra-interference. Second, we use an efficient but pessimistic way to bound the carry-in interference for a higher priority task. And we also propose a new technique based on the decomposition tree method to bound the carry-out interference. Finally, we use the classic sliding technique to bound the inter-interference of each higher priority task. Experimental evaluation validates the performance and efficiency of the proposed approach by comparing with other methods.