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

Bibliographic Details
Main Author: Andersson, Björn
Publication Date: 2006
Format: Article
Language: eng
Source: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
Download full: http://hdl.handle.net/10400.22/4014
Summary: 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órios Científicos de Acesso Aberto de Portugal (RCAAP)
repository_id_str https://opendoar.ac.uk/repository/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 P.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-44601875-902510.3233/JEC-2009-0107info:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2025-04-02T03:26:06Zoai:recipp.ipp.pt:10400.22/4014Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-29T00:55:55.161230Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse
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 P.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
1875-9025
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órios Científicos de Acesso Aberto de Portugal (RCAAP)
instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron:RCAAP
instname_str FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron_str RCAAP
institution RCAAP
reponame_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
collection Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository.name.fl_str_mv Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
repository.mail.fl_str_mv info@rcaap.pt
_version_ 1833600761432375296

Similar Items