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
Multiprocessor Synchronization and Hierarchical 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-0002-1687-930X
Mälardalen Real-Time Research Centre, Mälardalen University, Västerås, Sweden.ORCID iD: 0000-0001-6132-7945
2009 (English)In: 2009 International Conference on Parallel Processing Workshops: Proceedings / [ed] Barolli, L; Feng, WC, IEEE, 2009, p. 58-64Conference paper, Published paper (Refereed)
Abstract [en]

Multi-core architectures have received significant interest as thermal and power consumption problems limit further increase of speed in single-cores. In the multi-core research community a considerable amount of work has been done on real-time multi-core scheduling algorithms where it is assumed tasks are independent. However, synchronization of dependent tasks executing on multi-cores has not received as much attention, even though typical real-time systems in practice include tasks that share resources.

In this paper we propose a synchronization protocol for hierarchically scheduledmulti-core systems, and we present a comparison between the presented protocol and existing multi-core synchronization protocols. The presented protocol groups dependent tasks that directly or indirectly share mutually exclusive resources into independent components. Within a component dependent tasks use classical uniprocessor synchronization protocols, such as the Stack-based Resource allocation Protocol. The components are then scheduled on the cores by a global scheduler.

There are two major approaches for scheduling multicore: partitioned and global scheduling. While most existing multi-core synchronization protocols support only one category, the protocol presented in this paper is developed to handle both scheduling approaches. The presented approach is developed to allow for co-execution of existing legacy real-time applications along with new applications, i.e., a legacy application is put into one or more components preserving its own (original) scheduling and synchronization protocols.

Place, publisher, year, edition, pages
IEEE, 2009. p. 58-64
Series
Proceedings of the International Conference on Parallel Processing, ISSN 0190-3918, E-ISSN 2332-5690
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:oru:diva-77153DOI: 10.1109/ICPPW.2009.44ISI: 000289915300010Scopus ID: 2-s2.0-77949505745ISBN: 978-1-4244-4923-1 (print)ISBN: 978-0-7695-3803-7 (electronic)OAI: oai:DiVA.org:oru-77153DiVA, id: diva2:1359705
Conference
38th International Conference on Parallel Processing Location, Vienna, Austria, September 22-25, 2009
Funder
Swedish Foundation for Strategic Research 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, FarhangBehnam, MorisNolte, Thomas

Search in DiVA

By author/editor
Nemati, FarhangBehnam, MorisNolte, Thomas
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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