Assignment of program modules to processors: A simulated annealing approach

Abstract A simulated annealing approach to the assignment of program modules to processors in a distributed computer system is presented. Modules of a program require certain capacitated computer resources. They also communicate at a given rate. Processors are interconnected by a communication network constituted of various types of links: local area network (LAN), wide area network (WAN) and specialised links. The communication resources are also capacitated. The purpose is to find the assignment of modules to processors such that a measure of performance is optimised, the requirements of each module are met and the capacities of the resources are not violated. Various versions of the problem are identified and formulated. The design of the simulated annealing algorithm to solve the most general version is then described. The results of computational experience are reported.

[1]  David Fernández-Baca,et al.  Parametric Module Allocation on Partial k-Trees , 1993, IEEE Trans. Computers.

[2]  James B. Sinclair,et al.  Efficient Computation of Optimal Assignments for Distributed Tasks , 1987, J. Parallel Distributed Comput..

[3]  Francine Berman,et al.  On Mapping Parallel Algorithms into Parallel Architectures , 1987, J. Parallel Distributed Comput..

[4]  Virginia Mary Lo,et al.  Heuristic Algorithms for Task Assignment in Distributed Systems , 1988, IEEE Trans. Computers.

[5]  David M. Nicol,et al.  Improved Algorithms for Mapping Pipelined and Parallel Computations , 1991, IEEE Trans. Computers.

[6]  Shahid H. Bokhari,et al.  Assignment Problems in Parallel and Distributed Computing , 1987 .

[7]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[8]  Harold S. Stone,et al.  Assignment of Tasks in a Distributed Processor System with Limited Memory , 1979, IEEE Transactions on Computers.

[9]  Michael G. Norman,et al.  Models of machines and computation for mapping in multicomputers , 1993, CSUR.

[10]  Mokhtar Aboelaze,et al.  A Comparative Performace Analysis of Mapping Application to Parallel Mutliprocessor Systems: A Case Study , 1991, J. Parallel Distributed Comput..

[11]  Alain Billionnet,et al.  An efficient algorithm for a task allocation problem , 1992, JACM.

[12]  Wesley W. Chu,et al.  Task Allocation and Precedence Relations for Distributed Real-Time Systems , 1987, IEEE Transactions on Computers.