EDA Database ID-Wrapper Data Access Mechanism
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing EDA database systems face inefficiencies and instability due to pointer-based data access methods, which lead to memory overflow, data volatility, and low access efficiency, particularly in high-density and high-dimensional data networks used in VLSI design.
Innovation Solution
Implementing an ID-Based data indexing method using ID-Wrappers and ID-Mappers to access data objects, allowing for efficient and stable data access by converting IDs to memory addresses, thereby avoiding memory segmentation and leveraging caching mechanisms for improved performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If pointer-based data access methods are used, then data access flexibility is improved, but memory stability and reliability deteriorate due to memory overflow and data volatility
Solution Approach 1:
The patent introduces an ID-wrapper as an intermediary layer between the data object and the accessor. The ID-wrapper contains an ID-value that indirectly references the data object, rather than using direct memory pointers. This intermediary mechanism eliminates memory overflow risks and data volatility while maintaining data access flexibility, as the ID-value is stable and can be safely copied and stored in user memory.
2Ease of operation
If traditional pointer-based reference approach is used, then data access simplicity is improved, but data access efficiency deteriorates due to memory space segmentation
Solution Approach 1:
The patent segments the data access mechanism into two parts: a stable ID-value stored in the ID-wrapper, and the actual data object stored in the database. The ID-mapper is constructed in consecutive memory space, avoiding memory space segmentation penalties. This segmentation allows efficient data access by enabling the ID-mapper to be built in contiguous memory while keeping the data objects separately stored.
3Adaptability or versatility
If ID-mapper is constructed in segmented memory space, then flexibility in memory allocation is improved, but access performance deteriorates due to memory space segmentation
Solution Approach 1:
Instead of allowing the ID-mapper to be scattered in segmented memory space, the patent inverts the approach by constructing the ID-mapper in consecutive memory space. This inversion eliminates the performance penalty caused by memory space segmentation while maintaining the flexibility of ID-based referencing. The ID-mapper's contiguous structure improves cache performance and access speed.
Data Source
AI summary
Disclosed are a method and a device for constructing database model with ID-Based data indexing-enabled data accessing, applied to EDA software, comprising: in the creation stage of the database, assigning an ID to each data object, and creating corresponding ID Wrappers for different types of data objects respectively; a corresponding ID is stored in the ID Wrapper, and the ID is used for identifying the indexed data object, and the method of accessing the corresponding data object is software-encoded in the ID Wrapper; in the use stage of the database, each calculation module of the EDA software generates a data access requirement in the running process of the EDA software; directly using a corresponding ID Wrapper to access the corresponding data object; and executing a data access instruction written based on the programming rule in the ID Wrapper to access a desired data object.