Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems
Autor(a) principal: | |
---|---|
Data de Publicação: | 2012 |
Outros Autores: | , |
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/3545 |
Resumo: | It is generally challenging to determine end-to-end delays of applications for maximizing the aggregate system utility subject to timing constraints. Many practical approaches suggest the use of intermediate deadline of tasks in order to control and upper-bound their end-to-end delays. This paper proposes a unified framework for different time-sensitive, global optimization problems, and solves them in a distributed manner using Lagrangian duality. The framework uses global viewpoints to assign intermediate deadlines, taking resource contention among tasks into consideration. For soft real-time tasks, the proposed framework effectively addresses the deadline assignment problem while maximizing the aggregate quality of service. For hard real-time tasks, we show that existing heuristic solutions to the deadline assignment problem can be incorporated into the proposed framework, enriching their mathematical interpretation. |
id |
RCAP_df124e967c32978306afb5fc8fd305e8 |
---|---|
oai_identifier_str |
oai:recipp.ipp.pt:10400.22/3545 |
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 |
Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systemsIntermediate deadline assignmentConvex optimizationSoft real-time distributed systemsHard real-time distributed systemsIt is generally challenging to determine end-to-end delays of applications for maximizing the aggregate system utility subject to timing constraints. Many practical approaches suggest the use of intermediate deadline of tasks in order to control and upper-bound their end-to-end delays. This paper proposes a unified framework for different time-sensitive, global optimization problems, and solves them in a distributed manner using Lagrangian duality. The framework uses global viewpoints to assign intermediate deadlines, taking resource contention among tasks into consideration. For soft real-time tasks, the proposed framework effectively addresses the deadline assignment problem while maximizing the aggregate quality of service. For hard real-time tasks, we show that existing heuristic solutions to the deadline assignment problem can be incorporated into the proposed framework, enriching their mathematical interpretation.ElsevierRepositório Científico do Instituto Politécnico do PortoLee, JinkyuShin, InsikEaswaran, Arvind2014-01-31T11:47:30Z20122012-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.22/3545eng0164-121210.1016/j.jss.2012.04.050info: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/3545Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:24:35.040597Repositó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 |
Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems |
title |
Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems |
spellingShingle |
Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems Lee, Jinkyu Intermediate deadline assignment Convex optimization Soft real-time distributed systems Hard real-time distributed systems |
title_short |
Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems |
title_full |
Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems |
title_fullStr |
Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems |
title_full_unstemmed |
Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems |
title_sort |
Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems |
author |
Lee, Jinkyu |
author_facet |
Lee, Jinkyu Shin, Insik Easwaran, Arvind |
author_role |
author |
author2 |
Shin, Insik Easwaran, Arvind |
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 |
Lee, Jinkyu Shin, Insik Easwaran, Arvind |
dc.subject.por.fl_str_mv |
Intermediate deadline assignment Convex optimization Soft real-time distributed systems Hard real-time distributed systems |
topic |
Intermediate deadline assignment Convex optimization Soft real-time distributed systems Hard real-time distributed systems |
description |
It is generally challenging to determine end-to-end delays of applications for maximizing the aggregate system utility subject to timing constraints. Many practical approaches suggest the use of intermediate deadline of tasks in order to control and upper-bound their end-to-end delays. This paper proposes a unified framework for different time-sensitive, global optimization problems, and solves them in a distributed manner using Lagrangian duality. The framework uses global viewpoints to assign intermediate deadlines, taking resource contention among tasks into consideration. For soft real-time tasks, the proposed framework effectively addresses the deadline assignment problem while maximizing the aggregate quality of service. For hard real-time tasks, we show that existing heuristic solutions to the deadline assignment problem can be incorporated into the proposed framework, enriching their mathematical interpretation. |
publishDate |
2012 |
dc.date.none.fl_str_mv |
2012 2012-01-01T00:00:00Z 2014-01-31T11:47:30Z |
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/3545 |
url |
http://hdl.handle.net/10400.22/3545 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
0164-1212 10.1016/j.jss.2012.04.050 |
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 |
Elsevier |
publisher.none.fl_str_mv |
Elsevier |
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_ |
1799131338963419136 |