liu.seSök publikationer i DiVA
Ändra sökning
Avgränsa sökresultatet
1 - 3 av 3
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Assmann, Uwe
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, PELAB - Laboratoriet för programmeringsomgivningar.
    Architectural styles for active documents2005Ingår i: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 56, nr 1-2, s. 79-98Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This paper proposes several novel architectural styles for active documents. Active documents are documents that contain not only data, but also servlets, applets, expressions in spreadsheet languages, and other forms of software. To grasp the different forms of architectures, several novel concepts are defined. Invasive document composition is a type-safe form of template expansion and extension, transconsistency is a form of transclusion for architectures, and staged architectures provide a form of staged programming on the architectural level. With these concepts, it is possible to explain the architectures of many document processing applications for Web and office, and we define the architectural styles of wizard-parametrized, script-parametrized, transconsistent, stream-based, and staged active documents. Finally, we give a hypothesis of active document composition: it consists of four elements, namely, explicit architecture, invasiveness, transconsistency, and staging. On the basis of this hypothesis, many applications in Web engineering and document processing get a common background, and can be compared and simplified. © 2004 Elsevier B.V. All rights reserved.

  • 2.
    Boudjadar, Abdeldjalil
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    David, Alexandre
    Aalborg University, Denmark.
    Hyun Kim, Jin
    INRIA IRISA, France.
    Larsen, Kim G.
    Aalborg University, Denmark.
    Mikucionis, Marius
    Aalborg University, Denmark.
    Nyman, Ulrik
    Aalborg University, Denmark.
    Skou, Arne
    Aalborg University, Denmark.
    A reconfigurable framework for compositional schedulability and power analysis of hierarchical scheduling systems with frequency scaling2015Ingår i: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 113, s. 236-260Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This paper presents a compositional framework for the modeling and analysis of hierarchical scheduling systems. We consider both schedulability and energy consumption of individual components, while analyzing a single core setting with a voltage frequency scaling CPU. According to the CPU frequency scaling, each task has a set of different execution times. Thus, the energy consumption of the whole system varies from one execution to another. We analyze each component individually by checking the feasibility of its workload against both the CPU availability and energy consumption constraints of such a component. Our periodic task model considers both static and dynamic priorities together with preemptive and non-preemptive behaviors. The models are realized using different forms of Hybrid Automata, all of which are analyzed using variants of UPPAAL. The CPU frequencies, task behavior and scheduling policies used in each component are some of the reconfigurable parameters of the system. Finally, we demonstrate the applicability and scalability of our framework by analyzing the schedulability and power consumption of an avionics system. (C) 2015 Elsevier B.V. All rights reserved.

  • 3.
    Boudjadar, Abdeldjalil
    et al.
    Computer Science, Aalborg University, Denmark.
    David, Alexandre
    Computer Science, Aalborg University, Denmark.
    Hyun Kim, Jin
    Computer Science, Aalborg University, Denmark.
    Larsen, Kim G.
    Computer Science, Aalborg University, Denmark.
    Mikučionis, Marius
    Computer Science, Aalborg University, Denmark.
    Nyman, Ulrik
    Computer Science, Aalborg University, Denmark.
    Skou, Arne
    Computer Science, Aalborg University, Denmark.
    Statistical and exact schedulability analysis of hierarchical scheduling systems2016Ingår i: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 127, s. 103-130Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This paper contains two contributions: 1) A development methodology involving two techniques to enhance the resource utilization and 2) a new generic multi-core resource model for hierarchical scheduling systems.

    As the first contribution, we propose a two-stage development methodology relying on the adjustment of timing attributes in the detailed models during the design stage. We use a lightweight method (statistical model checking) for design exploration, easily assuring high confidence in the correctness of the models. Once a satisfactory design has been found, it can be proved schedulable using the computation costly method (symbolic model checking). In order to analyze a hierarchical scheduling system compositionally, we introduce the notion of a stochastic supplier modeling the supply of resources from each component to its child components in the hierarchy. We specifically investigate two different techniques to widen the set of provably schedulable systems: 1) a new supplier model; 2) restricting the potential task offsets.

    We also provide a way to estimate the minimum resource supply (budget) that a component is required to provide. In contrast to analytical methods, we prove non-schedulable cases via concrete counterexamples. By having richer and more detailed scheduling models this framework, has the potential to prove the schedulability of more systems.

    As the second contribution, we introduce a generic resource model for multi-core hierarchical scheduling systems, and show how it can be instantiated for classical resource models: Periodic Resource Models (PRM) and Explicit Deadline Periodic (EDP) resource models. The generic multi-core resource model is presented in the context of a compositional model-based approach for schedulability analysis of hierarchical scheduling systems.

    The multi-core framework presented in this paper is an extension of the single-core framework used for the analysis in the rest of the paper.

1 - 3 av 3
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf