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
Guaranteeing Response Times for Aperiodic Tasks in Global Multiprocessor Scheduling
Responsible organisation
2007 (English)In: Real-time systems, ISSN 0922-6443, E-ISSN 1573-1383, Vol. 35, no 2, p. 135-151Article in journal (Refereed) Published
Abstract [en]

We provide a constant time schedulability test for an on-line multiprocessor server handling aperiodic tasks. Dhall's effect is avoided by dividing the tasks in two priority classes based on task utilization: heavy and light. We prove that if the load on the multiprocessor server stays below U threshold = 3 - root 7 approximately equals 35.425%, the server can accept an incoming aperiodic task and guarantee that the deadlines of all accepted tasks will be met. The same number 35.425% is also a threshold for a task to be characterized as heavy. The bound U threshold = 3 - root 7 approximately equals 35.425% is easy-to-use, but not sharp if we know the number of processors in the multiprocessor system. Assuming the server to be equipped with m processors, we calculate a formula for the sharp bound U threshold (m), which converges to U threshold from above as m -> infinity . The results are based on a utilization function u(x) = 2(1 - x)/(2 + root 2+2x). By using this function, the performance of the multiprocessor server can in some cases be improved beyond U threshold(m) by paying the extra overhead of monitoring the individual utilization of the current tasks.

Place, publisher, year, edition, pages
Dordrecht: Kluwer Academic Publishers , 2007. Vol. 35, no 2, p. 135-151
Keywords [en]
multiprocessors, response times
National Category
Mathematical Analysis Computer Sciences
Identifiers
URN: urn:nbn:se:bth-8982ISI: 000242831400002Local ID: oai:bth.se:forskinfo19EA184587E0A4D2C125733E004D8593OAI: oai:DiVA.org:bth-8982DiVA, id: diva2:836758
Available from: 2012-09-18 Created: 2007-08-21 Last updated: 2018-01-11Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records BETA

Lennerstad, HåkanLundberg, Lars

Search in DiVA

By author/editor
Lennerstad, HåkanLundberg, Lars
In the same journal
Real-time systems
Mathematical AnalysisComputer Sciences

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

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