The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50%
Autor(a) principal: | |
---|---|
Data de Publicação: | 2008 |
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/3963 |
Resumo: | Consider the problem of scheduling a set of sporadically arriving implicit-deadline tasks to meet deadlines on a uniprocessor. Static-priority scheduling is considered using the slack-monotonic priority-assignment scheme. We prove that its utilization bound is 50%. |
id |
RCAP_b87060f9c784aba7fd6b2de4ba6153fa |
---|---|
oai_identifier_str |
oai:recipp.ipp.pt:10400.22/3963 |
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 uniprocessor preemptive slack-monotonic scheduling is 50%Real-timeEmbedded systemsAlgorithmsPerformanceConsider the problem of scheduling a set of sporadically arriving implicit-deadline tasks to meet deadlines on a uniprocessor. Static-priority scheduling is considered using the slack-monotonic priority-assignment scheme. We prove that its utilization bound is 50%.ACMRepositório Científico do Instituto Politécnico do PortoAndersson, Björn2014-02-18T15:21:36Z20082008-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.22/3963eng978-1-59593-753-710.1145/1363686.1363760metadata 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:48Zoai:recipp.ipp.pt:10400.22/3963Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:24:55.119073Repositó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 uniprocessor preemptive slack-monotonic scheduling is 50% |
title |
The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50% |
spellingShingle |
The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50% Andersson, Björn Real-time Embedded systems Algorithms Performance |
title_short |
The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50% |
title_full |
The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50% |
title_fullStr |
The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50% |
title_full_unstemmed |
The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50% |
title_sort |
The utilization bound of uniprocessor preemptive slack-monotonic 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 Embedded systems Algorithms Performance |
topic |
Real-time Embedded systems Algorithms Performance |
description |
Consider the problem of scheduling a set of sporadically arriving implicit-deadline tasks to meet deadlines on a uniprocessor. Static-priority scheduling is considered using the slack-monotonic priority-assignment scheme. We prove that its utilization bound is 50%. |
publishDate |
2008 |
dc.date.none.fl_str_mv |
2008 2008-01-01T00:00:00Z 2014-02-18T15:21:36Z |
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/3963 |
url |
http://hdl.handle.net/10400.22/3963 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
978-1-59593-753-7 10.1145/1363686.1363760 |
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 |
ACM |
publisher.none.fl_str_mv |
ACM |
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_ |
1799131342309425152 |