These algorithms are written in NESL, which is perhaps the cleanest example of the oft-mentioned theory that parallel programming becomes simple in a functional

These algorithms are written in NESL, which is perhaps the cleanest example of the oft-mentioned theory that parallel programming becomes simple in a functional setting. It really is remarkable how flexible it is. Unfortunately, I'm not sure NESL ever managed to run particularly fast in practice.