Abstract
In this paper, we consider the problem of clustering combinatorial circuits for delay minimization, when logic replication is not allowed (CN). The problem of delay minimization when logic replication is allowed (CA) has been well studied, and is known to be solvable in polynomial-time [8]. However, unbounded logic replication can be quite expensive. Thus, CN is an important problem. We show that selected variants of CN are NP-hard. We also obtain approximability and inapproximability results for these problems.
V. Mkrtchyan and K. Subramani—The author is supported, in part, by the Air Force of Scientific Research through Award FA9550-12-1-0199.
K. Subramani—The author is supported by the National Science Foundation through Award CCF-1305054.
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
References
Cong, J., Ding, Y.: FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(1), 1–12 (1994)
Barke, E., Behrens, D., Hebrich, K.: Heirarchical partitioning. In: Proceedings of the IEEE International Conference on CAD, pp. 470–477 (1997)
Hwang, L.J., Gamal, A.E.: Min-cut replication in partitioned networks. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14, 96–106 (1995)
Cheng, C.-K., Liu, L.T., Kuo, M.-T.: A replication cut for two-way partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14, 623–630 (1995)
Lawler, E.L., Levitt, K.N., Turner, J.: Module clustering to minimize delay in digital networks. IEEE Trans. Comput. C–18(1), 47–57 (1966)
Kuh, E.S., Shih, M.: Circuit partitioning under capacity and I/O constraints. In: IEEE Custom Integrated Circuits Conference, vol. 28 (1994)
Brayton, R.K., Murgai, R., Sangiovanni-Vincentelli, A.: On clustering for minimum delay/area. In: International Conference on Computer Aided Design, pp. 6–9, November 1991
Rajaraman, R., Wong, D.F.: Optimal clustering for delay minimization. In: Proceedings of the 30th ACM/IEEE Design Automation Conference, pp. 309–314. IEEE Computer Society, Washington, DC, June 1993
Deng, W., Dutt, S.: VLSI circuit partitioning by cluster-removal using iterative improvement techniques. In: Proceedings of the IEEE International Conference on CAD, pp. 194–200 (1996)
Wong, D.F., Mak, W.-K.: Minimum replication min-cut partitioning. In: Proceedings of the IEEE International Conference on CAD, pp. 205–210 (1996)
Kagaris, D.: On minimum delay clustering without replication. Integr. VLSI J. 36, 27–39 (2003)
Shanavas, I.H., Gnanamurthy, R.K.: Wirelength minimization in partitioning and floorplanning using evolutionary algorithms. VLSI Design 2011, Article ID 896241, 9 (2011). doi:10.1155/2011/896241
Shanavas, I.H., Gnanamurthy, R.K.: Optimal solution for VLSI physical design automation using hybrid genetic algorithm. Math. Probl. Eng. 2014, Article ID 809642, 15 (2014). doi:10.1155/2014/809642
Koshy, T.: Boolean Algebra and Combinatorial Circuits, Discrete Mathematics with Applications, pp. 803–865. Elsevier Academic Press (2004)
Papadimitriou, C.M.: Computational Complexity. Addison-Wesley, Redaing (1994)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Donovan, Z., Mkrtchyan, V., Subramani, K. (2015). On Clustering Without Replication in Combinatorial Circuits. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, DZ. (eds) Combinatorial Optimization and Applications. Lecture Notes in Computer Science(), vol 9486. Springer, Cham. https://doi.org/10.1007/978-3-319-26626-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-26626-8_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26625-1
Online ISBN: 978-3-319-26626-8
eBook Packages: Computer ScienceComputer Science (R0)