Problem - A3: Multi-Core STA

1 / 12

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

Problem - A3: Multi-Core STA. Ching -Yi, Toothpick, Zheng -Shan, Jui -Hung. 2011.03.25. Outline. STA Current progress The method of finding an input vector Example Future work. STA. Circuits. Read circuits. Paths matched the slack constraint. Paths matched the slack constraint.

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

## PowerPoint Slideshow about ' Problem - A3: Multi-Core STA' - arthur-richards

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

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

2011.03.25

Outline
• STA
• Current progress
• The method of finding an input vector
• Example
• Future work
STA

Circuits

Paths matched the slack constraint

Paths matched the slack constraint

Fill in the must-be values

Fill in the must-be values

Try to find an input vector

Try to find an input vector

Remaining things

Remaining things

Output files (paths & vectors)

Current progress

Circuits

Paths matched the slack constraint

Paths matched the slack constraint

Fill in the must-be values

Fill in the must-be values

Try to find an input vector

Try to find an input vector

Remaining things

Remaining things

Output files (paths & vectors)

The method of finding an input vector (1/3)
• Step 1

-Fill in must-be values by checking the possible arrival time.

• Step2

-Activate paths’ side inputs and decide PIs to apply.

• Step3

-Check if there is any back trace point that is not activated.

The method of finding an input vector (2/3)
• Find_pattern(Path){

If the Path is sensitized, return done.

Get a gate G with a value X from the Path’s side inputs.

Decide a value V that will be assigned to G.

If Activate(G, V) is successful

If Find_pattern(Path) is done, return done.

Deactivate(G).

If Activate(G, V) is successful

If Find_pattern(Path) is done, return done.

Deactivate(G).

else

Return not done.

}

The method of finding an input vector (3/3)
• Activate(G, V){

If the gate G’s value is V, return successful.

Back trace(G, V) to a PI and decide a value A to apply.

If Simulation(PI, A) is finished without any conflict.

If Activate(G, V) is successful, return successful.

If Simulation(PI, A ) is finished without any conflict.

If Activate(G, V) is successful, return successful.

Simulation(PI, X) and return not successful.

}

Example1
• Step1:Mark all the values that must be.

1

1

1

1

1

Example1
• Step2 : Apply r/f to this path’s PI.

: Activate all the side inputs with a value X.

1

0

1

r/1

1

1

1

1

0

1

1

0

0

0

1

Example 2
• Step1 :Mark all the values that must be.

1

0

0

1

1

0

1

1

1

0

Example 2
• Step2 : Apply r/f to this path’s PI.

: Activate all the side inputs with a value X.

1

0

f/0

0

0

1

1

0

0

1

1

1

0

Future work
• Finishing the remaining parts of path-sensitization
• Accelerate the program