Partitioned scheduling for real-time tasks on multiprocessor embedded systems with programmable shared srams

Chang, Che‐Wei; Chen, Jian-Jia; Munawar, Waqaas; Kuo, Tei-Wei; Falk, Heiko

doi:10.1145/2380356.2380384

Cited by 5 publications

(4 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 2012, Chang et al [22] considered the problem of mapping tasks to identical multiprocessors with heterogeneous shared memory of two types: a fast scratchpad-like memory, and a slow DRAM like memory. The authors propose a two step method.…”

Section: Bin-packingmentioning

confidence: 99%

A Survey of Timing Verification Techniques for Multi-Core Real-Time Systems

et al. 2019

View full text Add to dashboard Cite

This survey provides an overview of the scientific literature on timing verification techniques for multi-core real-time systems. It reviews the key results in the field from its origins around 2006 to the latest research published up to the end of 2018. The survey highlights the key issues involved in providing guarantees of timing correctness for multi-core systems. A detailed review is provided covering four main categories: full integration, temporal isolation, integrating interference effects into schedulability analysis, and mapping and allocation. The survey concludes with a discussion of the advantages and disadvantages of these different approaches, identifying open issues, key challenges, and possible directions for future research.

show abstract

Section: Bin-packingmentioning

confidence: 99%

A Survey of Timing Verification Techniques for Multi-Core Real-Time Systems

et al. 2019

View full text Add to dashboard Cite

show abstract

“…Although they considered a multicore system, in contrast to our scheme, they assume that SPM space is not shared among the cores and task mapping is known priori. With respect to the waiting time for accessing shared bus, Chattopadhyay and Roychoudhury [2011] proposed a bus delay aware iterative SPM allocation scheme to reduce the WCRT of an application running on a multicore processor with a virtually shared SPM (VS-SPM) . However, like Suhendra et al [2010], they assume that task mapping to cores is known a priori.…”

Section: Related Workmentioning

confidence: 99%

Dynamic Shared SPM Reuse for Real-Time Multicore Embedded Systems

Kafshdooz

Ejlali

2015

ACM Trans. Archit. Code Optim.

View full text Add to dashboard Cite

Allocating the scratchpad memory (SPM) space to tasks is a challenging problem in real-time multicore embedded systems that use shared SPM. Proper SPM space allocation is important, as it considerably influences the application worst-case execution time (WCET), which is of great importance in real-time applications. To address this problem, in this article we present a dynamic SPM reuse scheme, where SPM space can be reused by other tasks during runtime without requiring any static SPM partitioning. Although the proposed scheme is applied dynamically at runtime, the required decision making is fairly complex and hence cannot be performed at runtime. We have developed techniques to perform the decision making offline at design time in the form of optimization problems combined with task scheduling/mapping. The proposed work is unlike previous works that either exploit static schemes for SPM space allocation or perform task scheduling/mapping and SPM space allocation incoherently. The experimental results show that our dynamic SPM reuse scheme can reduce WCET by up to 55% as compared to recent previous works on SPM allocation in real-time multicore embedded systems.

show abstract

“…, m i , for the first i tasks such that • the total utilization for the first i tasks is equal to u and • the total approximate demand function for the allocation at time t for the first i tasks is equal to δ · D i . H(1, δ, u) is the same as G (1, δ, u) presented in (4). Now, the value H(i, δ, u) for 2 ≤ i ≤ N can be obtained by the following recursive function:…”

Section: Task Set Synthesis For Edfmentioning

confidence: 99%

“…For a given SPM size, the WCET C Compiler [10] based on the static WCET analyzer aiT [1] or the WCET centric data allocation [7,24] can be adopted to minimize the worst-case execution time of a program (task). When considering multi-tasking in real-time systems, it is also essential to decide how the SPM is shared among the real-time tasks in uniprocessor systems [13,14] and in multiprocessor systems [4,25]. However, the above heuristics [13,14] for uniprocessor systems do not provide fundamental results about the worstcase quality of the resulting schedule.…”

Section: Introductionmentioning

confidence: 99%

Task Set Synthesis with Cost Minimization for Sporadic Real-Time Tasks

Chen

2013

2013 IEEE 34th Real-Time Systems Symposium

Self Cite

View full text Add to dashboard Cite

By allowing users to specify multiple execution versions of a task with different amounts of worst-case execution time and costs, this paper explores how to minimize of the overall system cost under the timing constraints for sporadic real-time tasks. One specific application is to minimize the requirement scratchpad memory size (system cost) to meet the timing constraint, while the worst-case execution time of a task depends on its allocated scratchpad memory size. This paper shows that the problem is N P-hard for approximation, if speed augmentation is not allowed. The algorithms proposed in this paper are analyzed based on (α, β)-approximation, in which a β speed augmentation factor is allowed and the system cost is at most α times of the optimal solution. For tasks with constrained deadlines, an efficient (1, 2 1−η )-approximation algorithm based on dynamic programming is proposed for deadline-monotonic (DM) scheduling, where 0 < η < 1 is a user-defined parameter for the rounding precision in dynamic programming. This is further extended to a (1, 1.6322 1−η )-approximation algorithm for earliest-deadline-first (EDF) scheduling. A polynomialtime (1 + , 1 + η)-approximation scheme is also developed for EDF scheduling by considering 0 < , 0 < η < 1 when the ratio of the maximum relative deadline to the minimum relative deadline of tasks is a constant. This paper is concluded by considering the dual problem to maximize of the system profit by selecting execution versions with different amounts of worst-case execution time.

show abstract

Partitioned scheduling for real-time tasks on multiprocessor embedded systems with programmable shared srams

Cited by 5 publications

References 15 publications

A Survey of Timing Verification Techniques for Multi-Core Real-Time Systems

A Survey of Timing Verification Techniques for Multi-Core Real-Time Systems

Dynamic Shared SPM Reuse for Real-Time Multicore Embedded Systems

Task Set Synthesis with Cost Minimization for Sporadic Real-Time Tasks

Contact Info

Product

Resources

About