Comparison of Binding Approaches of Scheduled Multiphase Application onto Linear Multicore Architecture

As almost all applications run-time characteristics exhibit time varying phase behavior. So scheduling and binding strategy considering this behavior of applications plays an important role in achieving high throughput and less power consumption. In this paper, we have considered binding of already scheduled multiphase application on to linear multicore architecture. This approaches bind the scheduled applications on nearby cores and hence reduces the overall data movement. We have modeled over all data communication overhead of application on a linear architecture and use this model in binding. Also we have proposed and evaluated four different approaches for binding the multi-phase applications on linear multicore architecture. The proposed approach are (a) random iterative refinement, (b) biggest block left-right approach (c) biggest block center-center approach and (d) hierarchical binding using perfect minimum cost matching. Result shows that hierarchical binding using minimum cost perfect matching based approach outperform rest of the approaches.