Anith Gopal

Found test_benchmark , a true gem (pardon the pun) of a Rails plugin. Times each test case, then reports the top 10 slowest, or all if you ask e.g. rake test:all BENCHMARK=full You can also disable it by default if you add ENV['BENCHMARK'] ||= ‘none’ config/environments/test.rb, as per this post

In this second post about our investments in Excel 2010 performance I’m going to wrap up talking about the challenges and opportunities we embraced for this release, specifically on the topics of large data set scenarios, calculation performance and investment in new multi-core features. Large Data Set Performance With the introduction of a bigger grid in Excel 2007 and knowing that 64-bit Excel (see this post ) would enable our customers to really start taking advantage of all those cells, we took a closer look at our performance on large data sets.

Opera 10 has been released. This release of Opera sports a number of alluring, new features, many of them not seen in any of its contenders.

Here are my notes from the second day of ISMP .  ( Here are my day 1 notes. )  I spent the whole day going to IPM talks: Meszaros : Unfortunately I missed the plenary talk by Friedrich Eisenbrand due to microbrews.  I attended an IPM session after that – first up was Csaba Meszaros – interesting to hear from him because BPMPD has been such an impressive code for so many years.  His talk was about recent improvements in BPMPD .  BPMPD has been in continuous development for 15 years or so.  His recent work appears to focus on a) QCQP b) exploiting “hypersparsity”.  He is using a primal-dual log barrier method  – not a primal-dual HSD method as we at Solver Foundation have chosen for our SOCP solver.  So his handling of starting points and infeasibility detection is different.  He went into the tradeoffs between using augmented and normal systems for the search direction, which affect both performance and numerical stability.  He has implemented both and has logic on top to determine which to use.  He also talked about QCQP presolve, which often whittles down the size of “real” models substantially.   An interesting bit of trivia: he showed a table that compared lines of code in various modules, “then and now”: 2009 1981 Ordering 5700 155 Cholesky 2825 100 Backsolve 820 45 I think the difference is indicative of both Csaba’s commitment to improving BPMPD as well as the number of practical issues you need to think about when building an industrial grade solver.

I started to write a post on the Technical Conference coming up and realized other fellow bloggers probably beat me to it.  Since David did a great job talking about it, I’ll just point you to his post.