Assignment of program modules to processors: A simulated annealing approach

European Journal of Operational Research

Volumn 122, Issue 2, 2000, Pages 509-513

  Hamam, Yskandar ^a   Hindi, Khalil S ^b  

^a Groupe ESIEE   (France)

^b BRUNEL UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; DISTRIBUTED COMPUTER SYSTEMS; LOCAL AREA NETWORKS; MATHEMATICAL MODELS; SIMULATED ANNEALING; WIDE AREA NETWORKS;

PROGRAM MODULES; TASK ASSIGNMENT;

OPERATIONS RESEARCH;

EID: 0033895074     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00251-9     Document Type: Article

References (13)

1. F. Berman, L. Snyder, On mapping parallel algorithms in parallel architecture, Journal of Parallel and Distributed Computing (1987) 439-458.
2. Billionet A., Costa M.C., Sutter A. An efficient algorithm for a task allocation problem. Journal of ACM. 39:1992;502-518.
3. Bokhari S. Assignment Problems in Parallel and Distributed Computing. 1987;Kluwer, Boston.
4. Fernandez-Baca D., Medepalli A. Parametric module allocation on partial k-trees. IEEE Transactions on Computers. 42:1993;738-742.
5. Chu W.W., Lan L.M. Task allocation and precedence relations for distributed real-time systems. IEEE Transactions on Computers. 36:1987;667-669.
6. A. Hagin, G. Dermler, K. Rotherml, Problem formulation, model and algorithms for mapping distributed multimedia applications to distributed computer systems, Technical Report, Universität Stuttgart, Fakultät Informatik, February, 1996.
7. C.E. Houstis, M. Aboelaze, A comparative performance analysis of mapping applications to parallel multi-processor systems: A case study, Journal of Parallel and Distributed Computing (1991) 17-29.
8. V.M. Lo, Heuristic algorithms for task assignment in distributed systems, IEEE Transactions on Computers, 1988, pp. 1384-1397.
9. Nicol D.M., O'Halloran D.R. Improved algorithms for mapping pipelined and parallel computations. IEEE Transactions on Computers. 40:1991;295-306.
10. Norman M.G., Thanisch P. Models of machines and computation for mapping in multi-computers. ACM Computing Surveys. 3:1993;163-302.
11. Rao G.S., Stone H.S., Hu T.C. Assignment of tasks in a distributed processing system with limited memory. IEEE Transactions on Computers. 28:1979;291-299.
12. Sinclair J.B. Efficient computation of optimal assignments for distributed tasks. Journal of Parallel and Distributed Computing. 4:1987;342-362.
13. C.R. Reeves, Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford, 1993.