In the past week, I was working on the followings,

i) Debugged and tested the lp based time slack allocation algorithm for
   the mixed wire lengths
ii) Checked out the convex programming solver, MOSEK
    - Installed a trial version on horoscope
    - Got familiar with the syntax
    - Tested with a simple SOCP example with correlated variables.
      Principle Component Analysis can be avoided by coordinate 
      transformation, some math derivation is needed before coding.

As MOSEK is a commercial tool, and full version is supposed to be free
for a student as said on its website. It may be worthwhile to see how
long it takes to solve the LP problem for clma design and then we will have
a better understanding about the scalability of dTLC-LP algorithm.

On going work
i) Code on SOCP formulation after derivation.
ii) Proof-read the TVLSI paper
iii) Writing
iv) review FPGA'06 paper