1. Data Structures
مرتضي صاحب الزماني

2. Layout Representation
مرتضي صاحب الزماني

3. Layout Representation
مرتضي صاحب الزماني

4. Layout Representation
Data Structures must be efficient i.t.o. time and space.
مرتضي صاحب الزماني

5. Atomic Operations for Layout Editors
مرتضي صاحب الزماني

6. Atomic Operations
مرتضي صاحب الزماني

7. Atomic Operations
مرتضي صاحب الزماني

8. Atomic Operations
مرتضي صاحب الزماني

9. Data Structures for Layout
مرتضي صاحب الزماني

10. Linked List Representation
Space Complexity: O(n)
n: Number of tiles.
Disadvantage: Long search time
Good for hierarchical specifications (limited number of modules)
مرتضي صاحب الزماني

11. Example: Neighbor Finding
y11
y12
y21
y22 R
مرتضي صاحب الزماني

12. Bin-Based Representation
Space Complexity: O(bn)
مرتضي صاحب الزماني

13. Example: Neighbor Finding
مرتضي صاحب الزماني

14. Bin-Based Representation
Bin Size:
If too small  too many bins  memory usage.
many empty bins  memory waste.
If too large  many blocks inside each bin
Large lists  slow.
مرتضي صاحب الزماني

15. Neighbor Pointers Space Complexity: O(n2)
No explicit space representation.
Difficult updating.
مرتضي صاحب الزماني