Communication aware multiprocessor binding for shared memory systems

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

2 Downloads (Pure)

Samenvatting

We present a three-step binding algorithm for applications in the form of directed acyclic graphs (DAGs) of tasks with deadlines, that need to be bound to a shared memory multiprocessor platform. The aim of the algorithm is to obtain a good binding that results in low makespans of the schedules of the DAGs. It first clusters tasks assuming unlimited resources using a deadline-aware shared memory extension of the existing dominant sequence clustering algorithm. Second, the clusters produced are merged based on communication dependencies to fit into the number of available platform resources. As a final step, the clusters are allocated to the available resources by balancing the workload. The approach is compared to the state of the art bounded dominant sequence clustering (BDSC) algorithm that also performs clustering on a limited number of resources. We show that our three-step algorithm makes better use of the shared memory communication structure and produces significantly lower makespans than BDSC on benchmark cases.
Originele taal-2Engels
Titel11th IEEE International Symposium on Industrial Embedded Systems (SIES), Krakow, Poland, 23-25 May 2016
Plaats van productiePiscataway
UitgeverijInstitute of Electrical and Electronics Engineers
Pagina's1-10
Aantal pagina's10
ISBN van elektronische versie978-1-5090-2282-3
DOI's
StatusGepubliceerd - 2016
Evenement11th IEEE International Symposium on Industrial Embedded Systems (SIES 2016), May 23-25, 2016, Krakow, Poland - Krakow, Polen
Duur: 23 mei 201625 mei 2016
http://sies2016.org/

Congres

Congres11th IEEE International Symposium on Industrial Embedded Systems (SIES 2016), May 23-25, 2016, Krakow, Poland
Verkorte titelSIES 2016
LandPolen
StadKrakow
Periode23/05/1625/05/16
Internet adres

Vingerafdruk Duik in de onderzoeksthema's van 'Communication aware multiprocessor binding for shared memory systems'. Samen vormen ze een unieke vingerafdruk.

Citeer dit