Shared Memory Parallelism in Ada: Load Balancing by Work Stealing https://peertube.watch/videos/watch/fe389244-c6d2-4178-84cc-5cabbb774766 Tasking in Ada provides an effective tool for shared memory parallelism. For coarse grained regular parallelism, load balancing works with one single job queue. For finer grained and irregular parallelism, work stealing balances the load with multiple job queues. The programming concepts will be illustrated with examples of algorithms in polyhedral geometry. The demonstrated code belongs to the free and open source PHCpack, at https://github.com/janverschelde/PHCpack. Speaker: Jan Verschelde, Track: Ada, Room: AW1.125, When: Saturday 3 February 2018, 13:00–13:20 (Brussels time), Schedule: FOSDEM 2018 event page, Slides & links More info on Ada-Belgium web site, Licence: Creative Commons Attribution 2.0 Belgium (CC BY 2.0 BE) (as stated in the FOSDEM video archive). Attribution: “Shared Memory Parallelism in Ada: Load Balancing by Work Stealing” by Jan Verschelde, FOSDEM 2018. Original recording: 2018/AW1.125/ada_parallel.webm from the FOSDEM video archive. This channel is an unofficial mirror; FOSDEM is a free and non-commercial event organised by the community for the community. Sun, 11 Oct 2026 02:56:23 GMT https://validator.w3.org/feed/docs/rss2.html PeerTube - https://peertube.watch Shared Memory Parallelism in Ada: Load Balancing by Work Stealing https://peertube.watch/lazy-static/avatars/3b284627-b75f-409e-ac2e-10f4c2946f43.png https://peertube.watch/videos/watch/fe389244-c6d2-4178-84cc-5cabbb774766 All rights reserved, unless otherwise specified in the terms specified at https://peertube.watch/about and potential licenses granted by each content's rightholder.