In my previous post, I briefly mentioned that if the execution order of iterations in a loop can be altered without affecting the result, it is possible to parallelize the loop. In this post, we will take a look at why this is the case, i.e., how is execution order related to parallelism. Moreover, we will see how this idea can be further exploited to optimize code for data locality, i.e., how can reordering of loop iterations result in using the same data (temporally or spatially) as much as possible, in order to efficiently utilize the memory hierarchy. Continue reading
Monthly Archives: December 2014
Engineering a Coding Curriculum
In a world driven by technology, there has been an emerging movement devoted to teaching kids how to program early on. As mentioned in my last post, teaching kids computer science in K-8 education has many benefits. But one problem is that there aren’t many tools out there that are able to teach computer science effectively for young students at affordable prices. The Wyss educational robotics team at Harvard sought to solve this problem.
Measuring the Occurrence of Security Bugs through Software Evolution – Part 2
Given the fact that security bugs are critical, one of the basic pursuits in every new software release should be to mitigate such bugs. In essence, security bugs should decrease as a project evolves. In a previous post I described how I measured the occurrence of security bugs through time and observed that security bugs actually increase as projects evolve. However, the corresponding experiment involved only four projects.