Igor Ostrovsky on August 29th, 2008

This article is the first one in a series titled Data structure zoo. Each article will give you a “working knowledge” of data structures that solve a particular problem. You won’t necessarily know how to implement each one, but you will have a good idea of the main characteristics of each solution and how to […]

Continue reading about Data structure zoo: ordered set

Igor Ostrovsky on August 13th, 2008

Performance of parallel programs is an interesting – but also tricky – issue. I put together an article for our team blog that talks about the most common reasons why a parallel program may not scale as desired: Developers ask why one program shows a parallel speedup but another one does not, or how to […]

Continue reading about Most Common Performance Issues in Parallel Programs

Igor Ostrovsky on August 11th, 2008

Big-Oh notation is a simple and powerful way to express how running time of a particular algorithm depends on the size of the input. When you say that a particular algorithm runs in O(N2) time, you mean that the number of steps the algorithm takes is proportional to the input size squared. Or, in mathematical […]

Continue reading about Big Oh in the parallel world