A Simulated Annealing-based Throughput-aware Task Mapping Algorithm for Manycore Processors
| Autor: | A.R. Tajary, H. Morshedlou |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2022 |
| Předmět: | |
| Zdroj: | Journal of Artificial Intelligence and Data Mining, Vol 10, Iss 3, Pp 311-320 (2022) |
| Druh dokumentu: | article |
| ISSN: | 2322-5211 2322-4444 |
| DOI: | 10.22044/jadm.2022.11518.2312 |
| Popis: | With the advent of having many processor cores on a single chip in many-core processors, the demand for exploiting these on-chip resources to boost the performance of applications has been increased. Task mapping is the problem of mapping the application tasks on these processor cores to achieve lower latency and better performance. Many researches are focused on minimizing the path between the tasks that demand high bandwidth for communication. Although using these methods can result in lower latency, but at the same time, it is possible to create congestion in the network which lowers the network throughput. In this paper, a throughput-aware method is proposed that uses simulated annealing for task mapping. The method is checked on several real-world applications and simulations are conducted on a cycle-accurate network on chip simulator. The results illustrate that the proposed method can achieve higher throughput while maintaining the delay in the NoC. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|