Basser Seminar Series

Scheduling Hierarchical Malleable Task Graphs

Professor Dr Wolf Zimmermann
Martin-Luther-University, Halle-Wittenberg, Germany

Wednesday 10 August 2005 2-3pm

Basser Conference Room (G92) Madsen Building

Abstract

We show how task-scheduling techniques can be integrated into compilers for parallel languages. Such an integration allows to compile parallel languages without the need for explicit definition of data distributions and control-flow parallelism. Our approach is robust when libraries are used. The key technique is the use of hierarchically scheduling malleable tasks, i.e., tasks that can be executed on several processors. The talk discusses the relationship between parallel programs and hierarchical malleable task-graphs and discusses a scheduling approach for these task-graphs.

About the speaker

Wolf Zimmermann is since 2000 professor at Martin-Luther-University Halle-Wittenberg and chairs the programming languages and software-engineering group. He studied from 1982-1987 computer science at the University of Karlsruhe and received 1990 his PhD from this university. After a one year postdoc visit of the International Computer Science Institute in Berkeley, he returned to Karlsruhe as scientific assistant (comparable to assistant professor). He habilitated 1998 on Task-Scheduling for Optimization of Parallel Programs. His current research topics include those of this talk, construction of correct compilers and code generators, and checking of conformance to component protocols.