[go: up one dir, main page]

Obermaisser, 2007 - Google Patents

End-to-end delays of event-triggered overlay networks in a time-triggered architecture

Obermaisser, 2007

View PDF
Document ID
3255198650298878020
Author
Obermaisser R
Publication year
Publication venue
2007 5th IEEE International Conference on Industrial Informatics

External Links

Snippet

Event-triggered overlay networks are a solution for extending time-triggered networks with support for additional event-triggered communication activities. In addition to time-triggered message transmissions, applications can request the dissemination of messages at points in …
Continue reading at citeseerx.ist.psu.edu (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G06F9/48—Programme initiating; Programme switching, e.g. by interrupt
    • G06F9/4806—Task transfer initiation or dispatching
    • G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
    • G06F9/4887—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues involving deadlines, e.g. rate based, periodic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • H04L12/56—Packet switching systems
    • H04L12/5693—Queue scheduling in packet switching networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G06F9/54—Interprogramme communication; Intertask communication
    • G06F9/546—Message passing systems or structures, e.g. queues
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. local area networks [LAN], wide area networks [WAN]
    • H04L12/40—Bus networks
    • H04L2012/40208—Bus networks characterized by the use of a particular bus standard
    • H04L2012/40215—Controller Area Network CAN
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/10—Flow control or congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/32—Network-specific arrangements or communication protocols supporting networked applications for scheduling or organising the servicing of application requests, e.g. requests for application data transmissions involving the analysis and optimisation of the required network resources
    • H04L67/322—Network-specific arrangements or communication protocols supporting networked applications for scheduling or organising the servicing of application requests, e.g. requests for application data transmissions involving the analysis and optimisation of the required network resources whereby quality of service [QoS] or priority requirements are taken into account
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • G06F13/14—Handling requests for interconnection or transfer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/50—Queue scheduling
    • H04L47/56—Delay aware scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L29/00—Arrangements, apparatus, circuits or systems, not covered by a single one of groups H04L1/00 - H04L27/00 contains provisionally no documents
    • H04L29/02—Communication control; Communication processing contains provisionally no documents
    • H04L29/06—Communication control; Communication processing contains provisionally no documents characterised by a protocol
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Application independent communication protocol aspects or techniques in packet data networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements

Similar Documents

Publication Publication Date Title
US9882667B2 (en) Interface device and method for exchanging user data
Davis et al. Controller area network (can) schedulability analysis with fifo queues
US6490611B1 (en) User level scheduling of inter-communicating real-time tasks
Zheng et al. Definition of task allocation and priority assignment in hard real-time distributed systems
US6205150B1 (en) Method of scheduling higher and lower priority data packets
Livani et al. Scheduling hard and soft real-time communication in a controller area network
CN114424507A (en) Method for transmitting data packets and device for carrying out said method
Schmidt Robust priority assignments for extending existing controller area network applications
Gutiérrez et al. Response time analysis in AFDX networks with sub-virtual links and prioritized switches
García et al. Minimizing the effects of jitter in distributed hard real-time systems
Cena et al. On the properties of the flexible time division multiple access technique
Frühwirth et al. TTEthernet SW-based end system for AUTOSAR
Obermaisser End-to-end delays of event-triggered overlay networks in a time-triggered architecture
Kaiser et al. COSMIC: A real-time event-based middleware for the CAN-bus
Mundhenk et al. Policy-based message scheduling using FlexRay
Hua et al. HOSA: Holistic scheduling and analysis for scalable fault-tolerant FlexRay design
Nolte et al. Server-based scheduling of the CAN bus
Chokshi et al. Performance analysis of FlexRay-based systems using real-time calculus, revisited
Heilmann et al. Mode-changes in COTS time-triggered network hardware without online reconfiguration
Hasnaoui et al. An implementation of a proposed modification of CAN protocol on CAN fieldbus controller component for supporting a dynamic priority policy
Pedreiras Supporting flexible real-time communication on distributed systems
Marques et al. Efficient transient error recovery in FlexRay using the dynamic segment
Pop et al. Schedulability-driven frame packing for multi-cluster distributed embedded systems
Zhao Reliable In-Vehicle FlexRay Network Scheduler Design
Brăescu et al. OSEK-based gateway algorithm for multi-domain CAN systems