Abstract
This paper presents a formulation for the problem of partitioning the set of components on a power rail of a low power integrated circuit into power domains based on the usage patterns given by an application specific workload. We present an analysis of the underlying problem, proving that the problem is NP-complete. We propose a greedy algorithm for this problem and compare its solutions with a more exhaustive search based on a genetic algorithm formulation. It is shown through empirical evaluation that the greedy algorithm is in general a well suited algorithm for this problem.
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
Preview
Unable to display preview. Download preview PDF.
References
Kursun, V., Friedman, E.G.: Multi-voltage CMOS Circuit Design. Wiley (2006)
Roy, K., Prasad, S.C.: Low-power CMOS VLSI Circuit Design. Wiley-Inter Science (2000)
Lin, T., Chong, K.S., Gwee, B.H., Chang, J.S.: Fine-grained power gating for leakage and short-circuit power reduction by using asynchronous-logic. In: Proc. of ISCAS 2009, pp. 3162–3165 (2009)
Kanno, Y., et al.: Hierarchical Power Distribution with Power Tree in Dozens of Power Domains for 90-nm Low-Power Multi-CPU SoCs. IEEE Jour. of Solid State Circuits 42(1), 74–83 (2007)
Niedermeier, A., et al.: The challenges of implementing fine-grained power gating. In: Proc. of GLSVLSI (2010)
Sperling, E.: How many power islands is too many? (2009), http://chipdesignmag.com/lpd/blog/2009/05/13/how-many-power-islands-is-too-many/
Farrahi, A.H., Sarrafzadeh, M.: System partitioning to maximize sleep time. In: Proc. of ICCAD 1995, pp. 452–455 (1995)
Farrahi, A.H., et al.: Exploiting Sleep Mode for Memory Partitioning and Other Applications. VLSI Design 7(3), 271–287 (1998)
Ghafari, P., et al.: A Low-Power Partitioning Methodology by Maximizing Sleep Time and Minimizing Cut Nets. In: Proc. of the 5th Int. Workshop on SOC for Real-Time Appl. (IWSOC 2005), pp. 368–371 (2005)
Garey, M.R., Johnson, D.S.: Computers and Intractability - A guide to the theory of NP-completeness. W.H. Freeman and Company (1979)
Mandal, C.A., Chakrabarti, P.P., Ghose, S.: Design space exploration for data path synthesis. In: Proceedings of the Tenth International Conference on VLSI Design, pp. 166–171 (January 1997)
Mandal, C., Zimmer, R.M.: A genetic algorithm for the synthesis of structured data paths. In: Thirteenth International Conference on VLSI Design, pp. 206–211 (2000)
Maini, H., et al.: Genetic algorithms for graph partitioning and incremental graph partitioning. In: Proc. of Supercomputing 1994, pp. 449–457 (1994)
Shazely, S., Baraka, H.A., Wahab, A.H.A., Kamal, H.: Genetic Algorithms in Solving Graph Partitioning Problem. In: Imam, I., Kodratoff, Y., El-Dessouki, A., Ali, M. (eds.) IEA/AIE 1999. LNCS (LNAI), vol. 1611, pp. 155–164. Springer, Heidelberg (1999)
Xiao, L., et al.: Fixed-outline thermal-aware 3D floorplanning. In: Proc. of ASPDAC 2010, pp. 561–567 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dobriyal, A., Gonnabattula, R., Dasgupta, P., Mandal, C.R. (2012). Workload Driven Power Domain Partitioning. In: Rahaman, H., Chattopadhyay, S., Chattopadhyay, S. (eds) Progress in VLSI Design and Test. Lecture Notes in Computer Science, vol 7373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31494-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-31494-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31493-3
Online ISBN: 978-3-642-31494-0
eBook Packages: Computer ScienceComputer Science (R0)