Saturday, October 27, 2007

FOSS.IN list of talks announced

Check out

The list of talks looks really good and I know a lot of people presenting at FOSS.IN. I am co-presenting on one topic. I'd say this year FOSS.IN is going to rock, so make sure your there.

Monday, October 08, 2007

India vs Australia (quick analysis)

India won the T20 world cup and became champions! The 50-50 games seem to be a different playing ground for the Indian Team. Have you been wondering why India did not fair so well, so far. Here's a quick layman analysis

  1. India have not been batting first, in all the T20 matches we won, we batted first!
  2. The team has changed and so have the rules. Instead of a powerplay for 20 overs with catch in fielders around, T20 has restrictions for just 4 overs. This makes a big difference to players like Sehwag and Gambhir, who I think are more suited to the field being well spread out (survive longer)

Here's some advice for the Indian Team (given that Dhoni reads cricinfo, you never know if he might read this blog as well :-) )

  1. Convert the 50-50 match to a 20-20 match, by keeping wickets in hand till the 30th over
  2. While batting second, get Dhoni in at #3, followed by Yuvraj at #4
  3. Get Dravid to Open the batting while chasing
  4. Tendulkar should come 4/5 down while chasing (when there is a mandatory ball change)
  5. Don't ever get Yuvraj to Bowl :-)
  6. While bowling first, attack aggressively, even if it means that more runs will be conceded

Friday, October 05, 2007

Memory Ordering (Recommended Reading)

I just finished reading this wonderful report on memory ordering. I highly recommend reading it. If you have anything to do with multi-core, multi-processor, parallel programming, you'll find the paper very insightful.

Other good to read papers/articles on memory ordering from Paul Mckenney are
  1. C++ Data-Dependency Ordering. May 2007.
  2. Overview of Linux-Kernel Reference Counting. January 2007.
  3. A simple and efficient memory model for weakly ordered architectures. Makes case for weakly ordered primitives in programming languages. Updated May 2007.

Dynamic programming for the binomial coefficient

More fun things, this time with some visualisation of what happens when memoisation is used and what happens when we don't. I don'...