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
Partitioning Real-Time Systems on Multiprocessors with Shared Resources
Mälardalen Real-Time Research Centre, Västerås, Sweden.ORCID iD: 0000-0003-0316-7124
Mälardalen Real-Time Research Centre, Västerås, Sweden.ORCID iD: 0000-0001-6132-7945
Mälardalen Real-Time Research Centre, Västerås, Sweden.ORCID iD: 0000-0002-1687-930X
2010 (English)In: Principles of Distributed Systems / [ed] Lu, CY; Masuzawa, T; Mosbah, M, Springer , 2010, Vol. 6490, p. 253-269Conference paper, Published paper (Refereed)
Abstract [en]

There are two main approaches to task scheduling on multiprocessor/multi-core platforms; 1) global scheduling, under which migration of tasks among processors is allowed, and 2) partitioned scheduling under which tasks are allocated onto processors and task migration is not allowed. Under global scheduling a higher utilization bound can be achieved, but in practice the overheads of migrating tasks is high. On the other hand under partitioned scheduling, besides simplicity and efficiency, existing scheduling and synchronization methods developed for uniprocessor platforms can more easily be extended to partitioned scheduling. However the partitioned scheduling protocols suffer from the problem of partitioning tasks among processors/cores which is a bin-packing problem. Therefore, several heuristic algorithms have been developed for partitioning a task set on multiprocessor platforms. However, these algorithms typically assume independent tasks while in practice real-time systems often contain tasks that share resources and hence may block each other.

In this paper we propose a blocking-aware partitioning algorithm which allocates a task~set onto processors in a way that the overall amount of blocking times of tasks are decreased. The algorithm reduces the total utilization which, in turn, has the potential to decrease the total number of required processors (cores). In this paper we evaluate our algorithm and compare it with an existing similar algorithm. The comparison criteria includes both number of schedulable systems as well as processor reduction performance.

Place, publisher, year, edition, pages
Springer , 2010. Vol. 6490, p. 253-269
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 6490
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:oru:diva-77166DOI: 10.1007/978-3-642-17653-1_20ISI: 000290495600020Scopus ID: 2-s2.0-78650872347ISBN: 978-3-642-17652-4 (print)ISBN: 978-3-642-17653-1 (electronic)OAI: oai:DiVA.org:oru-77166DiVA, id: diva2:1359692
Conference
14th International Conference on Principles of Distributed Systems (OPODIS 2010), Tozeur, Tunisia, December 14-17, 2010
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, FarhangNolte, ThomasBehnam, Moris

Search in DiVA

By author/editor
Nemati, FarhangNolte, ThomasBehnam, Moris
Computer Sciences

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