An Optimal Task Allocation Model for System Cost Analysis in Heterogeneous Distributed Computing Systems: A Heuristic Approach

Abstract

In Distributed computing systems (DCSs), task allocation strategy is an essential phase to minimize the system cost (i.e. the sum of execution and communication costs). To utilize the capabilities of distributed computing system (DCS) for an effective parallelism, the tasks of a parallel program must be properly allocated to the available processors in the system. Inherently, task allocation problem is NP-hard in complexity. To overcome this problem, it is necessary to introduce heuristics for generating near optimal solution to the given problem. This paper deals with the problem of task allocation in DCS such that the system cost is minimized. This can be done by minimizing the inter-processor communication cost (IPCC). Therefore, in this paper we have proposed an algorithm that tries to allocate the tasks to the processors, one by one on the basis of communication link sum (CLS). This type of allocation policy will reduce the inter-processor communication (IPC) and thus minimize the system cost. For an allocation purposes, execution cost of the tasks on each processor and communication cost between the tasks has been taken in the form of matrices.

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

“…The execution cost matrix, ECM (,) of order m x n is considered. A typical program graph of a set of "m = 9" tasks T = {t 1 , t 2 , t 3 , t 4 , t 5 , t 6 , t 7 , t 8 , t 9 } has been taken from the literature as considered by Yadav et al [31], Younes [32] and Elsadek [3].…”

“…The present paper deals with a simple, yet efficient mathematical and computational algorithm to identify the optimal busy cost of the system. The performance of the algorithm is compared with the algorithm reported by Yadav et al [31], Elsadek et al [3] and Younes [32]. The figure 4 and table 5 shows the comparisons of optimal cost of the system reported by the [31,32] and the present method.…”

Performance Intensification of DRTS under Static Load Sharing Scheme

“…Task allocation is a NP-hard or NP-complete problem [4][5][6][9][10][11][12]. Many task allocation algorithms for distributed computing systems have been proposed in the literature [4-7, 9, 11-12, 14].…”

Optimal Task Allocation Algorithm for Cost Minimization and Load Balancing of GSD Teams

“…In [10] author have shown that there are different methods and models proposed but still this issue needs to be addressed with different prospective.…”