2016
DOI: 10.1016/j.future.2015.10.021
|View full text |Cite
|
Sign up to set email alerts
|

Mixed scheduling with heterogeneous delay constraints in cyber-physical systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(8 citation statements)
references
References 37 publications
0
8
0
Order By: Relevance
“…Decentralization and synchronism makes the algorithm scalable to very large data sets. Shen et al (2016) provide a decentralized mechanism for resource allocation in contention-based multiple-access scenario while providing real-time guarantees among heterogeneous nodes. Through combining distributed scheduling algorithms with the game theory to guarantee the real-time performance, they show that the Game-Theoretic CSMA scheduling approach can improve the performance of delay-guarantees compared with the existing scheduling algorithms.…”
Section: Modelmentioning
confidence: 99%
“…Decentralization and synchronism makes the algorithm scalable to very large data sets. Shen et al (2016) provide a decentralized mechanism for resource allocation in contention-based multiple-access scenario while providing real-time guarantees among heterogeneous nodes. Through combining distributed scheduling algorithms with the game theory to guarantee the real-time performance, they show that the Game-Theoretic CSMA scheduling approach can improve the performance of delay-guarantees compared with the existing scheduling algorithms.…”
Section: Modelmentioning
confidence: 99%
“…In these systems, an arbitrary number of threads can be scheduled depending on the physical attributes of the system. In addition, there are usually frequent restrictions imposed by the application needs, such as QoS, latency or power consumption [25,27].…”
Section: Accepted Manuscriptmentioning
confidence: 99%
“…Main contributions Mixed scheduling [27] Combines distributed scheduling algorithms with the game theory ideas. TAOPN [35] Time-constrained aspect-oriented Petri net to model and scheduling tasks.…”
Section: Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The authors in [14] proposed communication strategies for cooperative tasks in vehicle platooning, providing a good use case for vCPSs. The authors in [15] proposed a non‐cooperative solution, which is also not considered to be a safety event monitoring for a more integrated solution in vCPS applications. Finally, the authors in [16] deal with the optimal communication design in distributed control for CPS application in the smart grid.…”
Section: Introductionmentioning
confidence: 99%