Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/3947
Título: A two-competitive approximate schedulability analysis of CAN
Autor: Andersson, Björn
Pereira, Nuno
Tovar, Eduardo
Data: 2007
Editora: IEEE
Relatório da Série N.º: Emerging Technologies and Factory Automation;
Resumo: Consider the problem of deciding whether a set of n sporadic message streams meet deadlines on a Controller Area Network (CAN) bus for a specified priority assignment. It is assumed that message streams have implicit deadlines and no release jitter. An algorithm to solve this problem is well known but unfortunately it time complexity is non-polynomial. We present an algorithm with polynomial time-complexity for computing an upper bound on the response times. Clearly, if the upper bound on the response time does not exceed the deadline then all deadlines are met. The pessimism of our approach is proven: if the upper bound of the response time exceeds the deadline then the response time exceeds the deadline as well for a CAN network with half the speed.
Peer review: yes
URI: http://hdl.handle.net/10400.22/3947
ISBN: 978-1-4244-0825-2
978-1-4244-0826-9
Versão do Editor: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4416947
Aparece nas colecções:ISEP – CISTER – Comunicações em eventos científicos

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
COM_NPereira_2007_CISTER.pdf211,04 kBAdobe PDFVer/Abrir    Acesso Restrito. Solicitar cópia ao autor!


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

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