Implementation of an optimal task allocation strategy

Abstract

The author describes the implementation of a task allocation algorithm for multiprocessing systems, providing a simulation package to allocate tasks among identical processors. The proposed model provides an optimal task-assignment strategy for distributed programs by using the graph theoretical approach proposed by W. Chu et al. (1980). This approach discusses the interconnections between the modules, which are distributed over many processors to take advantage of parallel processing. The simulation package that is used to simulate the task allocation is written in APL. It generates run-times, communication delays, and execution times for the tasks to be distributed. It then optimizes the system execution time and recommends a task allocation scheme based on these values. In addition, the author provides an allocation strategy based on simulation results. In particular, he focuses on the optimal values of the system run-time and communication delay, and subsequently the system execution time.<>