Abstract
Current processor allocation techniques for highly parallel systems are based on centralized front-end based algorithms. As a result, the applied strategies are restricted to static allocation, low parallelism and weak fault tolerance. To lift these restrictions we are investigating a distributed approach to the processor allocation problem in large mesh-connected multicomputers. A noncontiguous version of a distributed dynamic processor allocation strategy is proposed and studied in this paper as an alternative for parallel programming models that allow dynamic creation and deletion of tasks. Simulations compare the performance of the proposed dynamic strategy with the static counterpart and also with well-known centralized algorithms in such an environment with growing and shrinking processor demands. We also present the results of experiments on a Siemens hpcLine Primergy Server with 96 nodes that show dynamic allocation is feasible with current technologies.
This research was supported in part by HP-Brazil and Fapergs.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
G.-M. Chiu and S. Kung Chen. An efficient submesh allocation scheme fot two-dimensional meshes with little overhead. IEEE Transactions on Parallel and Distributed Systems, pages 471–486, 1999.
H. Choo, S.-M. Yoo, and H. Y. Youn. Processor scheduling and allocation for 3d torus multicomputer systems. IEEE Transactions on Parallel and Distributed Systems, pages 475–484, 2000.
IEEE. Ieee standard for scalable coherent interface (sci). IEEE 1596-1992, 1992.
G. Kim and H. Yoon. On submesh allocation for mesh-connected multicomputers: A best-fit allocation and a virtual submesh allocation for fautly meshes. IEEE Transactions on Parallel and Distributed Systems, 9(2), feb 1998.
V. Lo and et al. Noncontiguous processor allocation algorithms for mesh-connected multicomputers. IEEE Transactions on Parallel and Distributed Systems, 8(7):712–726, July 1997.
V. K. Naik, S. K. Setia, and M. S. Squilante. Performance analysis of job scheduling policies in parallel supercomputing environments. In Supercomputing 1993, pages 824–833, 1993.
L. M. Ni and P. K. McKinley. A survey of wormhole routing techniques in direct networks. IEEE Transactions on Computers, 1993.
C. A. F. D. Rose, H.-U. Heiss, and P. Navaux. Distributed processor allocation for large pc clusters. In 9th International Symposium on High Performance Distributed Computing, 2000.
Y. Zhu. Fast processor allocation and dynamic scheduling for mesh multicomputers. International Journal of Computer Systems Science and Engineering, 2(11):99–107, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Rose, C.A.F., Heiss, HU. (2001). Dynamic Processor Allocation in Large Mesh-Connected Multicomputers. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_110
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_110
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive