12/03/2002
A. Code the matching algorithm where each node
in the decomposition is annotated with the cell that minimizes the maximum time
through the decomposition up to that point.
Status: Code complete. The selopt.csp file works completely. More testing needed on additional files (See technical questions below).
B. Code to write the net list for the matched network and generate statistics about how effective the hazard cover is.
Status: Under development.
C. Code to read in and parse a library file in
SIS format.
Status. Back burner.
D. Add code to do timed hazard checking with
level-based events.
Status: Algorithm under development. Awaiting input from Chris.
E. Add code to output warning about timing
issues.
Status: More files need to be run through and statistics need to start being compiled. Back burner.
F. Add code to free data structure memory after
use.
Status: Coding done but memory still leaking badly.
G. Add code to permute the inputs and compile
statistics on the number of hazardous nodes created.
Status: Back burner.
H. Reduce the number of parenthesis in the
Boolean expressions written to .acc files.
Status: Back burner.
I. Code to remove double inversions from my
output expressions.
Status: Back burner.
A. Technical
1. The csp files circ1, circ2, and alu1c core dump when running the decomposition (atacs –lctpyseD). (Probably timing related).
2. When writing a .acc file line for a circuit where one of the outputs is equal to a primary input, what timing numbers are used? The ones associated with the input or the ones associated with the output?
3.
B. Non-technical
1. Arrangements for trip to California.
2. Is a visa needed for Japan?
Status: Back burner.