Abstract
The Kernighan/Lin graph partitioning heuristic, also known as min-cut or group migration, has been extended over several decades very successfully for circuit partitioning. Those extensions customized the heuristic and its associated data structure to rapidly compute the minimum-cut metric central to circuit partitioning; as such, those extensions are not directly applicable to other problems. In this paper, we extend the heuristic for functional partitioning, which in turn can solve the much investigated codesign problem of partitioning a system's coarse-grained functions among hardware and software components. The key extension customizes the heuristic and data structure to rapidly compute execution-time and communication metrics, crucial to hardware and software partitioning, and leads to near-linear time-complexity and excellent resulting quality. Another extension uses a new criteria for terminating the heuristic, eliminating time-consuming and unnecessary fine-tuning of a partition. Our experiments demonstrate extremely fast execution times (just a few seconds) with results matched only by the slower simulated annealing heuristic, meaning that the extended Kernighan/Lin heuristic will likely prove hard to beat for hardware and software functional partitioning.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Athanas and H. Silverman. Processor reconfiguration through instruction-set metamorphosis. IEEE Computer 26: 11–18, March 1993.
R. Hartenstein, J. Becker, and R. Kress. Two-level partitioning of image processing algorithms for the parallel map-oriented machine. In International Workshop on Hardware-Software Co-Design, pp. 77–84. 1996.
R. Ernst, J. Henkel, and T. Benner. Hardware-software cosynthesis for microcontrollers. In IEEE Design & Test of Computers, pp. 64–75, December 1994.
R. Gupta and G. DeMicheli. Hardware-software cosynthesis for digital systems. In IEEE Design & Test of Computers, pp. 29–41, October 1993.
D. Gajski, F. Vahid, S. Narayan, and J. Gong. Specification and Design of Embedded Systems. Prentice Hall, New Jersey, 1994.
F. Vahid, T. Le, and Y. Hsu. A comparison of functional and structural partitioning. In International Symposium on System Synthesis, pp. 121–126, 1996.
X. Xiong, E. Barros, and W. Rosentiel. A method for partitioning UNITY language in hardware and software. In Proceedings of the European Design Automation Conference (EuroDAC), 1994.
A. Kalavade and E. Lee. A global criticality/local phase driven algorithm for the constrained hardware/software partitioning problem. In International Workshop on Hardware-Software Co-Design, pp. 42–48, 1994.
P. Knudsen and J. Madsen. PACE: A dynamic programming algorithm for hardware/software partitioning. In International Workshop on Hardware-Software Co-Design, pp. 85–92, 1996.
A. Balboni, W. Fornaciari, and D. Sciuto. Partitioning and exploration strategies in the tosca co-design flow. In International Workshop on Hardware-Software Co-Design, pp. 62–69, 1993.
F. Vahid and D. Gajski. Closeness metrics for system-level functional partitioning. In Proceedings of the European Design Automation Conference (EuroDAC), pp. 328–333, 1995.
D. Gajski, S. Narayan, L. Ramachandran, F. Vahid, and P. Fung. System design methodologies: Aiming at the 100 h design cycle. IEEE Transactions on Very Large Scale Integration Systems 4(1): 70–82, 1996.
W. Wolf. Hardware-software co-design of embedded systems. Proceedings of the IEEE 82(7): 967–989, 1994.
D. Gajski and F. Vahid. Specification and design of embedded hardware-software systems. IEEE Design & Test of Computers 12(1): 53–67, 1995.
B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, February 1970.
T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. John Wiley and Sons, England, 1990.
C. Fiduccia and R. Mattheyses. A linear-time heuristic for improving network partitions. In Proceedings of the Design Automation Conference, 1982.
F. Vahid and D. Gajski. SLIF: A specification-level intermediate format for system design. In Proceedings of the European Design and Test Conference (EDTC), pp. 185–189, 1995.
F. Vahid. Procedure exlining: A transformation for improved system and behavioral synthesis. In International Symposium on System Synthesis, pp. 84–89, 1995.
J. Gong, D. Gajski, and S. Narayan. Software estimation using a generic processor model. In Proceedings of the European Design and Test Conference (EDTC), pp. 498–502, 1995.
F. Vahid and D. Gajski. Incremental hardware estimation during hardware/software functional partitioning. IEEE Transactions on Very Large Scale Integration Systems 3(3): 459–464, 1995.
S. Kirkpatrick, C. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science 220(4598): 671–680, 1983.
B. Krishnamurthy. An improved min-cut algorithm for partitioning VLSI networks. IEEE Transactions on Computers, May 1984.
L. Sanchis. Multiple-way network partitioning. IEEE Transactions on Computer-Aided Design, January 1989.
S. Narayan and D. Gajski. Synthesis of system-level bus interfaces. In Proceedings of the European Conference on Design Automation (EDAC), 1994.
F. Vahid and T. Le. Towards a model for hardware and software functional partitioning. In International Workshop on Hardware-Software Co-Design, pp. 116–123, 1996.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Vahid, F., Le, T.D. Extending the Kernighan/Lin Heuristic for Hardware and Software Functional Partitioning. Design Automation for Embedded Systems 2, 237–261 (1997). https://doi.org/10.1023/A:1008836303344
Issue Date:
DOI: https://doi.org/10.1023/A:1008836303344