Abstract
In this paper, we address multiway network partitioning problem of dividing the cells of network into multiple blocks so as to minimize the number of nets interconnecting cells in different blocks while balancing the blocks’ sizes. The sequential iterative improvement algorithm for the problem consists of several passes each of which is performed by repeatedly iterating the move operation. Therefore, the whole execution time taken by the algorithm is greatly affected by the number of the move operations and the execution time for each move operation. We present a fast parallel algorithm for solving the multiway network partiotioning problem by reducing both of them. We propose a new dynamic iterative method which reduces the number of move operations executed at each pass dynamically, and hence speed up the whole algorithm sharply. Moreover, we reduced the execution time of each move by its parallelization using the proper cell distribution.
This work has been supported by KRF
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
B. W. Kernighan and S. Lin, An Efficient Heuristic Procedure for Partitioning Graphs, Bell Syst. Tech. J., Vol. 49, Feb. 1970, pp. 291–307.
C. M. Fiduccia and R. M. Mattheyses, A Linear Time Heuristic for Improving Network Partitions, Proc. 19th Design Automation Conf., 1982, pp. 175–181.
B. Krishnamurthy, An Improved Min-cut Algorithm for Partitioning VLSI Networks, IEEE Trans. on Computers, Vol. C-33, May 1984, pp. 438–446.
J. U. Kim, C. H. Lee and M. H. Kim, An Efficient Multiple-way Network Partitioning Algorithm, Computer Aided Design, Vol. 25, Oct. 1993, pp. 269–280..
L. A. Sanchis, Multiple-way Network Partitioning, IEEE Trans. on Computers, Vol. C-38, Jan. 1989, pp. 62–81.
H. J. Siegel, A Model of SIMD Machines and a Comparison of Various Interconnection Networks, IEEE Trans. on Computers, Vol. 28, 1979 907–917.
C. K. Koc, A. Guvenc and B. Bakkaloglu, Exact Solution of Linear Equation on Distributed Memory Multiprocessors, Parallel Algorithms and Applications, Vol. 3, pp. 135–143.
B. Murthy, K. Bhuvaneswari, and C. S. Murthy, A New Algorithm based on Givens Rotations Solving Linear Equations on Fault-Tolerant Mehs-Connected Processors, IEEE Trans. on Parallel and Distributed Systems, 1998, pp. 825–832.
V. Kumar and et. al., Introduction to Parallel Computing: Design and Analysis of Algorithms, Benjamin/Cummings, 1994.
Q. M. Malluhi, M. A. Bayoumi and T. R. Rao, An Efficient Mapping of Multilayer Perception with Backpropataion Anns on Hypercubes, Proceedings of 5th IEEE symposium on Parallel and Distributed Processing, Dallas, Texas, 1993, pp. 368–375.
S. S. Gupta and B. P. Sinha, A Simple O(logN) Time Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs, Journal of Parallel and Distributed Computing 56, 1999, pp. 144–155.
K. D. Sajal, Parallel Graph Algorithms for Hypercube, Parallel Computing, Vol. 13, 1990, pp. 177–184.
R. A. Ayoubi and M. A. Bayoumi, Bitonic Sort on the Connection Machine, Parallel Algorithms and Applications, Vol. 3, 1994, pp. 151–161.
Y. Shih and J. Fier, Hypercube Systems and Key Applications, Parallel Processing for Supercomputing and AI, McGraw-Hill, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jeong, CS., Song, YM., Jo, SU. (2000). Dynamic Iterative Method for Fast Network Partitioning. In: Bubak, M., Afsarmanesh, H., Hertzberger, B., Williams, R. (eds) High Performance Computing and Networking. HPCN-Europe 2000. Lecture Notes in Computer Science, vol 1823. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45492-6_9
Download citation
DOI: https://doi.org/10.1007/3-540-45492-6_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67553-2
Online ISBN: 978-3-540-45492-2
eBook Packages: Springer Book Archive