Non-preemptive and SRP-based fullypreemptive scheduling of real-time Software Transactional Memory

• Autor(a) principal: Barros, António
• Data de Publicação: 2015
• Outros Autores: Pinho, Luís Miguel, Meumeu Yomsi, Patrick
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
• Texto Completo: http://hdl.handle.net/10400.22/7209
• topic: Real-time systems; Synchronization mechanisms; Software Transactional Memory; Non-preemptive scheduling; Stack Resource Protocol; Cache non-coherency; Multi-core platforms; Contention management

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.