Geometrical Layout Data Partitioning for Circuit Design
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for processing geometrical layout design data in electronic circuit design face inefficiencies due to high startup times and network congestion, leading to suboptimal utilization of processing resources and data duplication in computation networks.
Innovation Solution
A method and system that assign partitions of geometrical layout design data to computing devices based on predefined parameters, using a minimum-hierarchy representation and partition information, allowing for efficient distribution of processing load and reducing data transfer by dividing data into fragments and utilizing a processing database to manage resource allocation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If the server partitions the geometrical layout design data and transmits partitions to computing devices, then processing can be distributed and efficient, but startup time increases because partitioning must be completed first
Solution Approach 1:
The server pre-partitions the geometrical layout design data into multiple partitions and stores them in a partition database before computation requests arrive. When a computing device joins the network, it can immediately retrieve its assigned partition without waiting for server partitioning, thus eliminating startup delay while maintaining distributed processing efficiency
Solution Approach 2:
The geometrical layout design data is divided into multiple independent partitions that can be processed separately by different computing devices. This segmentation allows the server to prepare partitions in advance and enables computing devices to work independently on their assigned partitions, resolving the contradiction between distributed processing efficiency and startup time
2Productivity
If partitions are transmitted to computing devices simultaneously, then distributed processing is achieved, but network congestion occurs and server load increases
Solution Approach 1:
The server performs partitioning in advance and stores partitions in a database, so that when computing devices need data, they retrieve pre-prepared partitions individually rather than receiving multiple large transmissions simultaneously. This eliminates network congestion while maintaining distributed processing
Solution Approach 2:
Each computing device extracts and processes only its assigned partition from the database, rather than receiving and processing complete data sets. This extraction approach reduces network traffic and server load while achieving distributed processing of the geometrical layout design data
3Ease of operation
If the server sends complete geometrical layout design data to each computing device, then each device has full data for processing, but network congestion occurs due to huge data transmission
Solution Approach 1:
Each computing device receives and processes only the specific partition assigned to it, rather than receiving the complete geometrical layout design data. This extraction approach provides sufficient data for each device to perform its processing function while dramatically reducing network transmission load
Solution Approach 2:
The complete geometrical layout design data is segmented into multiple partitions stored in the database. Each computing device accesses only its assigned partition, ensuring data availability for processing while avoiding the network congestion that would result from transmitting complete data sets to all devices
4Productivity
If geometrical layout design data is copied on each computing device, then each device can process independently, but data duplication occurs leading to increased storage requirements
Solution Approach 1:
Each computing device extracts and stores only its assigned partition in local memory, rather than copying the complete geometrical layout design data. This provides sufficient data for independent processing of the assigned partition while minimizing storage requirements by eliminating unnecessary data duplication
Solution Approach 2:
The data is segmented into partitions, with each computing device holding only its assigned partition in memory. This segmentation enables independent processing capability for each device while reducing overall data duplication and storage requirements across the computation network
Data Source
AI summary
A method and system for processing geometrical layout design data in a computation network. The method includes assigning one or more partitions of the geometrical layout design data to one or more computing devices. One or more partitions are assigned based on first predefined parameters. The method further includes receiving a minimum-hierarchy representation of the geometrical layout design data and a partition information corresponding to one or more partition assigned. The partition information corresponding to a partition assigned includes a spatial information corresponding to the partition. Further, the minimum-hierarchy representation includes a plurality of cells. Each cell in the minimum-hierarchy representation may include zero or more bounding box information and zero or more cell-references. Further, the method includes retrieving one or more fragments based on each of the partition information and the minimum-hierarchy representation. A fragment can include one or more parts of a cell of the geometrical layout design data.