A survey of hard real-time scheduling for multiprocessor systems
This survey covers hard real-time scheduling algorithms and schedulability analysis
techniques for homogeneous multiprocessor systems. It reviews the key results in this field …
techniques for homogeneous multiprocessor systems. It reviews the key results in this field …
RT-Xen: Towards real-time hypervisor scheduling in Xen
As system integration becomes an increasingly important challenge for complex real-time
systems, there has been a significant demand for supporting real-time systems in virtualized …
systems, there has been a significant demand for supporting real-time systems in virtualized …
An empirical comparison of global, partitioned, and clustered multiprocessor EDF schedulers
A Bastoni, BB Brandenburg… - 2010 31st IEEE Real …, 2010 - ieeexplore.ieee.org
As multicore platforms become ever larger, overhead-related factors play a greater role in
determining which real-time scheduling algorithms are preferable. In this paper, such factors …
determining which real-time scheduling algorithms are preferable. In this paper, such factors …
React: Enabling real-time container orchestration
Fog and edge computing offer the flexibility and decentralized architecture benefits of cloud
computing without suffering from the latency issues inherent in the cloud. This makes fog …
computing without suffering from the latency issues inherent in the cloud. This makes fog …
Real-time multi-core virtual machine scheduling in xen
Recent years have witnessed two major trends in the development of complex real-time
embedded systems. First, to reduce cost and enhance flexibility, multiple systems are …
embedded systems. First, to reduce cost and enhance flexibility, multiple systems are …
Generalized tardiness bounds for global multiprocessor scheduling
H Leontyev, JH Anderson - Real-Time Systems, 2010 - Springer
We consider the issue of deadline tardiness under global multiprocessor scheduling
algorithms. We present a general tardiness-bound derivation that is applicable to a wide …
algorithms. We present a general tardiness-bound derivation that is applicable to a wide …
[PDF][PDF] Multicore operating-system support for mixed criticality
JH Anderson, SK Baruah… - Proceedings of the …, 2009 - cs.unc.edu
Ongoing research is discussed on the development of operating-system support for
enabling mixed-criticality workloads to be supported on multicore platforms. This work is …
enabling mixed-criticality workloads to be supported on multicore platforms. This work is …
Optimal virtual cluster-based multiprocessor scheduling
Scheduling of constrained deadline sporadic task systems on multiprocessor platforms is an
area which has received much attention in the recent past. It is widely believed that finding …
area which has received much attention in the recent past. It is widely believed that finding …
Reservation-based federated scheduling for parallel real-time tasks
Multicore systems are increasingly utilized in real-time systems in order to address the high
computational demands. To fully exploit the advantages of multicore processing, possible …
computational demands. To fully exploit the advantages of multicore processing, possible …
Collaborative autonomous driving: Vision and challenges
This paper discusses challenges in computer systems research posed by the emerging
autonomous driving systems. We first identify four research areas related to autonomous …
autonomous driving systems. We first identify four research areas related to autonomous …