Notional processors: an approach for multiprocessor scheduling

Detalhes bibliográficos
Autor(a) principal: Bletsas, Konstantinos
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/3859
Resumo: Consider the problem of designing an algorithm with a high utilisation bound for scheduling sporadic tasks with implicit deadlines on identical processors. A task is characterised by its minimum interarrival time and its execution time. Task preemption and migration is permitted. Still, low preemption and migration counts are desirable. We formulate an algorithm with a utilisation bound no less than 66.¯6%, characterised by worst-case preemption counts comparing favorably against the state-of-the-art.
id RCAP_ba1de7f45fd48e660267d25b7d06c6ae
oai_identifier_str oai:recipp.ipp.pt:10400.22/3859
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 Notional processors: an approach for multiprocessor schedulingConsider the problem of designing an algorithm with a high utilisation bound for scheduling sporadic tasks with implicit deadlines on identical processors. A task is characterised by its minimum interarrival time and its execution time. Task preemption and migration is permitted. Still, low preemption and migration counts are desirable. We formulate an algorithm with a utilisation bound no less than 66.¯6%, characterised by worst-case preemption counts comparing favorably against the state-of-the-art.IEEERepositório Científico do Instituto Politécnico do PortoBletsas, KonstantinosAndersson, Björn2014-02-12T12:13:35Z20092009-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.22/3859eng978-0-7695-3636-11545-342110.1109/RTAS.2009.25info: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:42Zoai:recipp.ipp.pt:10400.22/3859Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:24:50.494520Repositó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 Notional processors: an approach for multiprocessor scheduling
title Notional processors: an approach for multiprocessor scheduling
spellingShingle Notional processors: an approach for multiprocessor scheduling
Bletsas, Konstantinos
title_short Notional processors: an approach for multiprocessor scheduling
title_full Notional processors: an approach for multiprocessor scheduling
title_fullStr Notional processors: an approach for multiprocessor scheduling
title_full_unstemmed Notional processors: an approach for multiprocessor scheduling
title_sort Notional processors: an approach for multiprocessor scheduling
author Bletsas, Konstantinos
author_facet Bletsas, Konstantinos
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 Bletsas, Konstantinos
Andersson, Björn
description Consider the problem of designing an algorithm with a high utilisation bound for scheduling sporadic tasks with implicit deadlines on identical processors. A task is characterised by its minimum interarrival time and its execution time. Task preemption and migration is permitted. Still, low preemption and migration counts are desirable. We formulate an algorithm with a utilisation bound no less than 66.¯6%, characterised by worst-case preemption counts comparing favorably against the state-of-the-art.
publishDate 2009
dc.date.none.fl_str_mv 2009
2009-01-01T00:00:00Z
2014-02-12T12:13:35Z
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/3859
url http://hdl.handle.net/10400.22/3859
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 978-0-7695-3636-1
1545-3421
10.1109/RTAS.2009.25
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 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_ 1799131341346832384

Registros relacionados