A new model for static mapping of parallel applications with task and data parallelism
暂无分享,去创建一个
The efficient mapping of parallel tasks is essential in order to exploit the gain from parallelisation. In this work, we focus on modelling and mapping message-passing applications that are defined by the programmer with an arbitrary interaction pattern among tasks. A new model is proposed, known as TTIG (Temporal Task Interaction Graph), which captures not only computation and communication costs, but also the percentages of concurrency between tasks. From this model, a mapping strategy is developed that minimises expected execution time by properly exploiting task parallelism. The effectiveness of this approach has been proven for a real image-processing application on a cluster of PCs.
[1] Frank D. Anger,et al. Scheduling Precedence Graphs in Systems with Interprocessor Communication Times , 1989, SIAM J. Comput..
[2] Fernando Guirado,et al. Exploiting Knowledge of Temporal Behaviour in Parallel Programs for Improving Distributed Mapping , 2000, Euro-Par.
[3] Y.-K. Kwok,et al. Static scheduling algorithms for allocating directed task graphs to multiprocessors , 1999, CSUR.
[4] Ana Cortés,et al. Clustering and reassignment-based mapping strategy for message-passing architectures , 2003, J. Syst. Archit..