CPMD-mindful task assignment for NPS-F

Geoffrey Nelissen, Konstantinos Bletsas, Joël Goossens

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review


The multiprocessor scheduling scheme NPS-F for sporadic tasks has a high utilisation bound and an overall number of preemptions bounded at design time. NPS-F binpacks tasks offline to as many servers as needed. At runtime, the scheduler ensures that each server is mapped to at most one of the m processors, at any instant. When scheduled, servers use EDF to select which of their tasks to run. Yet, unlike the overall number of preemptions, the migrations per se are not tightly bounded. Moreover, we cannot know a priori which task a server will be currently executing at the instant when it migrates. This uncertainty complicates the estimation of cache-related preemption and migration costs (CPMD), potentially resulting in their overestimation. Therefore, to simplify the CPMD estimation, we propose an amended bin-packing scheme for NPS-F allowing us (i) to identify at design time, which task migrates at which instant and (ii) bound a priori the number of migrating tasks, while preserving the utilisation bound of NPS-F.

Originele taal-2Engels
Pagina's (van-tot)585-591
Aantal pagina's7
TijdschriftReal-Time Systems
Nummer van het tijdschrift5-6
StatusGepubliceerd - 22 okt. 2014
Extern gepubliceerdJa


Duik in de onderzoeksthema's van 'CPMD-mindful task assignment for NPS-F'. Samen vormen ze een unieke vingerafdruk.

Citeer dit