Brahma released!
After a lot of stumbling blocks with SelectMany and Lets, Brahma is finally out and it supports both of them. The latest release is 0.3, and can be found over at Sourceforge. This release contains 3 samples.
- A CPU vs GPU implementation of a the Odd-Even transposition sort. This shows comparable performance for sorting floats (simple calculations), and the GPU version is as much as 5 times faster when sorting Vectors, where the length of each vector needs to be computed.
- Conway’s Game of Life. This sample shows how to express logic in a query. Here the “rules” for the game of life are written as a single query and simulates “life” on a 512×512 grid.
- This example visualizes the Mandelbrot set using the escape time algorithm. An iterative version of the algorithm is implemented since it works well with queries. This is a sightly complex example and uses more than one query to compute a result. This shows how multiple queries can be strung together with no loss of performance.
I know a lot of you would like to see some sort of documentation, so I am working on a wiki which should be up soon. In the meantime, please direct all queries directly to me.
I would love your feedback, so if you have any comments or suggestions, drop me a line using the “Contact me” link.
