12/10/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. Testing needs to be done with the .acc files that are written out.
B. Code to cover the matched decomposition.
Status: Code complete. An intermediate form of circuit representation was coded that makes writing various forms of netlists very straightforward.
C. Code to write the .acc file representation of
the netlist from the intermediate form in (B) above.
Status: Code complete. Need to verify using atacs.
D. Code to produce a tabulated list of nodes
and their hazard properties.
Status: Front burner.
E. Code to read in and parse a library file in
SIS format.
Status. Back burner.
F. Add code to do timed hazard checking with
level-based events.
Status: Algorithm under development. Awaiting input from Chris.
G. Add code to output warning about timing
issues.
Status: Back burner.
H. Add code to free data structure memory after
use.
Status: Coding done but memory still leaking badly.
I. Add code to permute the inputs and compile
statistics on the number of hazardous nodes created.
Status: Back burner.
J. Reduce the number of parenthesis in the
Boolean expressions written to .acc files.
Status: Long way back burner.
K. Code to remove double inversions from my
output expressions.
Status: Long way back burner.
A. Technical
1. The csp files circ1, circ2, and alu1c core dump when running the decomposition (atacs –lctpyseD). This needs to be fixed. Middle burner.
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? (Answer - Input).
3.
B. Non-technical
1. Arrangements for trip to California. I have an airline ticket arriving Tuesday, Jan 7 and leaving Sunday, Jan 19th.
2. Is a visa needed for Japan?
Status: Toward the back burner.