SwePub
Sök i LIBRIS databas

  Extended search

(db:Swepub) lar1:(oru) srt2:(2000-2004) lar1:(mdh)
 

Search: (db:Swepub) lar1:(oru) srt2:(2000-2004) lar1:(mdh) > A component based r...

  • Fohler, GerhardDepartement of Computer Science and Engineering, Mälardalen University, Västerås, Sweden (author)

A component based real-time scheduling architecture

  • Article/chapterEnglish2003

Publisher, publication year, extent ...

  • 2007-07-31
  • Berlin, Heidelberg :Springer,2003
  • printrdacarrier

Numbers

  • LIBRIS-ID:oai:DiVA.org:oru-65224
  • https://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-65224URI
  • https://doi.org/10.1007/3-540-45177-3_5DOI
  • https://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-20982URI

Supplementary language notes

  • Language:English
  • Summary in:English

Part of subdatabase

Classification

  • Subject category:ref swepub-contenttype
  • Subject category:kap swepub-publicationtype

Notes

  • ICSE 2002 Workshop on Software Architectures for Dependable Systems (WADS 2002), 25 May 2002 through 25 May 2002, Orlando, FL
  • ICSE 2002 Workshop on Software Architectures for Dependable Systems, WADS 2002, 25 May 2002 through 25 May 2002, Orlando, FL
  • 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.

Subject headings and genre

Added entries (persons, corporate bodies, meetings, titles ...)

  • Lennvall, Tomas,1974-Departement of Computer Science and Engineering, Mälardalen University, Västerås, Sweden(Swepub:oru)tll (author)
  • Dobrin, RaduDepartement of Computer Science and Engineering, Mälardalen University, Västerås, Sweden(Swepub:mdh)rdn01 (author)
  • Departement of Computer Science and Engineering, Mälardalen University, Västerås, Sweden (creator_code:org_t)

Related titles

  • In:Architecting Dependable SystemsBerlin, Heidelberg : Springer, s. 110-125978354045177897835404072703540407278

Internet link

Find in a library

To the university's database

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view