Task Allocation in heterogeneous Distributed Real Time System for Optimal Utilization of Processor’s Capacity

Abstract

In Distributed Real Time System (DRTS), systematic allocation of the tasks among processors is one of the important parameter, which determine the optimal utilization of available resources. If this step is not performed properly, an increase in the number of processing nodes results in decreasing the total system throughput. The Inter-Task Communication (ITC) is always the most costly and the least reliable parameter in the loosely coupled DRTS. In this paper an efficient task allocation algorithm is discussed, which performs a static allocation of a set of tasks T = {t1,t2,…tm} of a program to a set of n processors P = {p1,p2,….pn}, (where, m >> n) to minimize the application program's Parallel Processing Cost(PPC) with the goal to maximize the overall throughput of the system through and allocated load on all the processors should be approximately balanced. While designing the algorithm the Execution Cost (EC) and Inter Task Communication Cost (ITCC) have been taken into consideration.