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
Resource sharing in a hybrid partitioned/global scheduling framework for multiprocessors
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
Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.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
2015 (engelsk)Inngår i: IEEE International Conference on Emerging Technologies and Factory Automation, ETFA, 2015Konferansepaper, Publicerat paper (Fagfellevurdert)
Resurstyp
Text
Abstract [en]

For resource-constrained embedded real-time systems, resource-efficient approaches are very important. Such an approach is presented in this paper, targeting systems where a critical application is partitioned on a multi-core platform and the remaining capacity on each core is provided to a noncritical application using resource reservation techniques. To exploit the potential parallelism of the non-critical application, global scheduling is used for its constituent tasks. Previously, we enabled intra-application resource sharing for such a framework, i.e. each application has its own dedicated set of resources. In this paper, we enable inter-application resource sharing, in particular between the critical application and the non-critical application. This effectively enables resource sharing in a hybrid partitioned/global scheduling framework on multiprocessors. For resource sharing, we use a spin-based synchronization protocol. We derive blocking bounds and extend existing schedulability analysis for such a system.

sted, utgiver, år, opplag, sider
2015.
Emneord [en]
Job shop scheduling, Processor scheduling, Program processors, Protocols, Resource management, Servers, Synchronization, Embedded systems, Factory automation, Interactive computer systems, Multiprocessing systems, Network protocols, Optimization, Real time systems, Critical applications, Embedded real time systems, Resource reservations, Schedulability analysis, Scheduling frameworks, Synchronization protocols, Scheduling
HSV kategori
Identifikatorer
URN: urn:nbn:se:mdh:diva-31602DOI: 10.1109/ETFA.2015.7301456ISI: 000378564800057Scopus ID: 2-s2.0-84952909303ISBN: 9781467379298 (tryckt)OAI: oai:DiVA.org:mdh-31602DiVA, id: diva2:930305
Konferanse
20th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2015, 8 September 2015 through 11 September 2015
Tilgjengelig fra: 2016-05-23 Laget: 2016-05-19 Sist oppdatert: 2019-07-18bibliografisk kontrollert
Inngår i avhandling
1. 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

Søk i DiVA

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

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 227 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