Dataflow models for shared memory access latency analysis

Staschulat, Jan; Bekooij, Marco

doi:10.1145/1629335.1629372

Cited by 13 publications

(9 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An extensive body of literature exists on throughput analysis of SDFs; here we mention a few that are relevant to this research. The modeling of schedulers by Wiggers et al [2007] and Staschulat and Bekooij [2009] can be used to represent precise arbitrated communication channels, and resource trade-offs are evaluated by Moreira et al [2005] and Stuijk et al [2006].…”

Section: Related Workmentioning

confidence: 99%

Flexible filters in stream programs

Collins

Carloni

2013

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

The stream-processing model is a natural fit for multicore systems because it exposes the inherent locality and concurrency of a program and highlights its separable tasks for efficient parallel implementations. We present flexible filters, a load-balancing optimization technique for stream programs. Flexible filters utilize the programmability of the cores in order to improve the data-processing throughput of individual bottleneck tasks by "borrowing" resources from neighbors in the stream. Our technique is distributed and scalable because all runtime load-balancing decisions are based on point-to-point handshake signals exchanged between neighboring cores. Load balancing with flexible filters increases the system-level processing throughput of stream applications, particularly those with large dynamic variations in the computational load of their tasks. We empirically evaluate flexible filters in a homogeneous multicore environment over a suite of five real-word stream programs.

show abstract

Section: Related Workmentioning

confidence: 99%

Flexible filters in stream programs

Collins

Carloni

2013

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

show abstract

“…Dataflow modeling of arbitration is not trivial, as equivalence in temporal behavior with the service guarantees of the arbiters should be proved using rigorous algebraic steps [26]- [29]. In this section, we present a dataflow model for CCSP arbitration, based on the bi-rate service guarantee previously derived in Section IV.…”

Section: Definition 8 (Boundary Cycle)mentioning

confidence: 99%

“…However, the basis of this dataflow model is the current linear LR service guarantee, and hence suffers from the associated over-allocation problem for priority-based arbiters. In [29], a three-actor dataflow model is presented for the PBS arbiter. However, this model only targets shared memory access and the latency improvement applies only to the single high-priority requestor.…”

Section: Introductionmentioning

confidence: 99%

Resource-Efficient Real-Time Scheduling Using Credit-Controlled Static-Priority Arbitration

Siyoum

Åkesson

Stuijk

et al. 2011

2011 IEEE 17th International Conference on Embedded and Real-Time Computing Systems and Applications

View full text Add to dashboard Cite

Abstract-A present-day System-on-Chip (SoC) runs a wide range of applications with diverse real-time requirements. Resources, such as processors, interconnects and memories, are shared between these applications to reduce cost. Resource sharing causes temporal interference, which must be bounded by a suitable resource arbiter. System-level analysis techniques use the service guarantee of the arbiter to ensure that realtime requirements of these applications are satisfied. A service guarantee that underestimates the minimum service provided by an arbiter results in more allocation of resources than needed to satisfy latency and throughput requirements. For instance, a linear service guarantee cannot accurately capture bursty service provision by many priority-based schedulers, such as Credit-Controlled Static Priority (CCSP) and Priority-Budget Scheduling (PBS). As a result, the timing analysis of these arbiters becomes too pessimistic. This leads to unnecessary cost penalties since some SoC resources, such as SDRAM bandwidth, are scarce and expensive.

show abstract

“…However, as mentioned in [7], it cannot be determined during static analysis whether a bus request will occur during one the granted slots. Then the TDMA policy might not provide the predictability required for WCET computation.…”

Section: B Wcet-aware Schedulingmentioning

confidence: 99%

“…Budget schedulers ( [7], [8]) have also been designed to satisfy variable bus bandwidth requirements. However, instead of determining a static bus scheduling like TDMA schemes, they grant a given amount of bandwidth to each core.…”

Section: B Wcet-aware Schedulingmentioning

confidence: 99%

MBBA: A Multi-Bandwidth Bus Arbiter for Hard Real-Time

Bourgade¹,

Rochange²,

Michiel³

et al. 2010

2010 5th International Conference on Embedded and Multimedia Computing

View full text Add to dashboard Cite

Multi-core architectures are being increasingly used in embedded systems as they offer several advantages: improved hardware integration, low thermal dissipation and reduced energy consumption, while they make it possible to improve the computing power. In order to run real-time software on a multicore architecture, computing the Worst-Case Execution Time of every thread should be achievable. This notably involves bounding memory latencies by employing a predictable bus arbiter. However, state-of-the-art techniques prove to be irrelevant to schedule unbalanced workloads in which some threads require more bus bandwidth than the other ones. This paper proposes a new bus arbitration scheme that ensures that the shared bus latencies can be upper bounded. Compared to other schemes that make the bus latencies predictable, like the Round-Robin protocol, our approach defines several levels of bandwidth to meet requirements that may vary from one thread to another. Experimental results (WCET estimates) show that the worstcase bus latency is noticeably shortened, compared to RoundRobin, for the cores with highest priority that get the largest bandwidth. The relevance of the scheme is shown through an example workload composed of various benchmarks.

show abstract

Dataflow models for shared memory access latency analysis

Cited by 13 publications

References 17 publications

Flexible filters in stream programs

Flexible filters in stream programs

Resource-Efficient Real-Time Scheduling Using Credit-Controlled Static-Priority Arbitration

MBBA: A Multi-Bandwidth Bus Arbiter for Hard Real-Time

Contact Info

Product

Resources

About