mdh.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
Resource sharing in a hybrid partitioned/global scheduling framework for multiprocessors
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0002-0474-2904
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0002-1687-930X
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. 0000-0002-1351-9245.ORCID iD: 0000-0001-6234-5117
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0001-6132-7945
2015 (English)In: IEEE International Conference on Emerging Technologies and Factory Automation, ETFA, 2015Conference paper, Published paper (Refereed)
Resource type
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.

Place, publisher, year, edition, pages
2015.
Keyword [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
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:mdh:diva-31602DOI: 10.1109/ETFA.2015.7301456ISI: 000378564800057Scopus ID: 2-s2.0-84952909303ISBN: 9781467379298 (print)OAI: oai:DiVA.org:mdh-31602DiVA: diva2:930305
Conference
20th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2015, 8 September 2015 through 11 September 2015
Available from: 2016-05-23 Created: 2016-05-19 Last updated: 2016-07-28Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Afshar, SaraBehnam, MorisBril, ReinderNolte, Thomas
By organisation
Embedded Systems
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 41 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