oru.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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 among Real-Time Components under Multiprocessor Clustered Scheduling
Mälardalen Real-Time Research Centre, Mälardalen University, Västerås,Sweden.ORCID iD: 0000-0003-0316-7124
Mälardalen Real-Time Research Centre, Mälardalen University, Västerås,Sweden.ORCID iD: 0000-0001-6132-7945
2013 (English)In: Real-time systems, ISSN 0922-6443, E-ISSN 1573-1383, Vol. 49, no 5, p. 580-613Article in journal (Refereed) Published
Abstract [en]

In this paper we propose a general synchronization protocol for resource sharing among independently-developed real-time applications (components) on multi-core platforms. This protocol is a generalization of a previously proposed synchronization protocol (MSOS). In our proposed protocol, each component is statically allocated on a dedicated subset of processors (called cluster). A component has its own internal scheduler by which its tasks are scheduled. In this paper we focus on multiprocessor global fixed-priority preemptive scheduling algorithms to be used to schedule the tasks inside each component. Sharing the local resources is handled by the Priority Inheritance Protocol (PIP). For sharing the global resources (inter-component resource sharing) we have studied usage of FIFO and Round-Robin queues for access the resources across the components and usage of FIFO and prioritized queues inside the components. We have derived schedulability analysis for the different queue handling alternatives and compared their performance by using experimental evaluations. Finally, we have shown that the integration phase can be formulated in the form of a nonlinear integer programming problem where solution techniques in this domain can be used to minimize the total number of processors required to guarantee the schedulability of all components. As a proof of concept we have only provided the formulation for FIFO queues.

Place, publisher, year, edition, pages
Springer, 2013. Vol. 49, no 5, p. 580-613
Keywords [en]
Multiprocessor scheduling, Resource sharing, Clustered scheduling, Open systems on multi-cores
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:oru:diva-77164DOI: 10.1007/s11241-013-9180-6ISI: 000321960800002Scopus ID: 2-s2.0-84880324623OAI: oai:DiVA.org:oru-77164DiVA, id: diva2:1359693
Funder
Swedish Foundation for Strategic Research Swedish Research Council
Note

Funding Agency:

Mälardalen Real-Time Research Centre (MRTC)/Mälardalen University

Available from: 2019-10-10 Created: 2019-10-10 Last updated: 2019-10-17Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Nemati, FarhangNolte, Thomas

Search in DiVA

By author/editor
Nemati, FarhangNolte, Thomas
In the same journal
Real-time systems
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 10 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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