All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Multi-Variant Time Constrained FlexRay Static Segment Scheduling

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00221577" target="_blank" >RIV/68407700:21230/14:00221577 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1109/WFCS.2014.6837576" target="_blank" >http://dx.doi.org/10.1109/WFCS.2014.6837576</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/WFCS.2014.6837576" target="_blank" >10.1109/WFCS.2014.6837576</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Multi-Variant Time Constrained FlexRay Static Segment Scheduling

  • Original language description

    The FlexRay bus is a modern standard used in the automotive industry. It offers deterministic message transmission with zero jitter while using time-triggered scheduling in the static segment. When several vehicle variants (i.e. different models and their versions) share the same signal, the car manufacturers require to schedule such signal at the same time in all vehicle variants. This requirement simplifies the signal traceability and diagnostics in different vehicle variants using the same platform and simplifies reuse of components and tools. In this paper, we propose a first fit based heuristic algorithm which creates the schedules for several vehicle variants at once, while transmitting a given signal at the same time in all the schedules. The scheduling algorithm also takes the time constraints as release dates and deadlines into account. Finally, different algorithm versions are compared on benchmark sets and low computational time demands are validated on large instances.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JC - Computer hardware and software

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP103%2F12%2F1994" target="_blank" >GAP103/12/1994: Adaptive scheduling and Optimization algorithms for distributed Real-time Embeddes Systems</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2014

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the 10th IEEE International Workshop on Factory Communication Systems

  • ISBN

    978-1-4799-3235-1

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    1-8

  • Publisher name

    IEEE

  • Place of publication

    Piscataway

  • Event location

    Toulouse

  • Event date

    May 5, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article