Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors

Detalhes bibliográficos
Autor(a) principal: Raravi, Gurulingesh
Data de Publicação: 2013
Outros Autores: Andersson, Björn, Bletsas, Konstantinos
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/3541
Resumo: A preliminary version of this paper appeared in Proceedings of the 31st IEEE Real-Time Systems Symposium, 2010, pp. 239–248.
id RCAP_eb4d3ad43e9fb3604dd6605928d15ae7
oai_identifier_str oai:recipp.ipp.pt:10400.22/3541
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 Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processorsBin packingHeterogeneous multiprocessorsReal-time schedulingA preliminary version of this paper appeared in Proceedings of the 31st IEEE Real-Time Systems Symposium, 2010, pp. 239–248.Consider the problem of partitioned scheduling of an implicit-deadline sporadic task set on heterogeneous multiprocessors to meet all deadlines. Each processor is either of type-1 or type-2. We present a new algorithm, FF-3C, for this problem. FF-3C offers low time-complexity and provably good performance. Specifically, FF-3C offers (i) a time-complexity of O(n⋅max(m,logn)+m⋅logm), where n is the number of tasks and m is the number of processors and (ii) the guarantee that if a task set can be scheduled by an optimal partitioned-scheduling algorithm to meet all deadlines then FF-3C meets all deadlines as well if given processors at most 11−α times as fast (referred to as speed competitive ratio) and tasks are scheduled using EDF; where α is a property of the task set. The parameter α is in the range (0,0.5] and for each task, it holds that its utilization is no greater than α or greater than 1−α on each processor type. Thus, the speed competitive ratio of FF-3C can never exceed 2. We also present several extensions to FF-3C; these offer the same performance guarantee and time-complexity but with improved average-case performance. Via simulations, we compare the performance of our new algorithms and two state-of-the-art algorithms (and variations of the latter). We evaluate algorithms based on (i) running time and (ii) the necessary multiplication factor, i.e., the amount of extra speed of processors that the algorithm needs, for a given task set, so as to succeed, compared to an optimal task assignment algorithm. Overall, we observed that our new algorithms perform significantly better than the state-of-the-art. We also observed that our algorithms perform much better in practice, i.e., the necessary multiplication factor of the algorithms is much smaller than their speed competitive ratio. Finally, we also present a clustered version of the new algorithm.SpringerRepositório Científico do Instituto Politécnico do PortoRaravi, GurulingeshAndersson, BjörnBletsas, Konstantinos2014-01-31T11:14:38Z20132013-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.22/3541eng0922-644310.1007/s11241-012-9161-1info: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:23Zoai:recipp.ipp.pt:10400.22/3541Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:24:34.603719Repositó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 Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors
title Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors
spellingShingle Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors
Raravi, Gurulingesh
Bin packing
Heterogeneous multiprocessors
Real-time scheduling
title_short Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors
title_full Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors
title_fullStr Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors
title_full_unstemmed Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors
title_sort Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors
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 Bin packing
Heterogeneous multiprocessors
Real-time scheduling
topic Bin packing
Heterogeneous multiprocessors
Real-time scheduling
description A preliminary version of this paper appeared in Proceedings of the 31st IEEE Real-Time Systems Symposium, 2010, pp. 239–248.
publishDate 2013
dc.date.none.fl_str_mv 2013
2013-01-01T00:00:00Z
2014-01-31T11:14: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/3541
url http://hdl.handle.net/10400.22/3541
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 0922-6443
10.1007/s11241-012-9161-1
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 Springer
publisher.none.fl_str_mv Springer
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_ 1799131338955030528

Registros relacionados