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

Bibliographic Details
Main Author: Raravi, Gurulingesh
Publication Date: 2011
Other Authors: Andersson, Björn, Bletsas, Konstantinos
Format: Report
Language: eng
Source: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
Download full: http://hdl.handle.net/10400.22/3742
Summary: 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órios Científicos de Acesso Aberto de Portugal (RCAAP)
repository_id_str https://opendoar.ac.uk/repository/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 P.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ó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-02T02:50:50Zoai:recipp.ipp.pt:10400.22/3742Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-29T00:25:19.305261Repositó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 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 P.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ó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_ 1833600527637676032

Similar Items