Abstract
Any complex system, consisting of a large number of components, cannot be designed efficiently without decomposing it into a set of smaller subsystems. After the decomposition, each subsystem can be designed independently and simultaneously to speed up the design process. A system must be decomposed carefully so that the original functionality of the system is maintained. During the decomposition, an interface specification is generated which is used to connect all the subsystems. Usually, the system decomposition is done in a manner so as to minimize the interface interconnections between any two subsystems. The decomposition process should be simple and efficient so that the time required for the decomposition is a small fraction of the total design time. The process of decomposition is called partitioning. After partitioning, a subsystem may still be too large to be designed efficiently and may require further partitioning. Thus, partitioning can be used in a hierarchical manner until each subsystem is of manageable size. Partitioning is a general technique and is used in diverse areas. For example, in algorithm design, the divide and conquer approach is routinely used to partition complex problems into smaller and simpler problems. As the parallel computation techniques become more and more popular, combining partitioning and parallel processing techniques provides a promising tool for solving complex problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Sherwani, N.A. (1993). Partitioning. In: Algorithms for VLSI Physical Design Automation. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2219-2_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2219-2_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-2221-5
Online ISBN: 978-1-4757-2219-2
eBook Packages: Springer Book Archive