A recursive approach to end-to-end path latency computation in heterogeneous multiprocessor systems

Schliecker, Simon; Ernst, Rolf

doi:10.1145/1629435.1629494

Cited by 35 publications

(17 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The analysis is completed successfully if all event streams converge towards a fixed-point through an iterative process. An end-to-end latency analysis based on the SymTA/S approach has been studied in [12]. A related approach that integrates dataflow MoCs in the SymTA/S flow has also been presented in [13].…”

Section: Related Workmentioning

confidence: 99%

“…Even within a static mode, streaming applications require a task graph that supports cyclic-dependencies, multi-input tasks, multi-rate tasks and a natural way of handling backpressured buffer communication. The above approaches [8], [12], [13], [16], [18] support only single-rate tasks. Conversion from multi-rate to single-rate (HSDF) graphs is possible [21].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

End-to-End Latency Analysis of Dataflow Scenarios Mapped Onto Shared Heterogeneous Resources

Siyoum

Geilen

Corporaal

2016

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

End-to-End Latency Analysis of Dataflow Scenarios Mapped Onto Shared Heterogeneous Resources

Siyoum

Geilen

Corporaal

2016

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

View full text Add to dashboard Cite

“…18 can be an overestimation for bursty event streams, as the last event will most likely not observe the worstcase response time at every hop as it is delayed by previous events of the stream. With our analysis being performed at flit level, every packet generates a burst of flits, so the solution proposed in [26] would be a useful extension to our approach. …”

Section: Latencymentioning

confidence: 99%

Real-time communication analysis for networks with two-stage arbitration

Diemer

Rox

Negrean

et al. 2011

Proceedings of the Ninth ACM International Conference on Embedded Software

Self Cite

View full text Add to dashboard Cite

Current on-chip and macro networks use multi-stage arbitration schemes which independently assign different resources such as crossbar inputs and outputs to individual traffic streams. To use these networks in real-time systems, their worst-case behavior must be proved analytically in order to ensure the required timing guarantees. Current analysis approaches, however, do not capture the multi-stage arbitration accurately. In this paper, we propose an analysis that maps the multi-stage arbitration to a schedulability analysis of multiprocessors with shared resources. This allows the exploitation of knowledge about the worst-case behavior of the individual traffic streams, which is required to provide nonsymmetric guarantees. Using this scheduling analysis approach, a detailed analysis solution for a common multi-stage arbitration scheme (iSLIP) is presented. Finally, we evaluate the proposed approach experimentally and compare it to previous work.

show abstract

“…Using these functions, Compositional Performance Analysis derives bounds on the individual response time of each task in the system also under the assumption of communicating tasks. The response times are aggregated to compute bounds on path latencies [25].…”

Section: System Modelmentioning

confidence: 99%

A Lazy Algorithm for Distributed Priority Assignment in Real-Time Systems

Neukirchner

Stein

Ernst

2011

2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops

Self Cite

View full text Add to dashboard Cite

Integration of system components is a crucial challenge in the design of embedded real-time systems, as complex non-functional interdependencies may exist.[20] presented a framework, enabling autonomous verification of timing properties in the system itself. The work presented in this paper, takes that approach one step further, enabling autonomuous assignment of execution priorities under timing constraints. We present a distributed heuristic algorithm for the constraint statisfaction problem (CSP) of finding feasible priority assignments in static priority preemptive (SPP) scheduled hard real-time systems. The proposed heuristic considers end-to-end path latency constraints in arbitrary task graphs mapped on arbitrary platform graphs.

show abstract

A recursive approach to end-to-end path latency computation in heterogeneous multiprocessor systems

Cited by 35 publications

References 21 publications

End-to-End Latency Analysis of Dataflow Scenarios Mapped Onto Shared Heterogeneous Resources

End-to-End Latency Analysis of Dataflow Scenarios Mapped Onto Shared Heterogeneous Resources

Real-time communication analysis for networks with two-stage arbitration

A Lazy Algorithm for Distributed Priority Assignment in Real-Time Systems

Contact Info

Product

Resources

About