Scheduling of multi-phase applications on to mesh multicore architecture

In this paper, we proposed a new approach for off-line scheduling and binding of multi-phase applications onto multicore where cores are connected using mesh topology. Multi-phase application can be easily modeled as chain of multiprocessor task. Our scheduling strategy uses critical tasks first heuristic along with dynamic programming to schedule the chain of multiprocessor task on to multiprocessor system. We modeled binding (phases to processors) problem in information theoretic model, geometric model and sequence alignment model. Finally using chain creation and efficient chain mapping strategy (based on mixed of all three model) to bind scheduled phases on to processor grid to reduce overall data movement overhead. Experiment results shown that our scheduling strategy takes up to 31% less makespan time than the simple critical first strategy to schedule all applications. Binding strategy reduces up to 49% data movement overhead compared to naive and others binding strategies.