A Fixed-Structure Learning Automaton Solution to the Stochastic Static Mapping Problem

Authors:
Geir Horn;B. John Oommen
Affiliations:
SIMULA Research Laboratory, Norway;Carleton University, Ottawa, ON, Canada
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 18 - Volume 19
Year:
2005

Citing 8
Cited 4

On mapping parallel algorithms into parallel architectures

Journal of Parallel and Distributed Computing
Deterministic Learning Automata Solutions to the Equipartitioning Problem

IEEE Transactions on Computers
Improvements to an Algorithm for Equipartitioning

IEEE Transactions on Computers
Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)
Numerical Recipes in C++: the art of scientific computing

Numerical Recipes in C++: the art of scientific computing
A Fast Distributed Mapping Algorithm

CONPAR 90/VAPP IV Proceedings of the Joint International Conference on Vector and Parallel Processing
On the Mapping Problem

IEEE Transactions on Computers
Generalized pursuit learning schemes: new families of continuous and discretized learning automata

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quality aware service planning in computational grids

DSM '05 Proceedings of the 2nd international doctoral symposium on Middleware
Application service placement in stochastic grid environments using learning and ant-based methods

Multiagent and Grid Systems - Special Issue on Nature inspired systems for parallel, asynchronous and decentralised environments
Achieving microaggregation for secure statistical databases using fixed-structure partitioning-based learning automata

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Solving multiconstraint assignment problems using learning automata

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problem of distributing the processes of a parallel application onto a set of computing nodes. This problem called the Static Mapping Problem (SMP) is known to be NP-Hard, and has been tackled using heuristic solutions. The objective of this paper is to present the first reported Learning Automaton (LA) based solution to the SMP, generated by the close resemblance of the SMP to the equipartitioning problem. The LA in question is of the so-called Fixed-Structure family, solution to the equipartitioning problem is then modified to solve the SMP. Several algorithmic variants of this solution have been implemented, and these have all been rigorously tested and evaluated through extensive simulations on randomly generated parallel applications. The focus in this work is to demonstrate the applicability of LA to the SMP, not to optimise and evaluate the performance of the proposed strategy. The results presented here clearly demonstrate that LA provide a promising tool that can effectively solve the mapping problem.