Shared-Resource-Centric Limited Preemptive Scheduling: A Comprehensive Study of Suspension-Based Partitioning Approaches

Zheng, Dong; Liu, Cong; Bateni, Soroush; Chen, Kuan-Hsun; Chen, Jian-Jia; Brüggen, Georg von der; Shi, Junjie

doi:10.1109/rtas.2018.00026

Cited by 10 publications

(6 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Deriving the WCRT bounds. To derive the WCRT bounds, the execution behavior of the segments running on the hardware accelerator may be modeled as an equivalent, but "mirrored", self-suspending task (shown in Figure 6), where execution regions runs on the accelerator and suspensions regions correspond to phases running on a processor core [30]. However, an analysis exploiting this modeling approach would require knowing the suspension time (which in this case would occur when the task runs on the cores), as in Equation (2), thus creating a cyclic dependency.…”

Section: Response-time Analysis For Acceleratorsmentioning

confidence: 99%

Optimized Partitioning and Priority Assignment of Real-Time Applications on Heterogeneous Platforms with Hardware Acceleration

Casini,

Pazzaglia,

Biondi

et al. 2022

Preprint

View full text Add to dashboard Cite

Hardware accelerators, such as those based on GPUs and FPGAs, offer an excellent opportunity to efficiently parallelize functionalities. Recently, modern embedded platforms started being equipped with such accelerators, resulting in a compelling choice for emerging, highly computational intensive workloads, like those required by next-generation autonomous driving systems. Alongside the need for computational efficiency, such workloads are commonly characterized by real-time requirements, which need to be satisfied to guarantee the safe and correct behavior of the system. To this end, this paper proposes a holistic framework to help designers partition real-time applications on heterogeneous platforms with hardware accelerators. The proposed model is inspired by a realistic setup of an advanced driving assistance system presented in the WATERS 2019 Challenge by Bosch, further generalized to encompass a broader range of heterogeneous architectures. The resulting analysis is linearized and used to encode an optimization problem that jointly (i) guarantees timing constraints, (ii) finds a suitable task-to-core mapping, (iii) assigns a priority to each task, and (iv) selects which computations to accelerate, seeking for the most convenient trade-off between the smaller worst-case execution time provided by accelerators and synchronization and queuing delays.

show abstract

Section: Response-time Analysis For Acceleratorsmentioning

confidence: 99%

Optimized Partitioning and Priority Assignment of Real-Time Applications on Heterogeneous Platforms with Hardware Acceleration

Casini,

Pazzaglia,

Biondi

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Note that among the three scheduling methods, no single task can run on multiple cores at the same time even though the task may migrate. These tasks may self-suspend [3,6,26] due to shared resource accessing on a multiprocessor platform.…”

Section: Two-type Heterogeneous Multiprocessormentioning

confidence: 99%

sharedCharging

Wang

Zhang

et al. 2019

Proc. ACM Interact. Mob. Wearable Ubiquitous Technol.

View full text Add to dashboard Cite

Our society is witnessing a rapid vehicle electrification process. Even though being environmental-friendly, electric vehicles have not reached their full potentials due to prolonged charging time. Moreover, unbalanced spatiotemporal charging demand/supply along with the uneven number of charging stations between heterogeneous fleets make electric vehicle management more challenging, e.g., surplus charging stations across a city for electric buses but limited charging stations in some regions for electric taxis, which severely limit the charging performance of the whole electric vehicle network in a city. In this paper, we first analyze a large-scale real-world dataset from two heterogeneous electric vehicle fleets in the Chinese city Shenzhen. We investigate their mobility and charging patterns and then verify the practicability and necessity of shared charging. Based on the insights we found, we design a generic real-time shared charging scheduling system called sharedCharging to improve overall charging efficiency for heterogeneous electric vehicle fleets. Our sharedCharging also considers sophisticated real-world constraints, e.g., station spaces, availability of charging points, real-time timetable guarantee, etc. More importantly, we take the electric bus and electric taxi fleets as a concrete example of heterogeneous electric vehicle fleets given their different operating patterns. We implement and evaluate sharedCharging with streaming data from over 13,000 electric taxis and 16,000 electric buses, coupled with the charging station data in the Chinese city Shenzhen, which is the largest public electric vehicle network in the world. The evaluation results demonstrate that the proposed sharedCharging reduces the waiting time by 63.5% and reduces the total charging time by 15% on average for e-taxis.

show abstract

“…From an analytical point of view-i.e., for the purpose of schedulability and blocking analysis-the first two interpretations are equivalent, that is, identical analysis problems must be solved and, ignoring overheads, identical bounds are obtained, regardless of how the protocol is actually implemented. The third approach provides some additional flexibility [189,195] and has recently been exploited to enable modern analyses and heuristics [70,76,114,115,198].…”

Section: Centralized Execution Of Critical Sectionsmentioning

confidence: 99%

“…Over the years, many results pertaining to the task and resource mapping problems as well as related optimization problems have appeared [13,34,70,76,87,88,99,100,101,111,112,115,134,149,152,154,168,180,189,195,198,208]. Particularly well-known is Lakshmanan et al's task-set partitioning heuristic for use with the MPCP [123].…”

Section: Further Research Directionsmentioning

confidence: 99%

“…Alternative heuristics and strategies have been proposed by (among others) Nemati et al [154], Wieder and Brandenburg [208], and Al-bayati et al [13]. Most recently, Dong et al [76] presented a detailed study of several task-and resource-assignment heuristics following a resource-centric schedulability analysis approach [114,115] in the context of a semaphore protocol with centralized critical sections, and Chen et al [70] presented an ILP-based partitioning solution for the same workload and platform model. Techniques for scheduling task graphs with precedence constraints and end-to-end deadlines in distributed systems [189,195] are particularly relevant in the context of the DPCP and its related task and resource mapping problems.…”

Section: Further Research Directionsmentioning

confidence: 99%

See 1 more Smart Citation

Multiprocessor Real-Time Locking Protocols: A Systematic Review

Brandenburg

2019

Preprint

View full text Add to dashboard Cite

We systematically survey the literature on analytically sound multiprocessor real-time locking protocols from 1988 until 2018, covering the following topics:• progress mechanisms that prevent the lock-holder preemption problem (Section 3),• spin-lock protocols (Section 4),• binary semaphore protocols (Sections 5 and 6),• independence-preserving (or fully preemptive) locking protocols (Section 7),• reader-writer and k-exclusion synchronization (Section 8),• support for nested critical sections (Section 9), and • implementation and system-integration aspects (Section 10).A special focus is placed on the suspension-oblivious and suspension-aware analysis approaches for semaphore protocols, their respective notions of priority inversion, optimality criteria, lower bounds on maximum priority-inversion blocking, and matching asymptotically optimal locking protocols.

show abstract

Shared-Resource-Centric Limited Preemptive Scheduling: A Comprehensive Study of Suspension-Based Partitioning Approaches

Cited by 10 publications

References 27 publications

Optimized Partitioning and Priority Assignment of Real-Time Applications on Heterogeneous Platforms with Hardware Acceleration

Optimized Partitioning and Priority Assignment of Real-Time Applications on Heterogeneous Platforms with Hardware Acceleration

sharedCharging

Multiprocessor Real-Time Locking Protocols: A Systematic Review

Contact Info

Product

Resources

About