A Hybrid Task Mapping Algorithm for Heterogeneous MPSoCs
نویسندگان
چکیده
منابع مشابه
Automatic Data Mapping for Heterogeneous MPSoCs
Heterogeneous multiprocessor system-on-a-chip (MPSoC) becomes an important platform to accelerate applications. However, programming tools and compilation techniques for memory management on MPSoCs still lag behind. This paper presents a data mapping framework to orchestrate the data movement between local memory and off-chip memory. Data alignment, data distribution, computation distribution a...
متن کاملHeuristic for Accelerating Run-Time Task Mapping in NoC-based Heterogeneous MPSoCs
In this paper, we propose a new packing strategy to find a free resource for run-time mapping of application tasks to NoC-based Heterogeneous MPSoC. The proposed strategy minimizes the task mapping time in addition to placing the communicating tasks close to each other. To evaluate our approach, a comparative study is carried out for a platform containing single task supported PEs. Experiments ...
متن کاملHeuristics for Routing and Spiral Run-time Task Mapping in NoC-based Heterogeneous MPSOCs
This paper describes a new Spiral Dynamic Task Mapping heuristic for mapping applications onto NoC-based Heterogeneous MPSoC. The heuristic proposed in this paper attempts to map the tasks of an applications that are most related to each other in spiral manner and to find the best possible path load that minimizes the communication overhead. In this context, we have realized a simulation enviro...
متن کاملExploring Task Mappings on Heterogeneous MPSoCs using a Bias-Elitist Genetic Algorithm
Exploration of task mappings plays a crucial role in achieving high performance in heterogeneous multi-processor system-on-chip (MPSoC) platforms. The problem of optimally mapping a set of tasks onto a set of given heterogeneous processors for maximal throughput has been known, in general, to be NP-complete. The problem is further exacerbated when multiple applications (i.e., bigger task sets) ...
متن کاملHybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Embedded Computing Systems
سال: 2015
ISSN: 1539-9087,1558-3465
DOI: 10.1145/2680542