Abstract
We propose a partitioning algorithm which combines a contiguous and a non-contiguous partitioning algorithm. The proposed partitioning algorithm overcomes the drawbacks caused by contiguous and non-contiguous partitioning algorithms; low processor utilization and long communication path. In this paper we deal with mesh-connected parallel computers and show a partitioning algorithm that combines the Adaptive Scan and the Multi Buddy. To show the performance improved by proposed algorithm, we conducted simulation runs under an assumption of wormhole routing and All-to-All message pattern. From the results we knew that the proposed algorithm improved utilization of a parallel computer and service for each task.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Ding and L. N. Bhuyan. An adaptive submesh allocation strategy for twodimensional mesh connected systems. Proceedings of International Conference on Parallel Processing, pages (II)193–200, 1993.
W. Liu, V. Lo, K. Windish, and B Nitzberg. Non-contiguous Processor Allocation Algorithms for Distributed Memory Multicomputers. Supercomputing, pages 227–236, 1994.
K. Windish, V. Lo, and Miller J. ProcSimity: An Experimental Tool for Processor Allocation and Scheduling in Highly Parallel Systems. Frontiers'95, pages 414–421, 1995.
L.M. Ni and P.K. McKinley. A Survey of Wormhole Routing Techniques in Direct Network. Computer, 26(2):62–76, 1993.
P. Chuang and N. Tzeng. An efficient submesh allocation strategy for mesh computer systems. Proceedings of the 11th International Conference on Distributed Computing Systems, pages 259–263, 1991.
K. Li and K. Cheng. A two dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system. Journal of Parallel and Distributed Computing, (12):79–83, 1991.
Y. Zhu. Efficient processor allocation strategies for mesh-connected parallel computers. Journal of Parallel and Distributed Computing, 16:328–337, 1992.
D. D. Sharma and D. K. Pradhan. A fast and efficient strategy for submesh allocation in mesh-connected parallel computers. Procedings of the 5th IEEE Symposium on Parallel and Distributed Processing, pages 682–689, 1993.
S.M. Yoo and H.Y. Youn. An efficient task allocation scheme for two-dimensional mesh-connected systems. Proceedings of the 15th International Conference on Distributed Computing Systems, pages 501–508, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Suzaki, K., Tanuma, H., Hirano, S., Ichisugi, Y., Connelly, C., Tsukamoto, M. (1996). Multi-tasking method on parallel computers which combines a contiguous and a non-contiguous processor partitioning algorithm. In: Waśniewski, J., Dongarra, J., Madsen, K., Olesen, D. (eds) Applied Parallel Computing Industrial Computation and Optimization. PARA 1996. Lecture Notes in Computer Science, vol 1184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62095-8_69
Download citation
DOI: https://doi.org/10.1007/3-540-62095-8_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62095-2
Online ISBN: 978-3-540-49643-4
eBook Packages: Springer Book Archive