Skip to content

strmxor optimization for prBoundary layer #1637

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
stefanottili opened this issue Feb 29, 2024 · 0 comments · Fixed by #1646
Closed

strmxor optimization for prBoundary layer #1637

stefanottili opened this issue Feb 29, 2024 · 0 comments · Fixed by #1646
Assignees
Milestone

Comments

@stefanottili
Copy link

stefanottili commented Feb 29, 2024

prBoundary layers are common in std cells, ram's/rom's (both bit cells and hierarchy) and in analog block hierarchy.
They are a worst case for scanlines, since there are a lot of them and they all touch at all edges.

With tens of million std cells and lot's of bits in ram's/rom's, this can leads to a large memory requirement for strmxor's scanline.

One option is to optimize the scanline memory footprint, which will be beneficial across the board.
The other option is to take advantage of "chip or block" prBoundary rectangles.

xor'ing prBoundary layers, one simple check can reduce the number of rectangles inserted in the scanline from several millions down to a couple:

"If there is a rectangle covering the bounding box of a cell, any other polygon/path in or in hierarchies below on this layer is already covered, no need to insert anything else into the scanline or to traverse hierarchy below."

@klayoutmatthias klayoutmatthias added this to the 0.29 milestone Mar 28, 2024
@klayoutmatthias klayoutmatthias self-assigned this Mar 28, 2024
@klayoutmatthias klayoutmatthias linked a pull request Mar 28, 2024 that will close this issue
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging a pull request may close this issue.

2 participants