Abstract
This paper describes two efficient algorithms, namely, the Redistribution algorithm and the Dynamic Grain Size algorithm, to divide large SIMD jobs among the various nodes of a Grid. An implementation (SHA1 hash reversing) of the algorithms on an 8 machine Grid is then discussed. The total time taken for execution is calculated under several scenarios and a detailed analysis and comparison is then provided. The results show that the Redistribution algorithm performs performs almost optimally. However, the requirements of the Redistribution algorithm may be too strict in practical scenarios and in such situations, the Dynamic Grain Size algorithm comes to the rescue and is only slightly more time consuming (with some exceptional cases).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Gokhale, J., Arsiwalla, A., Kurmi, A., Bindal, M., Iyer, S.: The Effect of Grain Size on the Performance of Grids running SIMD Algorithms. In: Proceedings of the International Conference on Control, Communication and Computing, Trivandrum, India (2010)
Gokhale, J., Arsiwalla, A., Kurmi, A., Bindal, M., Iyer, S.: Evaluation of Grid Architectures and the Study of Parallel Algorithms (2009)
Leinberger, W., Karypis, G., Kumar, V., Biswas, R.: Load Balancing Across Near-Homogeneous Multi-Resource Servers. IEEE, Los Alamitos (2000)
Kale, L., Kumar, S., Potnuru, M., DeSouza, J., Bandhakavi, S.: Faucets: Efficient Resource Allocation on the Computational Grid. In: Proceedings of the 2004 International Conference on Parallel Processing, ICPP 2004 (2004)
Karatza, H., Hilzer, R.: Performance Analysis of Parallel Job Scheduling in Distributed Systems. In: The 36th Annual Simulation Symposium (2003)
Kenneth, B., Jerome, P.: Sequential and Parallel Algorithms. Thomson, Brooks/Cole, Singapore (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kurmi, A., Iyer, S. (2010). Efficient Job Division for Grids Running SIMD Algorithms. In: Ranka, S., et al. Contemporary Computing. IC3 2010. Communications in Computer and Information Science, vol 94. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14834-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-14834-7_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14833-0
Online ISBN: 978-3-642-14834-7
eBook Packages: Computer ScienceComputer Science (R0)