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
FSF: A real-time scheduling architecture framework
Dpto. de Electrónica y Computadores, Universidad de Cantabria, Santander, Spain.
Department of Computer Science, University of York, United Kingdom.
Department of Computer Science, University of York, United Kingdom.
Department of Computer Science, University of York, United Kingdom.
Show others and affiliations
2006 (English)In: 12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'06): Proceedings, Institute of Electrical and Electronics Engineers (IEEE), 2006, p. 113-124Conference paper, Published paper (Refereed)
Abstract [en]

Scheduling theory generally assumes that real-time systems are mostly composed of activities with hard real-time requirements. Many systems are built today by composing different applications or components in the same system, leading to a mixture of many different kinds of requirements with small parts of the system having hard real-time requirements and other larger parts with requirements for more flexible scheduling and for quality of service. Hard real-time scheduling techniques are extremely pessimistic for the latter part of the application, and consequently it is necessary to use techniques that let the system resources be fully utilized to achieve the highest possible quality. This paper presents a framework for a scheduling architecture that provides the ability to compose several applications or components into the system, and to flexibly schedule the available resources while guaranteeing hard real-time requirements. The framework (called FSF) is independent of the underlying implementation, and can run on different underlying scheduling strategies. It is based on establishing service contracts that represent the complex and flexible requirements of the applications, and which are managed by the underlying system to provide the required level of service.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2006. p. 113-124
Series
IEEE Real-Time and Embedded Technology and Applications Symposium - Proceedings, ISSN 1545-3421
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:oru:diva-65218DOI: 10.1109/RTAS.2006.18ISI: 000237203800011Scopus ID: 2-s2.0-33749596310ISBN: 9780769525167 (print)ISBN: 0769525164 (print)OAI: oai:DiVA.org:oru-65218DiVA, id: diva2:1185602
Conference
12th IEEE Real-Time and Embedded Technology and Applications Symposium, San Jose, CA, United States, April 4-7, 2006
Available from: 2018-02-26 Created: 2018-02-26 Last updated: 2018-03-01Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Lennvall, Tomas

Search in DiVA

By author/editor
Dobrin, RaduLennvall, Tomas
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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