Brussels / 3 & 4 February 2018

schedule

Shared Memory Parallelism in Ada: Load Balancing by Work Stealing


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.

Speakers

Photo of Jan Verschelde Jan Verschelde

Links