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
Analyzing Fixed Priority Global Multiprocessor Scheduling.
Responsible organisation
2002 (English)Conference paper, (Refereed) Published
Abstract [en]

We consider a multiprocessor where hard real-time tasks are scheduled globally on m processors. Each task has a fixed priority and tasks are executed using preemptive scheduling. The state-of-the-art priority assignment scheme in such cases is called RM-US[US-LIMIT] [1], where US-LIMIT is a parameter to the RM-US algorithm. The challenge is to find the US-LIMIT that can gaurantee schedulability for as high utilization as possible. The previously best known US-LIMIT value could guarantee schedulability as long the multiprocessor utilization is below m/(3m-2), i.e. 0.33333 when m --> infinity. In this paper we define a new equation for US-LIMIT which quarantees schedulability for higher utilization values than the previous result. When m --> infinity we can now guarantee schedulability for all tasks sets when the multiprocessor utilization is below 0.37482. We also show that our US-LIMIT values are optimal, i.e. we show that there is no room for further improvement of this state-of-the-art priority assignment scheme.

Place, publisher, year, edition, pages
SAN JOSE, CA: IEEE COMPUTER SOC , 2002.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:bth-9843ISI: 000178662300014Local ID: oai:bth.se:forskinfo83915CC216A3A8AEC1256C2C0037C6B4ISBN: 0-7695-1739-0 (print)OAI: oai:DiVA.org:bth-9843DiVA: diva2:837804
Conference
8th IEEE Real-Time and Embedded Technology and Applications Symposium
Available from: 2012-09-18 Created: 2002-09-06 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Lundberg, Lars
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

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