Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/7209
Título: Non-preemptive and SRP-based fullypreemptive scheduling of real-time Software Transactional Memory
Autor: Barros, António
Pinho, Luis Miguel
Meumeu Yomsi, Patrick
Palavras-chave: Real-time systems
Synchronization mechanisms
Software Transactional Memory
Non-preemptive scheduling
Stack Resource Protocol
Cache non-coherency
Multi-core platforms
Contention management
Data: 2015
Editora: Elsevier
Relatório da Série N.º: Journal of Systems Architecture;Vol. 61, Issue 10
Resumo: Recent embedded processor architectures containing multiple heterogeneous cores and non-coherent caches renewed attention to the use of Software Transactional Memory (STM) as a building block for developing parallel applications. STM promises to ease concurrent and parallel software development, but relies on the possibility of abort conflicting transactions to maintain data consistency, which in turns affects the execution time of tasks carrying transactions. Because of this fact the timing behaviour of the task set may not be predictable, thus it is crucial to limit the execution time overheads resulting from aborts. In this paper we formalise a FIFO-based algorithm to order the sequence of commits of concurrent transactions. Then, we propose and evaluate two non-preemptive and one SRP-based fully-preemptive scheduling strategies, in order to avoid transaction starvation.
Peer review: yes
URI: http://hdl.handle.net/10400.22/7209
DOI: http://dx.doi.org/10.1016/j.sysarc.2015.07.008
Versão do Editor: http://www.sciencedirect.com/science/article/pii/S1383762115000788
Aparece nas colecções:ISEP – CISTER – Artigos

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
ART_CISTER_2015.pdf1,56 MBAdobe 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.