Practical aspects of slot-based task- splitting dispatching in its schedulability analysis

• Autor(a) principal: Sousa, Paulo Baltarejo
• Data de Publicação: 2011
• Outros Autores: Bletsas, Konstantinos, Andersson, Björn, Tovar, Eduardo
• 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/3805
• topic: Multiprocessor scheduling; Task-splitting; Schedulability analysis; Real-time system overheads

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a tasksplitting scheduling algorithm. Task-splitting (also called semipartitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A certain type of task-splitting algorithms, called slot-based task-splitting, is of particular interest because of its ability to schedule tasks at high processor utilizations. We present a new schedulability analysis for slot-based task-splitting scheduling algorithms that takes the overhead into account and also a new task assignment algorithm.