Competitive analysis of partitioned scheduling on uniform multiprocessors

Detalhes bibliográficos
Autor(a) principal: Andersson, Björn
Data de Publicação: 2007
Outros Autores: Tovar, Eduardo
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/3967
Resumo: Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can be preempted but they cannot migrate between processors. We propose an algorithm which can schedule all task sets that any other possible algorithm can schedule assuming that our algorithm is given processors that are three times faster.
id RCAP_326d689c91540a48b61a161b0e152765
oai_identifier_str oai:recipp.ipp.pt:10400.22/3967
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 Competitive analysis of partitioned scheduling on uniform multiprocessorsConsider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can be preempted but they cannot migrate between processors. We propose an algorithm which can schedule all task sets that any other possible algorithm can schedule assuming that our algorithm is given processors that are three times faster.IEEERepositório Científico do Instituto Politécnico do PortoAndersson, BjörnTovar, Eduardo2014-02-18T15:24:38Z20072007-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.22/3967eng1-4244-0910-110.1109/IPDPS.2007.370337metadata 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:47Zoai:recipp.ipp.pt:10400.22/3967Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:24:53.818346Repositó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 Competitive analysis of partitioned scheduling on uniform multiprocessors
title Competitive analysis of partitioned scheduling on uniform multiprocessors
spellingShingle Competitive analysis of partitioned scheduling on uniform multiprocessors
Andersson, Björn
title_short Competitive analysis of partitioned scheduling on uniform multiprocessors
title_full Competitive analysis of partitioned scheduling on uniform multiprocessors
title_fullStr Competitive analysis of partitioned scheduling on uniform multiprocessors
title_full_unstemmed Competitive analysis of partitioned scheduling on uniform multiprocessors
title_sort Competitive analysis of partitioned scheduling on uniform multiprocessors
author Andersson, Björn
author_facet Andersson, Björn
Tovar, Eduardo
author_role author
author2 Tovar, Eduardo
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 Andersson, Björn
Tovar, Eduardo
description Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can be preempted but they cannot migrate between processors. We propose an algorithm which can schedule all task sets that any other possible algorithm can schedule assuming that our algorithm is given processors that are three times faster.
publishDate 2007
dc.date.none.fl_str_mv 2007
2007-01-01T00:00:00Z
2014-02-18T15:24:38Z
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/3967
url http://hdl.handle.net/10400.22/3967
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 1-4244-0910-1
10.1109/IPDPS.2007.370337
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_ 1799131341410795520

Registros relacionados