https://sbs.thielescholz.eu/ 2026-04-08T03:58:27+00:00 https://sbs.thielescholz.eu/ https://sbs.thielescholz.eu/lib/exe/fetch.php?media=favicon.ico text/html 2022-09-05T11:38:05+00:00 Anonymous (anonymous@undisclosed.example.com) https://sbs.thielescholz.eu/doku.php?id=bsc:2022:0217_2022_02_15_sijmen_van_bommel&rev=1662377885&do=diff 2022/02/15 Sijmen van Bommel Sijmen is looking into transforming recursively formulated data-parallel algorithms into flat data-parallelism. This is similar to detecting tail-end-recursion and transforming it into loops, but applies the well-known (map f) ° (map g) = map (f°g) equation through the recursion instead of constructing a loop. text/html 2022-02-17T09:08:34+00:00 Anonymous (anonymous@undisclosed.example.com) https://sbs.thielescholz.eu/doku.php?id=bsc:2022:0217_2022_02_17_tom_jannsen&rev=1645088914&do=diff 2022/02/17 Tom Jannsen Tom implements a version of shared memory across a swarm of arduino-like IoT devices. text/html 2022-09-05T11:41:00+00:00 Anonymous (anonymous@undisclosed.example.com) https://sbs.thielescholz.eu/doku.php?id=bsc:2022:0905_2022_09_05_thomas_broekman&rev=1662378060&do=diff 2022/09/05 Thomas Broekman Thomas will investigate productivity and performance of using HLS tools for generating FPGA codes for stencil computations.