Problem - A3: Multi-Core STA. 2011.01.18. Ching -Yi, Toothpick, Zheng -Shan, Jui -Hung. Outline. Research * STA * Multi-core Implementation * Data structure * Parser. STA. The most important and time-consuming part is finding vectors that can sensitize the corresponding paths.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Ching-Yi, Toothpick, Zheng-Shan, Jui-Hung
* Data structure
* Finding paths–
Dividing POs to each processor and doing traversals respectively.
* Finding vectors–
Dividing paths to processors and running sensitization algorithm independently.
gate name, input pins, output pins, etc.
slack, starting PI, ending PO, passing pins, etc.
Different from last time, the name of the pins and the name of each gate should be kept.
* Finishing implementation of Parser
* 1st version STA program