Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/3880
Título: Implementing multicore real-time scheduling algorithms based on task splitting using ada 2012
Autor: Andersson, Björn
Pinho, Luis Miguel
Palavras-chave: Ada
Real-time scheduling
Data: 2010
Editora: Springer
Relatório da Série N.º: Reliable Software Technologiey – Ada-Europe 2010; Vol. 6106
Resumo: Multiprocessors, particularly in the form of multicores, are becoming standard building blocks for executing reliable software. But their use for applications with hard real-time requirements is non-trivial. Well-known realtime scheduling algorithms in the uniprocessor context (Rate-Monotonic [1] or Earliest-Deadline-First [1]) do not perform well on multiprocessors. For this reason the scientific community in the area of real-time systems has produced new algorithms specifically for multiprocessors. In the meanwhile, a proposal [2] exists for extending the Ada language with new basic constructs which can be used for implementing new algorithms for real-time scheduling; the family of task splitting algorithms is one of them which was emphasized in the proposal [2]. Consequently, assessing whether existing task splitting multiprocessor scheduling algorithms can be implemented with these constructs is paramount. In this paper we present a list of state-of-art task-splitting multiprocessor scheduling algorithms and, for each of them, we present detailed Ada code that uses the new constructs.
Peer review: yes
URI: http://hdl.handle.net/10400.22/3880
ISBN: 978-3-642-13549-1
ISSN: 0302-9743
Versão do Editor: http://link.springer.com/chapter/10.1007%2F978-3-642-13550-7_4
Aparece nas colecções:ISEP – CISTER – Livro, parte de livro, ou capítulo de livro

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
CAPL_BAndersson_2010_CISTER.pdf96,21 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.