Freier et al., 2015 - Google Patents

Time-triggered communication scheduling analysis for real-time multicore systems

Freier et al., 2015

Document ID: 8736073591220416437
Author: Freier M; Chen J
Publication year: 2015
Publication venue: 10th IEEE International Symposium on Industrial Embedded Systems (SIES)

External Links

Cited by

Snippet

The demand for more computing power in current real-time systems carries on the development and research on multicore devices. Especially for hard real-time applications, like an engine control system, the software needs to be distributed and scheduled …

Continue reading at ieeexplore.ieee.org (other versions)

238000004458 analytical method 0 title abstract description 18

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
- 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/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
- G06F9/5066—Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs
- 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
- 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/52—Programme synchronisation; Mutual exclusion, e.g. by means of semaphores; Contention for resources among tasks
- 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
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W72/00—Local resource management, e.g. wireless traffic scheduling or selection or allocation of wireless resources
- H04W72/12—Dynamic Wireless traffic scheduling; Dynamically scheduled allocation on shared channel
- H04W72/1205—Schedule definition, set-up or creation
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models

Similar Documents

Publication	Publication Date	Title
Gutiérrez et al.	1997	On the schedulability analysis for distributed hard real-time systems
Zhang et al.	2014	Task-and network-level schedule co-synthesis of Ethernet-based time-triggered systems
Indrusiak	2014	End-to-end schedulability tests for multiprocessor embedded systems based on networks-on-chip with priority-preemptive arbitration
Harbour et al.	2013	Modeling distributed real-time systems with MAST 2
Harbour et al.	2003	Response time analysis for tasks scheduled under EDF within fixed priorities
Easwaran et al.	2009	A compositional scheduling framework for digital avionics systems
Palencia et al.	2016	Response-time analysis in hierarchically-scheduled time-partitioned distributed systems
US20160246646A1 (en)	2016-08-25	Method for executing tasks in a computer network
Yang et al.	2016	Application mapping and scheduling for network-on-chip-based multiprocessor system-on-chip with fine-grain communication optimization
Sciangula et al.	2023	Bounding the data-delivery latency of DDS messages in real-time applications
Rivas et al.	2014	Deadline assignment in EDF schedulers for real-time distributed systems
Kashif et al.	2014	SLA: A stage-level latency analysisfor real-time communicationin a pipelined resource model
Choi et al.	2021	Toward practical weakly hard real-time systems: A job-class-level scheduling approach
Skalistis et al.	2017	Near-optimal deployment of dataflow applications on many-core platforms with real-time guarantees
Yang et al.	2020	DPCP-p: A distributed locking protocol for parallel real-time tasks
Freier et al.	2015	Time-triggered communication scheduling analysis for real-time multicore systems
Nikolić et al.	2014	Worst-case communication delay analysis for many-cores using a limited migrative model
Bui et al.	2011	Real-time scheduling of concurrent transactions in multidomain ring buses
Abuteir et al.	2015	Scheduling of rate-constrained and time-triggered traffic in multi-cluster TTEthernet systems
Murshed et al.	2015	Scheduling and allocation of time-triggered and event-triggered services for multi-core processors with networks-on-a-chip
Chen et al.	2023	Dag-order: An order-based dynamic dag scheduling for real-time networks-on-chip
Benchehida et al.	2020	Task and communication allocation for real-time tasks to networks-on-chip multiprocessors
Wang et al.	2023	Resource Virtualization with End-to-End Timing Guarantees for Multi-Hop Multi-Channel Real-Time Wireless Networks
Rivas et al.	2010	Optimized Deadline Assignment and Schedulability Analysis for Distributed Real-Time Systems with Local EDF Scheduling.
Pop et al.	2004	Schedulability-driven partitioning and mapping for multi-cluster real-time systems