Task-based scheduling has emerged as one method to reduce the complexity of parallel computing. When using task- based schedulers, developers must frame their computation as a series of tasks with various data dependencies. The scheduler can take these tasks, along with their input and output dependencies, and schedule the task in parallel across a node or cluster. While these schedulers simplify the pro- cess of parallel software development, they can obfuscate the performance characteristics of the execution of an algorithm.
Tajo will present the work of Hauben et al. on visualizing task-based scheduling from the VPA 2015 workshop.
Posted by: Nathan Galli