Resource sharing in global fixed-priority preemptive multiprocessor scheduling

Detalhes bibliográficos
Autor(a) principal: Easwaran, Arvind
Data de Publicação: 2009
Outros Autores: Andersson, Björn
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/3838
Resumo: In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner. We develop a novel resource-sharing protocol and a corresponding schedulability test for this system. We also develop the first schedulability analysis of priority inheritance protocol for the aforementioned system. Finally, we show that these protocols are efficient (based on the developed schedulability tests) for a class of priority-assignments called reasonable priority-assignments.
id RCAP_b9b3f683e579b24539cb36fa4f567c65
oai_identifier_str oai:recipp.ipp.pt:10400.22/3838
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 Resource sharing in global fixed-priority preemptive multiprocessor schedulingIn this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner. We develop a novel resource-sharing protocol and a corresponding schedulability test for this system. We also develop the first schedulability analysis of priority inheritance protocol for the aforementioned system. Finally, we show that these protocols are efficient (based on the developed schedulability tests) for a class of priority-assignments called reasonable priority-assignments.IEEERepositório Científico do Instituto Politécnico do PortoEaswaran, ArvindAndersson, Björn2014-02-11T12:22:47Z20092009-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.22/3838eng978-0-7695-3875-41052-872510.1109/RTSS.2009.37metadata 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:41Zoai:recipp.ipp.pt:10400.22/3838Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:24:49.152943Repositó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 Resource sharing in global fixed-priority preemptive multiprocessor scheduling
title Resource sharing in global fixed-priority preemptive multiprocessor scheduling
spellingShingle Resource sharing in global fixed-priority preemptive multiprocessor scheduling
Easwaran, Arvind
title_short Resource sharing in global fixed-priority preemptive multiprocessor scheduling
title_full Resource sharing in global fixed-priority preemptive multiprocessor scheduling
title_fullStr Resource sharing in global fixed-priority preemptive multiprocessor scheduling
title_full_unstemmed Resource sharing in global fixed-priority preemptive multiprocessor scheduling
title_sort Resource sharing in global fixed-priority preemptive multiprocessor scheduling
author Easwaran, Arvind
author_facet Easwaran, Arvind
Andersson, Björn
author_role author
author2 Andersson, Björn
author2_role author
dc.contributor.none.fl_str_mv Repositório Científico do Instituto Politécnico do Porto
dc.contributor.author.fl_str_mv Easwaran, Arvind
Andersson, Björn
description In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner. We develop a novel resource-sharing protocol and a corresponding schedulability test for this system. We also develop the first schedulability analysis of priority inheritance protocol for the aforementioned system. Finally, we show that these protocols are efficient (based on the developed schedulability tests) for a class of priority-assignments called reasonable priority-assignments.
publishDate 2009
dc.date.none.fl_str_mv 2009
2009-01-01T00:00:00Z
2014-02-11T12:22:47Z
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/3838
url http://hdl.handle.net/10400.22/3838
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 978-0-7695-3875-4
1052-8725
10.1109/RTSS.2009.37
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_ 1799131340550963200

Registros relacionados