mdh.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Flexible spin-lock model for resource sharing in multiprocessor real-time systems
Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.ORCID-id: 0000-0002-0474-2904
Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.ORCID-id: 0000-0002-1687-930X
Technische Universiteit Eindhoven, Eindhoven, Netherlands .ORCID-id: 0000-0001-6234-5117
Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.ORCID-id: 0000-0001-6132-7945
2014 (engelsk)Inngår i: Proc. IEEE Int. Symp. Ind. Embedded Syst., SIES, 2014, s. 41-51Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Various approaches can be utilized upon resource locking for mutually exclusive resource access in multiprocessor platforms. So far two conventional approaches exist for dealing with tasks that are blocked on a global resource in a multi-processor platform. Either the blocked task performs a busy wait, i.e. spins, at the highest priority level until the resource is released, or it is suspended. Although both approaches provide mutually exclusive access to resources, they can introduce long blocking delays to tasks, which may be unacceptable for many industrial applications. In this paper, we propose a general spin-based model for resource sharing in multiprocessor platforms in which the priority of the blocked tasks during spinning can be selected arbitrarily. Moreover, we provide the analysis for two selected spin-lock priorities and we show by means of a general comparison as well as specific examples that these solutions may provide a better performance for higher priority tasks.

sted, utgiver, år, opplag, sider
2014. s. 41-51
Serie
Proceedings of the 9th IEEE International Symposium on Industrial Embedded Systems, SIES 2014
Emneord [en]
Locks (fasteners), Real time systems, Access to resources, Better performance, Conventional approach, Global resources, Multi-processor platforms, Resource access, Resource locking, Resource sharing, Multiprocessing systems
HSV kategori
Identifikatorer
URN: urn:nbn:se:mdh:diva-25907DOI: 10.1109/SIES.2014.6871185ISI: 000345746200007Scopus ID: 2-s2.0-84906688738ISBN: 9781479940233 (tryckt)OAI: oai:DiVA.org:mdh-25907DiVA, id: diva2:746374
Konferanse
9th IEEE International Symposium on Industrial Embedded Systems, SIES 2014, 18 June 2014 through 20 June 2014, Pisa
Tilgjengelig fra: 2014-09-12 Laget: 2014-09-12 Sist oppdatert: 2018-01-11bibliografisk kontrollert
Inngår i avhandling
1. Lock-Based Resource Sharing in Real-Time Multiprocessor Platforms
Åpne denne publikasjonen i ny fane eller vindu >>Lock-Based Resource Sharing in Real-Time Multiprocessor Platforms
2014 (engelsk)Licentiatavhandling, med artikler (Annet vitenskapelig)
Abstract [en]

Embedded systems are typically resource constrained, i.e., resources such as processors, I/O devices, shared buffers or shared memory can be limited for tasks in the system. Therefore, techniques that enable an efficient usage of such resources are of great importance.

In the industry, typically large and complex software systems are divided into smaller parts (applications) where each part is developed independently. Migration towards multiprocessor platforms has become inevitable from an industrial perspective. Due to such migration and to efficient use of system resources, these applications eventually may be integrated on a shared multiprocessor platform. In order to facilitate the integration phase of the applications on a shared platform, the timing and resource requirements of each application can be provided in an interface when the application is developed. The system integrator can benefit from such provided information in the interface of each application to ease the integration process. In this thesis, we have provided the resource and timing requirements of each application in their interfaces for applications that may need several processors to be allocated on when they are developed.

Although many scheduling techniques have been studied for multiprocessor systems, these techniques are usually based on the assumption that tasks are independent, i.e. do not share resources other than the processors. This assumption is typically not true. In this thesis, we provide an extension to such systems to handle sharing of resources other than processor among tasks. Two traditional approaches exist for multiprocessor systems to schedule tasks on processors. A recent scheduling approach for multiprocessors has combined the two traditional approaches and achieved a hybrid more efficient approach compared to the two previous one. Due to the complex nature of this scheduling approach the conventional approaches for resource sharing could not be used straight forwardly. In this thesis, we have modified resource sharing approaches such that they can be used in such hybrid scheduling systems. A second concern is that enabling resource sharing in the systems can cause unpredictable delays and variations in response time of tasks which can degrade system performance. Therefore, it is of great significance to improve the resource handling techniques to reduce the effect of imposed delays caused by resource sharing in a multiprocessor platform. In this thesis we have proposed alternative techniques for resource handling that can improve system performance for special setups.

sted, utgiver, år, opplag, sider
Västerås: Mälardalen University, 2014
Serie
Mälardalen University Press Licentiate Theses, ISSN 1651-9256 ; 189
HSV kategori
Forskningsprogram
datavetenskap
Identifikatorer
urn:nbn:se:mdh:diva-26532 (URN)978-91-7485-178-6 (ISBN)
Presentation
2014-12-11, Lambda, Mälardalens högskola, Västerås, 09:15 (engelsk)
Opponent
Veileder
Tilgjengelig fra: 2014-11-12 Laget: 2014-11-11 Sist oppdatert: 2018-01-11bibliografisk kontrollert
2. Lock-Based Resource Sharing for Real-Time Multiprocessors
Åpne denne publikasjonen i ny fane eller vindu >>Lock-Based Resource Sharing for Real-Time Multiprocessors
2017 (engelsk)Doktoravhandling, med artikler (Annet vitenskapelig)
Abstract [en]

Embedded systems are widely used in the industry and are typically resource constrained, i.e., resources such as processors, I/O devices, shared buffers or shared memory might be limited in the system. Hence, techniques that can enable an efficient usage of processor bandwidths in such systems are of great importance. Locked-based resource sharing protocols are proposed as a solution to overcome resource limitation by allowing the available resources in the system to be safely shared. In recent years, due to a dramatic enhancement in the functionality of systems, a shift from single-core processors to multi-core processors has become inevitable from an industrial perspective to tackle the raised challenges due to increased system complexity. However, the resource sharing protocols are not fully mature for multi-core processors. The two classical multi-core processor resource sharing protocols, spin-based and suspension-based protocols, although providing mutually exclusive access to resources, can introduce long blocking delays to tasks, which may be unacceptable for many industrial applications. In this thesis we enhance the performance of resource sharing protocols for partitioned scheduling, which is the de-facto scheduling standard for industrial real-time multi-core processor systems such as in AUTOSAR, in terms of timing and memory requirements.

 

A new scheduling approach uses a resource efficient hybrid approach combining both partitioned and global scheduling where the partitioned scheduling is used to schedule the major number of tasks in the system. In such a scheduling approach applications with critical task sets use partitioned scheduling to achieve higher level of predictability. Then the unused bandwidth on each core that is remained from partitioning is used to schedule less critical task sets using global scheduling to achieve higher system utilization. These scheduling schema however lacks a proper resource sharing protocol since the existing protocols designed for partitioned and global scheduling cannot be directly applied due to the complex hybrid structure of these scheduling frameworks. In this thesis we propose a resource sharing solution for such a complex structure. Further, we provide the blocking bounds incurred to tasks under the proposed protocols and enhance the schedulability analysis, which is an essential requirement for real-time systems, with the provided blocking bounds.

sted, utgiver, år, opplag, sider
Västerås: Mälardalen University, 2017
Serie
Mälardalen University Press Dissertations, ISSN 1651-4238 ; 247
HSV kategori
Forskningsprogram
datavetenskap
Identifikatorer
urn:nbn:se:mdh:diva-37215 (URN)978-91-7485-361-2 (ISBN)
Disputas
2017-12-19, Kappa, Mälardalens högskola, Västerås, 13:30 (engelsk)
Opponent
Veileder
Tilgjengelig fra: 2017-11-07 Laget: 2017-11-06 Sist oppdatert: 2018-01-09bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Afshar, SaraBehnam, MorisBril, R. J.Nolte, Thomas

Søk i DiVA

Av forfatter/redaktør
Afshar, SaraBehnam, MorisBril, R. J.Nolte, Thomas
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 398 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf