The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%

Detalhes bibliográficos
Autor(a) principal: Andersson, Björn
Data de Publicação: 2006
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/4014
Resumo: This paper studies static-priority preemptive scheduling on a multiprocessor using partitioned scheduling. We propose a new scheduling algorithm and prove that if the proposed algorithm is used and if less than 50% of the capacity is requested then all deadlines are met. It is known that for every static-priority multiprocessor scheduling algorithm, there is a task set that misses a deadline although the requested capacity is arbitrary close to 50%.
id RCAP_434c589014f91cd830fa034571c59a8d
oai_identifier_str oai:recipp.ipp.pt:10400.22/4014
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 The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%Real-time schedulingPartitioningBin-packing algorithmsStatic-priority schedulingPreemptive schedulingMultiprocessorsThis paper studies static-priority preemptive scheduling on a multiprocessor using partitioned scheduling. We propose a new scheduling algorithm and prove that if the proposed algorithm is used and if less than 50% of the capacity is requested then all deadlines are met. It is known that for every static-priority multiprocessor scheduling algorithm, there is a task set that misses a deadline although the requested capacity is arbitrary close to 50%.IOS PressRepositório Científico do Instituto Politécnico do PortoAndersson, Björn2014-02-21T10:46:08Z20062006-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.22/4014eng1740-446010.3233/JEC-2009-0107info: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:52Zoai:recipp.ipp.pt:10400.22/4014Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:24:57.217895Repositó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 The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%
title The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%
spellingShingle The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%
Andersson, Björn
Real-time scheduling
Partitioning
Bin-packing algorithms
Static-priority scheduling
Preemptive scheduling
Multiprocessors
title_short The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%
title_full The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%
title_fullStr The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%
title_full_unstemmed The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%
title_sort The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%
author Andersson, Björn
author_facet Andersson, Björn
author_role author
dc.contributor.none.fl_str_mv Repositório Científico do Instituto Politécnico do Porto
dc.contributor.author.fl_str_mv Andersson, Björn
dc.subject.por.fl_str_mv Real-time scheduling
Partitioning
Bin-packing algorithms
Static-priority scheduling
Preemptive scheduling
Multiprocessors
topic Real-time scheduling
Partitioning
Bin-packing algorithms
Static-priority scheduling
Preemptive scheduling
Multiprocessors
description This paper studies static-priority preemptive scheduling on a multiprocessor using partitioned scheduling. We propose a new scheduling algorithm and prove that if the proposed algorithm is used and if less than 50% of the capacity is requested then all deadlines are met. It is known that for every static-priority multiprocessor scheduling algorithm, there is a task set that misses a deadline although the requested capacity is arbitrary close to 50%.
publishDate 2006
dc.date.none.fl_str_mv 2006
2006-01-01T00:00:00Z
2014-02-21T10:46:08Z
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/4014
url http://hdl.handle.net/10400.22/4014
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 1740-4460
10.3233/JEC-2009-0107
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv IOS Press
publisher.none.fl_str_mv IOS Press
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_ 1799131342358708224

Registros relacionados