End-to-end schedulability tests for multiprocessor embedded systems based on networks-on-chip with priority-preemptive arbitration

Indrusiak, Leandro Soares

doi:10.1016/j.sysarc.2014.05.002

Cited by 65 publications

(73 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Among the list of available approaches, some remarkable work are [17], [18], [19], [20], [35], which collectively deal with the needs of some of the most popular computing paradigms. In [17] the authors considered the multi-core scenario and proposed a parallel synchronous model inspired by the primitives of OpenMPI.…”

Section: Real-time Parallel Computingmentioning

confidence: 99%

“…However, while their work is more focused on a lower level programming model (parallel tasks), our work is focused on a higher-level computation model based on streams. Finally, [35] offers techniques for systemon-chip infrastructures to meet deadlines. The relevant difference with [35] is in the application domain that in [35] seems to be targeted to low-level tasks, while our approach is for stream processing.…”

Section: Real-time Parallel Computingmentioning

confidence: 99%

See 1 more Smart Citation

Patterns for Distributed Real-Time Stream Processing

Val

Fernandez-Garcia

Sánchez-Fernandez

et al. 2017

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-In recent yeais, big data systems have become an active area of research and development. Stream processing is one of the potential application scenarios of big data systems where the goal is to process aconlinoous, high velochyflow of information items. High frequencytradirg (HFT) in stock markets ortrendirgtopicdetection in Twitter are som e examples of stream processing applications. In some cases (like, for instance, in HFT), these applications have end-t�nd qualhy-of-service reqlirements and may benefh from the usage� real-time techniques. Taking this into account, the present articl e analyzes, from the point� view of real-time systems, a set of patterns that can be used when implementing a stream processing application. For each pattern, we discuss its advantages and dsadvanlages, as well as its impact in application performance, measured as response time, maximum ill)Ut frequency and changes in utilization demands due to the pattern.

show abstract

Section: Real-time Parallel Computingmentioning

confidence: 99%

Section: Real-time Parallel Computingmentioning

confidence: 99%

Patterns for Distributed Real-Time Stream Processing

Val

Fernandez-Garcia

Sánchez-Fernandez

et al. 2017

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…Li is derived from priority level of the source node of the communication flow. This model is based on the one described in [14].…”

Section: A Configurationmentioning

confidence: 99%

“…A solution is dominant if there exists any other feasible solution that would decrease some criterion without increasing at least another one [6]. Solutions belonging to the best nondominated sets fill the population slots of the next generation and are used for reproduction, crossover, and mutation to create a new population [14]. The stop criterion is the number of simulated generations that is defined by the designer, which also defines the crossover and mutation rates.…”

Section: ) Solutions Rankingmentioning

confidence: 99%

Deadline, Energy and Buffer-Aware Task Mapping Optimization in NoC-Based SoCs Using Genetic Algorithms

Bruch¹,

Silva²,

Zeferino³

et al. 2017

2017 VII Brazilian Symposium on Computing Systems Engineering (SBESC)

View full text Add to dashboard Cite

Abstract-In Systems-on-Chip (SoCs) based on Networkson-Chip (NoCs), the timing requirements of target applications can be met by using virtual channels and traffic differentiation mechanisms to prioritize the most urgent communication streams. However, the use of virtual channels in NoCs results in silicon and power overheads as they are usually implemented by means of additional buffers and multiplexers. In this context, this paper presents an optimization flow to perform the mapping of applications on NoC-based SoCs, aiming to meet the time requirements and minimize the costs arising from the use of virtual channels. The optimization flow applies a multi-objective heuristic that minimizes the communication deadline miss ratio, the number of virtual channels per router and the static power consumption. The heuristic is based on the NSGA-II genetic algorithm and performs task mapping, priority assignment, and virtual channel configuration. The proposed mapping optimization is evaluated by measuring the inter-task communication latency using a cycle-accurate NoC simulator. The optimization flow is able to identify a series of mappings that represent trade-offs over the metrics of interest, reducing the deadline miss ratio and the costs associated with virtual channels.

show abstract

“…The case study is based on an autonomous vehicle application, which has been utilized in Shi et al (2012), Indrusiak (2014. The application comprises a number of tasks performing different functionalities such as obstacle detection via stereo photogrammetry, navigation control, and stability control.…”

Section: Case Studymentioning

confidence: 99%

Using non-preemptive regions and path modification to improve schedulability of real-time traffic over priority-based NoCs

et al. 2017

View full text Add to dashboard Cite

Network-on-Chip (NoC) is a preferred communication medium for massively parallel platforms. Fixed-priority based scheduling using virtual-channels is one of the promising solutions to support real-time traffic in on-chip networks. Most of the existing works regarding priority-based NoCs use a flit-level preemptive scheduling. Under such a mechanism, preemptions can only happen between the transmissions of successive flits but not during the transmission of a single flit. In this paper, we present a modified framework where the non-preemptive region of each NoC packet increases from a single flit. Using the proposed approach, the response times of certain traffic flows can be reduced, which can thus improve the schedulability of the whole network. As a result, the utilization of NoCs can be improved by admitting more real-time traffic. Schedulability tests regarding the proposed framework are presented along with the proof of the correctness. Additionally, we also propose a path modification approach on top of the non-preemptive region based method to further improve schedulability. A number of experiments have been performed to evaluate the proposed solutions, where we can observe significant improvement on schedulability compared to the original flit-level preemptive NoCs.This work is an extended version of the paper presented at RTCSA 2016 (Liu et al. 2016).

show abstract

End-to-end schedulability tests for multiprocessor embedded systems based on networks-on-chip with priority-preemptive arbitration

Cited by 65 publications

References 23 publications

Patterns for Distributed Real-Time Stream Processing

Patterns for Distributed Real-Time Stream Processing

Deadline, Energy and Buffer-Aware Task Mapping Optimization in NoC-Based SoCs Using Genetic Algorithms

Using non-preemptive regions and path modification to improve schedulability of real-time traffic over priority-based NoCs

Contact Info

Product

Resources

About