PRECEDENCE-CONSTRAINED TASK ALLOCATION IN DISTRIBUTED COMPUTING SYSTEMS

A distributed computing system (DCS) provides a platform for concurren t execution of tasks consisting of various modules. The problem of tas k allocation becomes quite difficult to solve when the precedence cons traint is considered along with other constraints such as memory, netw ork topology, etc. Various solutions have been proposed, considering o ne or the other constraint, in the literature. The present work discus ses a comprehensive task allocation policy that can promise to provide an optimal solution to the problem. An algorithm, considering the pre cedence relation among the modules of a task, is proposed for allocati on. The algorithm is used to show the allocation for some interconnect ion topologies and task graphs.