This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | |||
2015-viennacl-mobile-hardware [2015/03/24 20:55] viennastar Added puzzle |
2015-viennacl-mobile-hardware [2015/04/06 15:28] (current) viennastar [ViennaCL: Target-Specific Tuning on Mobile (Smartphone and Tablet) Hardware] |
||
---|---|---|---|
Line 22: | Line 22: | ||
=== Puzzles === | === Puzzles === | ||
- | The task is to write one or more OpenCL kernels using the convenience wrappers provided by ViennaCL to find the character with highest ASCII code in a sequence ('vector<char>' in ViennaCL) of characters. For example, the character with highest ASCII code in “ABRACADRABRA” is 'R'. Come up with a good, fast and correct algorithm by extending the [[https://github.com/viennacl/viennacl-dev/blob/master/examples/tutorial/custom-kernels.cpp|Custom OpenCL kernels example]] provided with ViennaCL. | + | The task is to write one or more OpenCL kernels using the convenience wrappers provided by ViennaCL to find the character with highest ASCII code in a sequence ('vector<char>' in ViennaCL. **UPDATE Apr 6, 2015: Unfortunately there is a bug in the current ViennaCL which prohibits the use of vector<char>. Please use vector<int> instead for a sequence of integers.**) of characters. For example, the character with highest ASCII code in “ABRACADRABRA” is 'R'. Come up with a good, fast and correct algorithm by extending the [[https://github.com/viennacl/viennacl-dev/blob/master/examples/tutorial/custom-kernels.cpp|Custom OpenCL kernels example]] provided with ViennaCL. |
Contact rupp_AT_iue.tuwien.ac.at or stop by at the institute if you have questions. Submit the code and a performance plot for different sequence lenghts with your application. | Contact rupp_AT_iue.tuwien.ac.at or stop by at the institute if you have questions. Submit the code and a performance plot for different sequence lenghts with your application. | ||