Task Allocation in Mesh Connected Processors with Local Search Meta-heuristic Algorithms
This article contains a short analysis of applying three metaheuristic local search algorithms to solve the problem of allocating two-dimensional tasks on a two-dimensional processor mesh in a period of time. The primary goal is to maximize the level of mesh utilization. To achieve this task we adapted three algorithms: Tabu Search, Simulated Annealing and Random Search, as well as created a helper algorithm Dumb Fit and adapted another helper algorithm – First Fit. To measure the algorithms’ efficiency we introduced our own evaluating function Cumulative Effectiveness and a derivative Utilization Factor. Finally, we implemented an experimentation system to test these algorithms on different sets of tasks to allocate. In this article there is a short analysis of series of experiments conducted on three different classes of task sets: small tasks, mixed tasks and large tasks.
KeywordsNetwork structure task allocation Tabu Search Simmulated Annealing experimentation system
Unable to display preview. Download preview PDF.
- 2.Buzbee, B.L.: The Efficiency of Parallel Processing. Frontiers of Supercomputing, Los Alamos (1983)Google Scholar
- 3.Glover, F.: Tabu Search – part I. ORSA Journal on Computing 1(3) (1989)Google Scholar
- 4.Kirkpatrick, S., Gelatti, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science New Series 220(4598), 671–680 (1983)Google Scholar
- 7.Glover, F., Kochenberger, G.A.: Handbook of Metaheuristics. Springer, Heidelberg (2002)Google Scholar
- 8.Byung, S., Das, C.R.: A Fast and Efficient Processor Allocation Scheme for Mesh Connected Multi-computers. IEEE Trans. on Computers 1, 46–59 (2002)Google Scholar
- 10.Koszalka, L., Lisowski, D., Pozniak-Koszalka, I.: Comparison of Allocation Algorithms for Mesh Networks with Multistage Experiment. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3984, pp. 58–67. Springer, Heidelberg (2006)CrossRefGoogle Scholar