Abstract
In this article we address the task planning and assignment problem in a multicomputer system using architectural 2D mesh. The problem of planning and allocation of tasks to a group of computers consists of several sub-problems that can be made to correspond to functions to optimize.The proposed solution to this problem is; first: establish the identification of distinct parts that are involved, such as; maximizing processor usage, minimize task wait time in the queue and avoid indefinite task delay (starvation). Second: a planning algorithm and an allocation algorithm are implemented through the search engine within the queue, the first algorithm makes a previous planning to the allocation to identify the task lists that fit in the mesh, and the second is a sole variant distribution algorithm to identify the best allocations in the processor mesh through a dynamic quadratic allocation. Finally, our final results are presented; they allow us to see that a previous allocation in the queue and a search engine allocation of the tasks best positions in the available (free) sub meshes, are determining factors for bettering the longevity of the processors and optimize answer time in a multicomputer system.
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
Grama, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing, 2nd edn. Addison Wesley (January 16, 2003) ISBN: 0-201-64865-2
Bani-Ahmad, S.: Submesh Allocation in 2D Mesh Multicomputers: Partitioning at the Longest Dimension of Requests. In: ADVCOMP 2010: The Fourth International Conference on Advanced Engineering Computing and Applications in Sciences, pp. 99–104 (2010) ISBN: 978-1-61208-101-4
Torres, J., Rodriguez, E.: Conceptos de Computo Paralelo. Trillas, Mayo (2000) ISBN: 968-24-6223-3
Xavier, C., Iyengar, S.: Introduction to Parallel Algorithms. Wiley Inter-science, New York (1998) ISBN 0-471-25182-8
Sharma, D.D., Pradhan, K.: Job Scheduling in Mesh Multicomputers. IEEE Transactions on Parallel and Distributed Systems 9(1) (January 1998)
Chen, J., Taylor, V.E.: Mesh Partitioning for Efficient Use of Distributed Systems. IEEE Transactions on Parallel and Distributed Systems 13(1) (January 2002)
Dutot, P., Takpe, T.N., Suter, F.: Scheduling Parallel Task Graphs on (Almost) Homogeneous Multicluster Platforms. IEEE Transactions on Parallel and Distributed Systems 20(7) (July 2009)
Amoroso, A., Marzullo, K.: Multiple Job Scheduling in a Connection Limited Data Parallel System. IEEE Transactions on Parallel and Distributed Systems 17(2) (February 2006)
Velarde, A., Ponce de Leon, E., Diaz, E., Padilla, A.: Planning and Allocation of processors in 2D meshes. In: Doctoral Consortium. Mexican Internacional Conference on Artificial Intelligence, MICAI 2010, Pachuca Hidalgo, México (2010)
Heiss, H.U.: Dynamic Partitioning of Large Multicomputer Systems Department of Informatics. In: Proc. Int. Conf. on Massively Parallel Computing Systems (IEEE MPCS 1994), Ischia, May 2-6. University of Karlsruhe, Germany (1994)
Bani-Ahmad, S.: Processor Allocation with Reduced Internal and External Fragmentation in 2D Mesh-based Multicomputer. Journal on Applied Sciences 11(6), 943–952 (2011) ISSN 1812-5654, doi:10.3923 / jas. 2011.943.952, 2011 Asian Network for Scientific Information
Bani-Mohammad, S., Ould-Khaoua, M., Ababneh, I., Machenzie, L.: Non-contiguous Processor Allocation Strategy for 2D Mesh Connected Multicomputers Based on Sub-meshes Available for Allocation. In: Proc. of the 12th Int. Conference on Parallel and Distributed Systems (ICPADS 2006), Minneapolis, Minnesota, USA, vol. 2, pp. 41–48. IEEE Computer Society Press (2006)
Das Sharma, D., Pradhan, D.K.: Job Scheduling in Mesh Multicomputers. IEEE Transactions on Parallel and Distributed Systems 9(1) (January 1998)
Larrañaga, P., Lozano, J.A., Mühlenbein, H.: Estimation of Distribution Algorithms Applied To Combinatorial Optimization Problems. Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial (2003)
Lozano, J.A., Larrañaga, P.: Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic
Lo, V., Windisch, K., Liu, W., Nitzberg, B.: Non-contiguous processor allocation algorithms for mesh-connected multicomputers. IEEE Transactions on Parallel and Distributed Systems 8(7), 712–726 (1997)
Chang, C.Y., Mohapatra, P.: Performance improvement of allocation schemes for mesh-connected computers. Journal of Parallel and Distributed Computing 52(1), 40–68 (1998)
Suzaki, K., Tanuma, H., Hirano, S., Ichisugi, Y., Connelly, C., Tsukamoto, M.: Multi-tasking Method on Parallel Computers which Combines a Contiguous and Non-contiguous Processor Partitioning Algorithm. In: Madsen, K., Olesen, D., Waśniewski, J., Dongarra, J. (eds.) PARA 1996. LNCS, vol. 1184, pp. 641–650. Springer, Heidelberg (1996)
Bunde, D.P., Leung, V.J., Mache, J.: Communication Patterns and Allocation Strategies. Sandia Technical Report SAND2003-4522 (January 2004)
Liu, P., Hsu, C., Wu, J.J.: I/O Processor Allocation for Mesh Cluster Computers. In: IEEE Proceedings of the 2005 11th International Conference on Parallel and Distributed Systems, ICPADS 2005 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Velarde, A., Ponce de León, E., Diaz, E., Padilla, A. (2013). Planning and Allocation Tasks in a Multicomputer System as a Multi-objective Problem. In: Emmerich, M., et al. EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation IV. Advances in Intelligent Systems and Computing, vol 227. Springer, Heidelberg. https://doi.org/10.1007/978-3-319-01128-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-01128-8_15
Publisher Name: Springer, Heidelberg
Print ISBN: 978-3-319-01127-1
Online ISBN: 978-3-319-01128-8
eBook Packages: EngineeringEngineering (R0)