Optimal Task Partitioning Model in Distributed Heterogeneous Parallel Computing Environment

Javed Ali
2012 International Journal of Advanced Information Technology  
Parallel computing systems compose task partitioning strategies in a true multiprocessing manner. Such systems share the algorithm and processing unit as computing resources which leads to highly inter process communications capabilities. We focus on real-time and non preemptive systems. A large variety of experiments have been conducted on the proposed algorithm. Goal of computation model is to provide a realistic representation of the costs of programming. The paper represents the optimal
more » ... nts the optimal iterative task partitioning scheduling in the distributed heterogeneous environment. Main goal of the algorithm is to improve the performance of the schedule in the form of iteration using results from previous iterations. The algorithm first uses the b-level computation to calculate the initial schedule and then improve it iteratively. The results show the benefit of the task partitioning. The main characteristics of our method are optimal scheduling and strong link between partitioning, scheduling and communication. Some important models for task partitioning are also discussed in the paper. We target the algorithm for task partitioning which improve the inter process communication between the tasks and use the recourses of the system in the efficient manner. The proposed algorithm contributes the inter-process communication cost minimization amongst the executing processes. This paper is the extended version of [15] . 14 implemented upon platform comprise of the heterogeneous platforms comprise the different kinds of units, such as CPUs, graphics co-processors, etc. An algorithm is constructed to solve the problem according to the processing capability of the machines used on the cluster and mode of communication amongst the processing tasks [10] . The communication factor is the highly important feature to solve the problem of task partitioning in the distributed systems. A computer cluster is a group of computers working together closely in such a manner that it's treated as a single computer. Cluster is always used to improve the performance and availability over that of a single computer. Task partitioning is achieved by linking the computers closely to each other as a single implicit computer. The large tasks partitioned in the various tasks by the algorithms to improve the productivity and adaptability of the systems. A cluster is used to improve the scientific calculation capabilities of the distributed system [2]. The process division is a function that divides the process into the number of processes or threads. Thread distribution distributes threads proportionally according to the need, among the several machines in the cluster network [chandu10].Thread is a function which execute on the different nodes independently so communication cost problem is not considerable [3] . Some important model [4] for task partitioning in parallel computing system are: PRAM ,BSP etc.DAG is a well known representation of parallel applications in which nodes represents the tasks and edges represent the communication overhead. ANP (Arbitrary Network Topology) strategy. So the key factor to achieve the desired results upon the dynamically changed hardware constraints.
doi:10.5121/ijait.2012.2602 fatcat:fvlirr2ua5cxnbhgcpcvd7bosu