Designing Ideal Task Partitioning Scheduling Model In Distributed Computing Scenario

Abstract

This paper represents optimal iterative task partitioning scheduling in distributed heterogeneous environment. The main goal of the algorithm is to improve the performance of the schedule in the form of iterations. This algorithm first uses b-level computation to calculate the initial schedule. Main characteristics of our method are optimal scheduling and strong link between partitioning, scheduling and communication. Some important models for task partitioning have also been discussed in this paper. The proposed algorithm improves inter process communication between tasks by using recourses of the system in an efficient manner.