A fixed-structure learning automaton solution to the stochastic static mapping problem

Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

Volumn 2005, Issue , 2005, Pages

  Horn, Geir ^a   John Oommen, B ^b  

^a SIMULA RESEARCH LABORATORY   (Norway)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

Learning automata; Parallel computing; Static mapping; Task assignment

Indexed keywords

FIXED-STRUCTURE FAMILY; LEARNING AUTOMATA; STATIC MAPPING; TASK ASSIGNMENT;

ALGORITHMS; AUTOMATA THEORY; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; EVALUATION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

LEARNING SYSTEMS;

EID: 33746275218     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2005.23     Document Type: Conference Paper

References (11)

1. T. Muntean and E.-G. Talbi, "Métodes de placement statique des processus sur architectures paralléles," T.S.I - Technique et Sicence Informatgiques, vol. 10, no. 5, pp. 355-373, 1991.
2. Y.-K. Kwok and I. Ahmad, "Static scheduling algorithms for allocating directed task graphs to multiprocessors," ACM Computing Surveys, vol. 31, pp. 406-471, Dec. 1999.
3. J. E. Boillat and P. G. Kropf, A Fast Distributed Mapping Algorithm, vol. 457 of Lecture Notes in Computer Science, pp. 405-416. Springer, 1990.
4. F. Berman and L. Snyder, "On mapping parallel algorithms into parallelarchitectures," Journal of Parallel and Distributed Computing, vol. 4, pp. 439-58, 1987.
5. S. H. Bokhari, "On the mapping problem," IEEE Transactions on Computers, vol. C-30, pp. 207-214, Mar. 1981.
6. G. Horn, O. Lysne, and T. Skeie, "The existence of a network of fixed-sized switches that satisfies any communication needs," in Proceedings of the 2004 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA, (Las Vegas, Nevada, USA), pp. 1056-1062, CSREA Press, 2004.
7. M. Agache and B. J. Oommen, "Generalized pursuit learning schemes; New families of continuous and discretized learning automata," IEEE Transaction on Systems, Man, and Cyberetics - Part B: Cybernetics, vol. 32, pp. 738-749, Dec. 2002.
8. B. J. Oommen and D. C. Y. Ma, "Deterministic learning automata solutions to the equipartitioning problem," IEEE Transactions on Computers, vol. 37, pp. 2-13, Jan. 1988.
9. W. Gale, S. Das, and C. T. Yu, "Improvements to an algorithm for equipartitioning," IEEE Transactions on Computers, vol. 39, pp. 706-710, May 1990.
10. B. J. Oommen and D. C. Y. Ma, "Stochastic automata solutions to the object partitioning problem," The Computer Journal, vol. 35, pp. A105-A120, 1992.
11. W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical Recipes in C++: The Art of Scientific Computing. Cambridge University Press, 2nd ed., 2002. ISBN 0-521-75033-4.