Analysis of the truncated response model for fixed priority on HMPSoCs
Autor(a) principal: | |
---|---|
Data de Publicação: | 2014 |
Tipo de documento: | Dissertação |
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/10773/14836 |
Resumo: | With the ever more ubiquitous nature of embedded systems and their increasingly demanding applications, such as audio/video decoding and networking, the popularity of MultiProcessor Systems-on-Chip (MPSoCs) continues to increase. As such, their modern uses often involve the execution of multiple applications on the same system. Embedded systems often have applications that are faced with timing restrictions, some of which are deadlines, throughput and latency. The resources available to the applications running on these systems are nite and, therefore, applications need to share the available resources while guaranteeing that their timing requirements are met. These guarantees are established via schedulers which may employ some of the many techniques devised for the arbitration of resource usage among applications. The main technique considered in this dissertation is the Preemptive Fixed Priority (PFP) scheduling technique. Also, there is a growing trend in the usage of the data ow computational model for analysis of applications on MultiProcessor System-on-Chips (MPSoCs). Data ow graphs are functionally intuitive, and have interesting and useful analytical properties. This dissertation intends to further previous work done in temporal analysis of PFP scheduling of Real-Time applications on MPSoCs by implementing the truncated response model for PFP scheduling and analyzing the its results. This response model promises tighter bounds for the worst case response times of the actors in a low priority data ow graph by considering the worst case response times over consecutive rings of an actor rather than just a single ring. As a follow up to this work, we also introduce in this dissertation a burst analysis technique for actors in a data ow graph. |
id |
RCAP_b6a2d768e5ba54d1adc7931a6726989b |
---|---|
oai_identifier_str |
oai:ria.ua.pt:10773/14836 |
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 |
Analysis of the truncated response model for fixed priority on HMPSoCsEngenharia electrónicaComunicações em tempo realSistemas embebidosMultiprocessadoresMultiplexagemAnálise de séries temporaisWith the ever more ubiquitous nature of embedded systems and their increasingly demanding applications, such as audio/video decoding and networking, the popularity of MultiProcessor Systems-on-Chip (MPSoCs) continues to increase. As such, their modern uses often involve the execution of multiple applications on the same system. Embedded systems often have applications that are faced with timing restrictions, some of which are deadlines, throughput and latency. The resources available to the applications running on these systems are nite and, therefore, applications need to share the available resources while guaranteeing that their timing requirements are met. These guarantees are established via schedulers which may employ some of the many techniques devised for the arbitration of resource usage among applications. The main technique considered in this dissertation is the Preemptive Fixed Priority (PFP) scheduling technique. Also, there is a growing trend in the usage of the data ow computational model for analysis of applications on MultiProcessor System-on-Chips (MPSoCs). Data ow graphs are functionally intuitive, and have interesting and useful analytical properties. This dissertation intends to further previous work done in temporal analysis of PFP scheduling of Real-Time applications on MPSoCs by implementing the truncated response model for PFP scheduling and analyzing the its results. This response model promises tighter bounds for the worst case response times of the actors in a low priority data ow graph by considering the worst case response times over consecutive rings of an actor rather than just a single ring. As a follow up to this work, we also introduce in this dissertation a burst analysis technique for actors in a data ow graph.Com a natureza cada vez mais ubíqua de sistemas embutidos e as suas aplicações cada vez mais exigentes, como a decodicação de áudio/video e rede, a popularidade de MultiProcessor Systems-on-Chip (MPSoCs) continua a aumentar. Como tal, os seus usos modernos muitas vezes envolvem a execução de várias aplicações no mesmo sistema. Sistemas embutidos, frequentemente correm aplicações que são confrontadas com restrições temporais, algumas das quais são prazos, taxa de transferência e latência. Os recursos disponíveis para as aplicações que estão a correr nestes sistemas são finitos e, portanto, as aplicações necessitam de partilhar os recursos disponíveis, garantindo simultaneamente que os seus requisitos temporais sejam satisfeitos. Estas garantias são estabelecidas por meio escalonadores que podem empregar algumas das muitas técnicas elaboradas para a arbitragem de uso de recursos entre as aplicações. A técnica principal considerada nesta dissertação é Preemptive Fixed Priority (PFP). Além disso existe uma tendência crescente no uso do modelo computacional data flow para a análise de aplicações a correr em MPSoCs. Grafos data flow são funcionalmente intuitivos e possuem propriedades interessantes e úteis. Esta dissertação pretende avançar trabalho prévio na área de escalonamento PFP de aplicações ai implementar o modelo de resposta truncatedo para escalonamento PFP e analisar os seus resultados. Este modelo de resposta promete limites mais estritos para os tempos de resposta de pior caso para atores num grafo de baixa prioridade ao considerar os tempos de resposta de pior caso ao longo de várias execuções consecutivas de um actor em vez de uma só. Como seguimento a este trabalho, também introduzimos nesta dissertação uma técnica para a análise de execuções em rajada de atores num grafo data flow.Universidade de Aveiro2015-11-04T10:08:37Z2014-01-01T00:00:00Z2014info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisapplication/pdfhttp://hdl.handle.net/10773/14836TID:201578042engBrandão, Jesse Waydeinfo: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:RCAAP2024-02-22T11:27:14Zoai:ria.ua.pt:10773/14836Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T02:50:19.897445Repositó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 |
Analysis of the truncated response model for fixed priority on HMPSoCs |
title |
Analysis of the truncated response model for fixed priority on HMPSoCs |
spellingShingle |
Analysis of the truncated response model for fixed priority on HMPSoCs Brandão, Jesse Wayde Engenharia electrónica Comunicações em tempo real Sistemas embebidos Multiprocessadores Multiplexagem Análise de séries temporais |
title_short |
Analysis of the truncated response model for fixed priority on HMPSoCs |
title_full |
Analysis of the truncated response model for fixed priority on HMPSoCs |
title_fullStr |
Analysis of the truncated response model for fixed priority on HMPSoCs |
title_full_unstemmed |
Analysis of the truncated response model for fixed priority on HMPSoCs |
title_sort |
Analysis of the truncated response model for fixed priority on HMPSoCs |
author |
Brandão, Jesse Wayde |
author_facet |
Brandão, Jesse Wayde |
author_role |
author |
dc.contributor.author.fl_str_mv |
Brandão, Jesse Wayde |
dc.subject.por.fl_str_mv |
Engenharia electrónica Comunicações em tempo real Sistemas embebidos Multiprocessadores Multiplexagem Análise de séries temporais |
topic |
Engenharia electrónica Comunicações em tempo real Sistemas embebidos Multiprocessadores Multiplexagem Análise de séries temporais |
description |
With the ever more ubiquitous nature of embedded systems and their increasingly demanding applications, such as audio/video decoding and networking, the popularity of MultiProcessor Systems-on-Chip (MPSoCs) continues to increase. As such, their modern uses often involve the execution of multiple applications on the same system. Embedded systems often have applications that are faced with timing restrictions, some of which are deadlines, throughput and latency. The resources available to the applications running on these systems are nite and, therefore, applications need to share the available resources while guaranteeing that their timing requirements are met. These guarantees are established via schedulers which may employ some of the many techniques devised for the arbitration of resource usage among applications. The main technique considered in this dissertation is the Preemptive Fixed Priority (PFP) scheduling technique. Also, there is a growing trend in the usage of the data ow computational model for analysis of applications on MultiProcessor System-on-Chips (MPSoCs). Data ow graphs are functionally intuitive, and have interesting and useful analytical properties. This dissertation intends to further previous work done in temporal analysis of PFP scheduling of Real-Time applications on MPSoCs by implementing the truncated response model for PFP scheduling and analyzing the its results. This response model promises tighter bounds for the worst case response times of the actors in a low priority data ow graph by considering the worst case response times over consecutive rings of an actor rather than just a single ring. As a follow up to this work, we also introduce in this dissertation a burst analysis technique for actors in a data ow graph. |
publishDate |
2014 |
dc.date.none.fl_str_mv |
2014-01-01T00:00:00Z 2014 2015-11-04T10:08:37Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/masterThesis |
format |
masterThesis |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10773/14836 TID:201578042 |
url |
http://hdl.handle.net/10773/14836 |
identifier_str_mv |
TID:201578042 |
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 |
Universidade de Aveiro |
publisher.none.fl_str_mv |
Universidade de Aveiro |
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_ |
1799137553709793280 |