Practical aspects of slot-based task- splitting dispatching in its schedulability analysis
Autor(a) principal: | |
---|---|
Data de Publicação: | 2011 |
Outros Autores: | , , |
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 |
Resumo: | 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. |
id |
RCAP_17a0a431e72cc2595aacf342e552427e |
---|---|
oai_identifier_str |
oai:recipp.ipp.pt:10400.22/3805 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Practical aspects of slot-based task- splitting dispatching in its schedulability analysisMultiprocessor schedulingTask-splittingSchedulability analysisReal-time system overheadsConsider 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.IEEERepositório Científico do Instituto Politécnico do PortoSousa, Paulo BaltarejoBletsas, KonstantinosAndersson, BjörnTovar, Eduardo2014-02-07T15:19:00Z20112011-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.22/3805eng978-1-4577-1118-31533-230610.1109/RTCSA.2011.67metadata only accessinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-03-13T12:43:39Zoai:recipp.ipp.pt:10400.22/3805Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:24:47.642840Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Practical aspects of slot-based task- splitting dispatching in its schedulability analysis |
title |
Practical aspects of slot-based task- splitting dispatching in its schedulability analysis |
spellingShingle |
Practical aspects of slot-based task- splitting dispatching in its schedulability analysis Sousa, Paulo Baltarejo Multiprocessor scheduling Task-splitting Schedulability analysis Real-time system overheads |
title_short |
Practical aspects of slot-based task- splitting dispatching in its schedulability analysis |
title_full |
Practical aspects of slot-based task- splitting dispatching in its schedulability analysis |
title_fullStr |
Practical aspects of slot-based task- splitting dispatching in its schedulability analysis |
title_full_unstemmed |
Practical aspects of slot-based task- splitting dispatching in its schedulability analysis |
title_sort |
Practical aspects of slot-based task- splitting dispatching in its schedulability analysis |
author |
Sousa, Paulo Baltarejo |
author_facet |
Sousa, Paulo Baltarejo Bletsas, Konstantinos Andersson, Björn Tovar, Eduardo |
author_role |
author |
author2 |
Bletsas, Konstantinos Andersson, Björn Tovar, Eduardo |
author2_role |
author author author |
dc.contributor.none.fl_str_mv |
Repositório Científico do Instituto Politécnico do Porto |
dc.contributor.author.fl_str_mv |
Sousa, Paulo Baltarejo Bletsas, Konstantinos Andersson, Björn Tovar, Eduardo |
dc.subject.por.fl_str_mv |
Multiprocessor scheduling Task-splitting Schedulability analysis Real-time system overheads |
topic |
Multiprocessor scheduling Task-splitting Schedulability analysis Real-time system overheads |
description |
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. |
publishDate |
2011 |
dc.date.none.fl_str_mv |
2011 2011-01-01T00:00:00Z 2014-02-07T15:19:00Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10400.22/3805 |
url |
http://hdl.handle.net/10400.22/3805 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
978-1-4577-1118-3 1533-2306 10.1109/RTCSA.2011.67 |
dc.rights.driver.fl_str_mv |
metadata only access info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
metadata only access |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
IEEE |
publisher.none.fl_str_mv |
IEEE |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799131340515311616 |