Abstract
This paper concerns the problem of task allocation on the mesh structure of processors. Two created algorithms: 2 Side LeapFrog and Q-learning Based Algorithm are presented. These algorithms are evaluated and compared to known task allocation algorithms. To measure the algorithms’ efficiency we introduced our own evaluating function – the average network load. Finally, we implemented an experimentation system to test these algorithms on different sets of tasks to allocate. In this paper, there is a short analysis of series of experiments conducted on three different categories of task sets: small tasks, mixed tasks and large tasks. The results of investigations confirm that the created algorithms seem to be very promising.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ding, J., Bhuyan, L.N.: An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems. Texas A&M University (2002)
Das, C.R., Sharma, J., Pradhan, D.K.: A Fast and Efficient Strategy for Submesh Allocation in Mesh-Connected Parallel Computers. In: Proc. of 5th IEEE Symp. Parallel and Distributed Processing (1993)
Weber, C., Elshaw, M., Mayer, M.: Reinforcement Learning, Theory and Applications. I-Tech Education and Publishing, Vienna (2008)
Yoo, S.M., Youn, H.Y., Shirazi, B.: An Efficient Task Allocation Scheme for 2D Mesh Architectures. IEEE Transactions on Parallel and Distributed Systems 8 (1997)
Goh, L.K., Veeravalli, B.: Design and Performance Evaluation of Combined First-Fit Task Allocation and Migration Strategies in Mesh Multiprocessor Systems. Parallel Computing 34, 508–520 (2008)
Chuang, P.J., Tzeng, N.F.: An Efficient Submesh Allocation Strategy for Mesh Computer Systems. In: Proceedings of 11th Int. Conf. on Distr. Comp. Systems (1991)
Byung, S., Yoo, B.S., Das, C.R.: A Fast and Efficient Processor Allocation Scheme for Mesh Connected Multi-computers. IEEE Trans. on Computers, 46–59 (2002)
Koszalka, L.: Simulation-Based Evaluation of Distributed Mesh Allocation Algorithms. In: Thulasiraman, P., He, X., Xu, T.L., Denko, M.K., Thulasiram, R.K., Yang, L.T. (eds.) ISPA Workshops 2007. LNCS, vol. 4743, pp. 335–344. Springer, Heidelberg (2007)
Wu, F., Hsu, C., Chou, L.: Processor Allocation In the Mesh Multiprocessors Using the Leapfrog Method. IEEE Transactions on Parallel and Distributed Systems 14 (2003)
Watkins, C.J.C.H., Dayan, P.: Q-learning. Machine Learning 8, 279–292 (1993)
Koszalka, L., Lisowski, D., Pozniak-Koszalka, I.: Comparison of Allocation Algorithms for Mesh Structured Networks with Using Multistage Simulation. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) ICCSA 2006, Part V. LNCS, vol. 3984, pp. 58–67. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pozniak-Koszalka, I., Proma, W., Koszalka, L., Pol, M., Kasprzak, A. (2012). Task Allocation in Mesh Structure: 2Side LeapFrog Algorithm and Q-Learning Based Algorithm. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2012. ICCSA 2012. Lecture Notes in Computer Science, vol 7336. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31128-4_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-31128-4_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31127-7
Online ISBN: 978-3-642-31128-4
eBook Packages: Computer ScienceComputer Science (R0)