To Örebro University

oru.seÖrebro University Publications
Change search
Refine search result
1 - 2 of 2
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • 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
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Aldea, M.
    et al.
    Dpto. de Electrónica y Computadores, Universidad de Cantabria, Santander, Spain.
    Bernat, G.
    Department of Computer Science, University of York, United Kingdom.
    Broster, I.
    Department of Computer Science, University of York, United Kingdom.
    Burns, A.
    Department of Computer Science, University of York, United Kingdom.
    Dobrin, Radu
    Computer Engineering Department, Mälardalen University, Vasterås, Sweden.
    Drake, J. M.
    Dpto. de Electrónica y Computadores, Universidad de Cantabria, Santander, Spain.
    Fohlet, Gerhard
    Computer Engineering Department, Mälardalen University, Vasterås, Sweden.
    Gai, P.
    ReTiS Lab., Scuola Superiore Sant'Anna, Pisa, Italy.
    Harbour, M. G.
    Dpto. de Electrónica y Computadores, Universidad de Cantabria, Santander, Spain.
    Guidi, G.
    ReTiS Lab., Scuola Superiore Sant'Anna, Pisa, Italy.
    Gutierrez, J. J.
    Dpto. de Electrónica y Computadores, Universidad de Cantabria, Santander, Spain.
    Lennvall, Tomas
    Computer Engineering Department, Mälardalen University, Vasterås, Sweden.
    Lipari, G.
    ReTiS Lab., Scuola Superiore Sant'Anna, Pisa, Italy.
    Martinez, J. M.
    Dpto. de Electrónica y Computadores, Universidad de Cantabria, Santander, Spain.
    Medina, J. L.
    Dpto. de Electrónica y Computadores, Universidad de Cantabria, Santander, Spain.
    Palencia, J. C.
    Dpto. de Electrónica y Computadores, Universidad de Cantabria, Santander, Spain.
    Trimarchi, M.
    ReTiS Lab., Scuola Superiore Sant'Anna, Pisa, Italy.
    FSF: A real-time scheduling architecture framework2006In: 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 (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.

  • 2.
    Fohler, Gerhard
    et al.
    Departement of Computer Science and Engineering, Mälardalen University, Västerås, Sweden.
    Lennvall, Tomas
    Departement of Computer Science and Engineering, Mälardalen University, Västerås, Sweden.
    Dobrin, Radu
    Departement of Computer Science and Engineering, Mälardalen University, Västerås, Sweden.
    A component based real-time scheduling architecture2003In: Architecting Dependable Systems / [ed] Rogério de Lemos, Cristina Gacek, Alexander Romanovsky, Springer , 2003, p. 110-125Chapter in book (Refereed)
    Abstract [en]

    Functionality for various services of scheduling algorithms is typically provided as extensions to a basic paradigm, intertwined in the kernel architecture. Thus, scheduling services come in packages around single paradigms, fixed to a certain methodology and kernel architecture. Temporal constraints of applications are addressed by a combination of scheduler and system architecture. Consequently, changing system architecture results in a complete rescheduling of all tasks, calling for a new cycle of analysis and testing from scratch, although a schedule meeting all temporal constraints already existed.

    We propose a component based architecture for schedule reuse. Instead of tying temporal constraints, scheduler, and system architecture together, we provide methods which allow for the reuse of existing schedules on various system architectures. In particular, we show how a schedule developed for table driven, dynamic or static priority paradigm can be reused in the other schemes.

    We address an architecture to disentangle actual scheduling from dispatching and other kernel routines with a small interface, suited for a variety of scheduling schemes as components.

1 - 2 of 2
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • 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