Sciweavers

Share
POPL
2008
ACM

Much ado about two (pearl): a pearl on parallel prefix computation

9 years 2 months ago
Much ado about two (pearl): a pearl on parallel prefix computation
This pearl develops a statement about parallel prefix computation in the spirit of Knuth's 0-1-Principle for oblivious sorting algorithms. It turns out that 0-1 is not quite enough here. The perfect hammer for the nails we are going to drive in is relational parametricity.
Janis Voigtländer
Added 03 Dec 2009
Updated 03 Dec 2009
Type Conference
Year 2008
Where POPL
Authors Janis Voigtländer
Comments (0)
books