4.7 Article

Assignment of program modules to processors: A simulated annealing approach

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 122, Issue 2, Pages 509-513

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/S0377-2217(99)00251-9

Keywords

computer networks; task assignment; combinatorial optimization; simulated annealing

Ask authors/readers for more resources

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. (C) 2000 Elsevier Science B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available