https://www.mdu.se/

mdu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Exact and Approximate Supply Bound Function for Multiprocessor Periodic Resource Model: Unsynchronized Servers
Mälardalen University, School of Innovation, Design and Engineering. (IS)ORCID iD: 0000-0003-2670-3022
Mälardalen University, School of Innovation, Design and Engineering. (IS)ORCID iD: 0000-0002-1687-930X
Mälardalen University, School of Innovation, Design and Engineering. (IS)ORCID iD: 0000-0001-6132-7945
2012 (English)Conference paper, Published paper (Refereed)
Abstract [en]

The Multi Processor Periodic Resource (MPR) model has been proposed for modeling compositional real-time systems which run on a shared multi processor hardware. In this paper we extend the MPR model such that the execution of virtual processors (servers) is not assumed to be synchronized i.e., the servers can have different phases. We believe that relaxing the server synchronization requirement provides greater deal of compatibility for implementing such a compositional method on various hardware platforms. We derive the resource supply bound function of the extended MPR model using an algorithm. Furthermore, we suggest an approach to calculate an approximate supply bound function with lower computational complexity for systems where calculating their supply bound function is computationally expensive.

Place, publisher, year, edition, pages
2012.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:mdh:diva-17389OAI: oai:DiVA.org:mdh-17389DiVA, id: diva2:579720
Conference
5th Workshop on Compositional Theory and Technology for Real-Time Embedded Systems (CRTS 2012), San Juan, Puerto Rico, December 4, 2012
Available from: 2012-12-20 Created: 2012-12-20 Last updated: 2015-09-24Bibliographically approved
In thesis
1. Adaptive and Flexible Scheduling Frameworks for Component-Based Real-Time Systems
Open this publication in new window or tab >>Adaptive and Flexible Scheduling Frameworks for Component-Based Real-Time Systems
2015 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Modern computer systems are often designed to play a multipurpose role. Therefore, they are capable of running a number of software components (software programs) simultaneously in parallel. These software components should share the system resources (e.g. processor and network) such that all of them run and finish their computations as expected. On the other hand, a number of software components have timing requirements meaning that they should not only access the resources, but this access should also be in a timely manner. Thus, there is a need to timely share the resources among different software components. The time-sharing is often realized by reserving a time-portion of resources for each component. Such a reservation should be adequate and resource-efficient. It should be sufficient to preserve the timing properties of the components. Also, the reservations should be resource-efficient to reduce the components' footprint on the resources which in turn allows integration of more software components on a given hardware resource. In this thesis, we mainly focus on the resource-efficiency of the reservations. We consider two cases. (I) Components which can tolerate occasional timing violations (soft real-time components): in this case we adjust the reservations during run-time to match the reservation sizes based on the instantaneous requirements of the components. (II) Components which cannot tolerate any timing violations (hard real-time components): in this case we use flexible approaches which allow us to improve the resource-efficiency at the design time.

Abstract [sv]

Moderna datasystem är ofta utformade för att spela en mångsidig roll. De är därför kapabla till att köra flera mjukvarukomponenter (programvaror) samtidigt. Dessa mjukvarukomponenter delar systemresurser (t.ex. processorn och nätverket) under körning. Målet med mjukvarukomponentens körning är att avsluta sina beräkningar som förväntat. Vissa mjukvarukomponenter har även tidskrav vilket innebär att de inte bara kräver tillgång till systemresurser för att köra sina beräkningar, utan de har även krav på när denna tillgång sker för att mjukvarukomponenterna ska för rätt funktion kunna garantera att beräkningar utförs i rätt tid. Således finns det ett behov av att snabbt dela resurser mellan olika mjukvarukomponenter. Den tids-delning realiseras ofta genom att reservera en tidslucka för komponenten då denna är tänkt att och får använda resursen. Reservationen måste vara tillräcklig för att mjukvarukomponenten ska kunna köra som förväntat. Reservationen måste även tilldelas resurseffektivt dvs resurstid får inte slösas bort i onödan. Genom en resurseffektiv reservation av resurserminskar komponentens fotavtryck på resursen som i sin tur möjliggör integration av flera programvarukomponenter på samma resurs. Denna avhandling fokuserar främst på resurseffektivitet i samband med reservationerna. Två fall behandlas. (I) Komponenter som tål att missa vissa enstaka tidskrav (så kallade mjuka realtidskomponenter): i det här fallet anpassas reservationerna under körning enligt komponenternas ständigt föränderliga önskemål på reservationsstorlek. (II) Komponenter som inte kan hantera att tidskrav överträds (så kallade hårda realtidskomponenter): i det här fallet används flexibla strategier som möjliggör  förbättrad resurseffektiviteten redan vid design av systemet.

Place, publisher, year, edition, pages
Västerås: Mälardalen University, 2015
Series
Mälardalen University Press Dissertations, ISSN 1651-4238 ; 191
National Category
Computer Engineering
Identifiers
urn:nbn:se:mdh:diva-29110 (URN)978-91-7485-235-6 (ISBN)
Public defence
2015-11-05, Lambda, Mälardalens högskola, Västerås, 13:15 (English)
Opponent
Supervisors
Available from: 2015-09-24 Created: 2015-09-23 Last updated: 2018-01-11Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

http://crts2012.ele.tue.nl/data/uploads/crts-2012-nima_moghaddami_khalilzad.pdf

Authority records

Moghaddami Khalilzad, NimaBehnam, MorisNolte, Thomas

Search in DiVA

By author/editor
Moghaddami Khalilzad, NimaBehnam, MorisNolte, Thomas
By organisation
School of Innovation, Design and Engineering
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 86 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf