Problem a3 multi core sta
Download
1 / 6

Problem - A3: Multi-Core STA - PowerPoint PPT Presentation


  • 134 Views
  • Uploaded on

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.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Problem - A3: Multi-Core STA' - ciara-oneil


An Image/Link below is provided (as is) to download presentation

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.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Problem a3 multi core sta
Problem - A3: Multi-Core STA

2011.01.18

Ching-Yi, Toothpick, Zheng-Shan, Jui-Hung


Outline
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.

  • That problem is similar to the one in ATPG, but a little bit different. We should guarantee each side-input on the path behaves in a satisfactory manner.

  • When timing is involved, things become even more complex.

  • Is there any existing method that can easily identify false paths so that we can remove them beforehand? (… further studies)


Multi core
Multi-core

  • Job division

    * Finding paths–

    Dividing POs to each processor and doing traversals respectively.

    * Finding vectors–

    Dividing paths to processors and running sensitization algorithm independently.


Implementation
Implementation

  • Data structure

    * Gate–

    gate name, input pins, output pins, etc.

    * Path–

    slack, starting PI, ending PO, passing pins, etc.

  • Parser

    Different from last time, the name of the pins and the name of each gate should be kept.


Future work
Future Work

  • Winter vacation

    * Finishing implementation of Parser

    * 1st version STA program


ad