Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/5410
Título: CPMD-mindful task assignment for NPS-F
Autor: Nelissen, Geoffrey
Bletsas, Konstantinos
Goossens, Joel
Palavras-chave: Real-time scheduling
Multiprocessor
Semi-partitioned
NPS-F
Bin packing
CPMD estimation
Data: 2014
Editora: Springer
Relatório da Série N.º: Real-Time Systems;Vol. 50, Issue 5-6
Resumo: 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.
Peer review: yes
URI: http://hdl.handle.net/10400.22/5410
DOI: 10.1007/s11241-014-9206-8
ISSN: 0922-6443
1573-1383
Versão do Editor: http://link.springer.com/article/10.1007%2Fs11241-014-9206-8
Aparece nas colecções:ISEP – CISTER – Artigos

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
ART9_CISTER_2014.pdf455,6 kBAdobe PDFVer/Abrir


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.