SUMMARYThis paper studies the static mapping of multiple applications on embedded many-core SoCs. The mapping techniques proposed in this paper take into account both inter-application and intra-application parallelism in order to fully utilize the potential parallelism of the manycore architecture. Two approaches are proposed for static mapping: one approach is based on integer linear programming and the other is based on a greedy algorithm. Experiments show the effectiveness of the proposed techniques.

No abstract

SUMMARYThis paper studies mapping techniques of multiple applications on embedded many-core SoCs. The mapping techniques proposed in this paper are static which means the mapping is decided at design time. The mapping techniques take into account both inter-application and intraapplication parallelism in order to fully utilize the potential parallelism of the many-core architecture. Additionally, the proposed static mapping supports dynamic application switching, which means the applications mapped onto the same cores are switched to each other at runtime. Two approaches are proposed for static mapping: one approach is based on integer linear programming and the other is based on a greedy algorithm. Experimental results show the effectiveness of the proposed techniques.

This paper studies a static task mapping algorithm with dynamic task switching for embedded many-core SoCs. The mapping algorithm proposed in this paper takes into account both inter-application and intra-application parallelisms in order to fully utilize the potential parallelism of the many-core architecture. The proposed algorithm is based on greedy-base approach, and the experimental results show the effectiveness of the proposed algorithm.

No abstract