A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary

Detalhes bibliográficos
Autor(a) principal: Raravi, Gurulingesh
Data de Publicação: 2011
Outros Autores: Andersson, Björn, Bletsas, Konstantinos
Tipo de documento: Relatório
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/3742
Resumo: Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee but for a stronger adversary.We conjecture that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast. We illustrate this with an example.
id RCAP_35d8c916e5b4639a3f5660408ef3dab5
oai_identifier_str oai:recipp.ipp.pt:10400.22/3742
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 A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversaryHeterogeneous multiprocessorTask migrationsReal-time schedulingConsider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee but for a stronger adversary.We conjecture that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast. We illustrate this with an example.IPP-Hurray GroupRepositório Científico do Instituto Politécnico do PortoRaravi, GurulingeshAndersson, BjörnBletsas, Konstantinos2014-02-06T14:57:21Z20112011-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/reportapplication/pdfhttp://hdl.handle.net/10400.22/3742enginfo: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:35Zoai:recipp.ipp.pt:10400.22/3742Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:24:45.100631Repositó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 A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary
title A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary
spellingShingle A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary
Raravi, Gurulingesh
Heterogeneous multiprocessor
Task migrations
Real-time scheduling
title_short A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary
title_full A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary
title_fullStr A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary
title_full_unstemmed A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary
title_sort A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary
author Raravi, Gurulingesh
author_facet Raravi, Gurulingesh
Andersson, Björn
Bletsas, Konstantinos
author_role author
author2 Andersson, Björn
Bletsas, Konstantinos
author2_role author
author
dc.contributor.none.fl_str_mv Repositório Científico do Instituto Politécnico do Porto
dc.contributor.author.fl_str_mv Raravi, Gurulingesh
Andersson, Björn
Bletsas, Konstantinos
dc.subject.por.fl_str_mv Heterogeneous multiprocessor
Task migrations
Real-time scheduling
topic Heterogeneous multiprocessor
Task migrations
Real-time scheduling
description Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee but for a stronger adversary.We conjecture that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast. We illustrate this with an example.
publishDate 2011
dc.date.none.fl_str_mv 2011
2011-01-01T00:00:00Z
2014-02-06T14:57:21Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/report
format report
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10400.22/3742
url http://hdl.handle.net/10400.22/3742
dc.language.iso.fl_str_mv eng
language eng
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 IPP-Hurray Group
publisher.none.fl_str_mv IPP-Hurray Group
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_ 1799131340456591360

Registros relacionados