Static task allocation of concurrent programs for distributed computing systems with processor and resource heterogeneity

In this paper, we investigate the problem of static task allocation of concurrent programs for distributed computing systems with processor and resource heterogeneity, i.e. given a set of concurrent communicating modules and a two processor distributed computing system, in which processors may have differing speeds and each processor may have certain resources not available with the other processor (i.e. unique resources), to which processor should each module be assigned so as to minimize the completion time? This task allocation problems is NP-hard and hence, we provide an efficient heuristic algorithm for obtaining satisfactory suboptimal solution to it in a reasonable amount of computation time and demonstrate the effectiveness of our algorithm with simulation studies. Our algorithm works by constructing an augmented task graph and taking a load balanced mincut on it and has a time complexity of O((m + u)2) where m is the number of concurrent communicating modules and u is the total number of unique resources in the two processor system. Finally, we extend our heuristic algorithm to solve the problem of static task allocation of concurrent programs to an n processor distributed computing system with processor and resource heterogeneity. © 1994.