Evidently, this is what we do.
Recent News Subscribe
Categories:
ICERM’12
Taking in the view at ICERM (Institute for Computational and Experimental Research in Mathematics), just before the start of a meeting on exascale algorithms, architectures, and programming [www]. I (Rich) gave a talk on Kent’s preliminary work that is developing a power- and area-constrained model for co-designing algorithms and architectures. Never before have I heard [...]
CPC’12
Cong is giving a talk on program inversion this week at the 16th Workshop on Compilers for Parallel Computing (CPC) [www]. UPDATE: Cong’s slides are here: [PDF]
Now computing @ NERSC
It’s not the same caliber as the number 1 song on the Top 40 list, but it will do.
CC’12 paper on program inversion
Congrats to Cong, George, Richard Fujimoto, and our collaborators at Livermore Lab (David Jefferson and Dan Quinlan) on their paper, “A new method for program inversion,” which will appear at the 2012 International Conference on Compiler Construction (CC’12) [www] this April. Roughly speaking, given a program P(In) ? Out, the inverse P-1(Out) reproduces In. This [...]
ICST’12 paper on Unicorn
Sangmin has a new paper on Unicorn, a tool to pinpoint the location of bugs in parallel and concurrent software programs. Unicorn generalizes his prior work on Falcon to include the case when a bug in a concurrent program involves more than variable (so-called multivariable atomicity violations). The Unicorn paper will appear in the 2012 [...]
PPoPP’12 paper
Congrats to Jaewoong, Aniruddha, and Hyesoon on their new paper! Citation: J. Sim, A. Dasgupta, H. Kim, R. Vuduc. Understanding benefits of GPGPU code optimizations using an analytical performance model. In Proc. Principles and Practice of Parallel Programming (PPoPP), New Orleans, LA, USA, Feb. 2012. (accepted)
