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 Hold Times under Multiprocessor Static-Priority Global 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
2011 (English)In: 2011 IEEE 17th International Conference on Embedded and Real-Time Computing Systems and Applications. Volume 1: Proceedings, IEEE Computer Society , 2011, p. 197-206Conference paper, Published paper (Refereed)
Abstract [en]

Recently there has been a lot of interest in coexisting of multiple independently-developed real-time applications on a shared open platform. On the other hand, emerging of multi-core platforms and the performance and possibilities they offer has attracted a lot of attention in multiprocessor real-time analysis, protocols and techniques. Co-executing independently- developedreal-time applications on a shared multiprocessor system, where each application executes on a dedicated sub set of processors, requires to overcome the problem of handling mutually exclusive shared resources among those applications. To handle resource sharing, it is important to determine the Resource Hold Time (RHT), i.e., the maximum duration of time that an application locks a shared resource.

In this paper, we study resource hold times under multiprocessor static-priority global scheduling. We present how to compute RHT's for each resource in an application. We also show how to decrease the RHT's without compromising the schedulability of the application. We show that decreasing all RHT's for all shared resources is a multiobjective optimization problem and there can exist multiple Paretooptimal solutions.

Place, publisher, year, edition, pages
IEEE Computer Society , 2011. p. 197-206
Series
IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, ISSN 2325-1271, E-ISSN 2325-1301
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:oru:diva-77161DOI: 10.1109/RTCSA.2011.34ISI: 000410200400022Scopus ID: 2-s2.0-84855558902ISBN: 978-0-7695-4502-8 (print)OAI: oai:DiVA.org:oru-77161DiVA, id: diva2:1359698
Conference
17th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2011), Toyama, Japan, August 28-31, 2011
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
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 9 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