Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/6856
Registo completo
Campo DCValorIdioma
dc.contributor.authorNelissen, Geoffrey-
dc.contributor.authorFonseca, José-
dc.contributor.authorRaravi, Gurulingesh-
dc.contributor.authorNélis, Vincent-
dc.description27th Euromicro Conference on Real-Time Systems (ECRTS 2015), Lund, Sweden.pt_PT
dc.description.abstractMany real-time systems include tasks that need to suspend their execution in order to externalize some of their operations or to wait for data, events or shared resources. Although commonly encountered in real-world systems, study of their timing analysis is still limited due to the problem complexity. In this paper, we invalidate a claim made in one of the earlier works [1], that led to the common belief that the timing analysis of one self-suspending task interacting with non-self-suspending sporadic tasks is much easier than in the periodic case. This work highlights the complexity of the problem and presents a method to compute the exact worst-case response time (WCRT) of a self-suspending task with one suspension region. However, as the complexity of the analysis might rapidly grow with the number of tasks, we also define an optimization formulation to compute an upper-bound on the WCRT for tasks with multiple suspendion regions. In the experiments, our optimization framework outperforms all previous analysis techniques and often finds the exact WCRT.pt_PT
dc.relation.ispartofseriesECRTS 2015;-
dc.titleTiming Analysis of Fixed Priority SelfSuspending Sporadic Taskspt_PT
degois.publication.location27th Euromicro Conference on Real-Time Systems (ECRTS 2015), Lund, Swedenpt_PT
Aparece nas colecções:ISEP – CISTER – Comunicações em eventos científicos

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

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote 

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