Pregled bibliografske jedinice broj: 743721
Critical Path Method Based Heuristics for Mapping Application Software onto Heterogeneous MPSoCs
Critical Path Method Based Heuristics for Mapping Application Software onto Heterogeneous MPSoCs // Proceedings of MIPRO 2014 37th International Convention / Biljanović, Petar (ur.).
Opatija: Hrvatska udruga za informacijsku i komunikacijsku tehnologiju, elektroniku i mikroelektroniku - MIPRO, 2014. str. 1264-1268 doi:10.1109/MIPRO.2014.6859720 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 743721 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Critical Path Method Based Heuristics for Mapping Application Software onto Heterogeneous MPSoCs
Autori
Frid, Nikolina ; Sruk, Vlado
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Proceedings of MIPRO 2014 37th International Convention
/ Biljanović, Petar - Opatija : Hrvatska udruga za informacijsku i komunikacijsku tehnologiju, elektroniku i mikroelektroniku - MIPRO, 2014, 1264-1268
Skup
MIPRO 2014 37th International Convention
Mjesto i datum
Opatija, Hrvatska, 26.05.2014. - 30.05.2014
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
Design Space Exploration ; Software partitioning and mapping ; Task scheduling ; Critical Path Method
Sažetak
In this paper the authors propose new heuristics for automation of software partitioning and mapping onto heterogeneous multiprocessor System-on-Chip (MPSoC) platform – Longest Parallel Path mapping algorithm (LPP). In contrast with traditional approach to solving this NPcomplete problem – the Integer Linear Programming (ILP), our method uses a modified version of Critical Path Method with additional heuristics that rely on greedy approach. The algorithm performs one-to-many mapping of application to platform with minimizing the overall execution time of the application as the main objective. Our experiments with generic application model and several different platform layouts show that the proposed algorithm provides an efficient mapping scheme enabling significant execution speedup. In addition, the comparison with another greedy mapping algorithm shows that LPP algorithm exploits available task level parallelism better.
Izvorni jezik
Engleski
Znanstvena područja
Računarstvo
POVEZANOST RADA
Projekti:
036-0362980-1929 - Oblikovanje okolina za ugradene sustave (Sruk, Vlado, MZO ) ( CroRIS)
Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb
