| 1. |
- Asadi, M., et al.
(författare)
-
Accurate detection of paroxysmal atrial fibrillation with certified-GAN and neural architecture search
- 2023
-
Ingår i: Scientific Reports. - : NLM (Medline). - 2045-2322. ; 13:1
-
Tidskriftsartikel (refereegranskat)abstract
- This paper presents a novel machine learning framework for detecting PxAF, a pathological characteristic of electrocardiogram (ECG) that can lead to fatal conditions such as heart attack. To enhance the learning process, the framework involves a generative adversarial network (GAN) along with a neural architecture search (NAS) in the data preparation and classifier optimization phases. The GAN is innovatively invoked to overcome the class imbalance of the training data by producing the synthetic ECG for PxAF class in a certified manner. The effect of the certified GAN is statistically validated. Instead of using a general-purpose classifier, the NAS automatically designs a highly accurate convolutional neural network architecture customized for the PxAF classification task. Experimental results show that the accuracy of the proposed framework exhibits a high value of 99.0% which not only enhances state-of-the-art by up to 5.1%, but also improves the classification performance of the two widely-accepted baseline methods, ResNet-18, and Auto-Sklearn, by [Formula: see text] and [Formula: see text].
|
|
| 2. |
- Ashjaei, Seyed Mohammad Hossein, 1980-, et al.
(författare)
-
A novel frame preemption model in TSN networks
- 2021
-
Ingår i: Journal of systems architecture. - : Elsevier B.V.. - 1383-7621 .- 1873-6165. ; 116
-
Tidskriftsartikel (refereegranskat)abstract
- This paper identifies a limitation in the frame preemption model in the TSN standard (IEEE 802.1Q-2018), due to which high priority frames can experience significantly long blocking delays, thereby exacerbating their worst-case response times. This limitation can have a considerable impact on the design, analysis and performance of TSN-based systems. To address this limitation, the paper presents a novel and more efficient frame preemption model in the TSN standard that allows over 90% reduction in the maximum blocking delay leading to lower worst-case response times of high priority frames compared to the frame preemption model used in the existing works. The paper also shows that the improvement becomes even more significant in multi-switch TSN networks. In order to evaluate the effects of preemption, the paper performs simulations by enabling and disabling preemptions as well as enabling and disabling the Hold/Release mechanism supported by TSN. Furthermore, the paper performs a comparative evaluation of the two models of frame preemption in TSN using simulations. The evaluation shows that the maximum response times of high priority frames can be significantly reduced with very small impact on the response times of lower priority frames. The paper also shows the improvement in the maximum response times of higher priority frames using an automotive industrial use case that employs a multi-hop TSN network for on-board communication.
|
|
| 3. |
- Berisa, Aldin, et al.
(författare)
-
AVB-aware Routing and Scheduling for Critical Traffic in Time-sensitive Networks with Preemption
- 2022
-
Ingår i: ACM International Conference Proceeding Series. - New York, NY, USA : Association for Computing Machinery. - 9781450396509 ; , s. 207-218
-
Konferensbidrag (refereegranskat)abstract
- The Time-Sensitive Network (TSN) amendments and protocols add capabilities on top of standard 802.1 Ethernet for guaranteeing the timeliness of both (isochronous) scheduled traffic (ST) and shaped (audio-video) communication (AVB) in distributed applications. ST streams are guaranteed via an offline computed schedule controlling the time-aware gate mechanism of IEEE 802.1Qbv, while AVB real-time streams are shaped via a credit-based shaper (CBS) and scheduler with lower-priority than ST. Although the two traffic classes use different TSN mechanisms, they are interrelated as the ST traffic class schedule influences the latency of AVB traffic. In this paper, we propose a method for the integration of the ST schedule synthesis with an analysis for the AVB class featuring IEEE 802.1Qbu frame preemption under different configurations to reduce the interference between the two classes. We first present a new worst-case response-time (WCRT) analysis for the AVB traffic class in TSN networks with preemption, considering an arbitrary number of AVB queues and different configurations for the CBS credit behavior. Then, we integrate the creation of ST schedule tables with the schedulability analysis of AVB traffic using a heuristic algorithm featuring frame preemption and a novel routing mechanism aimed at maximizing AVB schedulability. Finally, we evaluate our approach using both real-world and synthetic use cases showing the efficiency both in terms of schedule creation runtime and in terms of increasing the schedulability of lower-priority AVB traffic.
|
|
| 4. |
- Berisa, Aldin, et al.
(författare)
-
Comparative Evaluation of Various Generations of Controller Area Network Based on Timing Analysis
- 2023
-
Ingår i: IEEE Int. Conf. Emerging Technol. Factory Autom., ETFA. - : Institute of Electrical and Electronics Engineers Inc.. - 9798350339918
-
Konferensbidrag (refereegranskat)abstract
- This paper performs a comparative evaluation of various generations of Controller Area Network (CAN), including the classical CAN, CAN Flexible Data-Rate (FD), and CAN Extra Long (XL). We utilize response-time analysis for the evaluation. In this regard, we identify that the state of the art lacks the response-time analysis for CAN XL. Hence, we discuss the worst-case transmission times calculations for CAN XL frames and incorporate them to the existing analysis for CAN to support response-time analysis of CAN XL frames. Using the extended analysis, we perform a comparative evaluation of the three generations of CAN by analyzing an automotive industrial use case. In crux, we show that using CAN FD is more advantageous than the classical CAN and CAN XL when using frames with payloads of up to 8 bytes, despite the fact that CAN XL supports higher bit rates. For frames with 12-64 bytes payloads, CAN FD performs better than CAN XL when running at the same bit rate, but CAN XL performs better when running at a higher bit rate. Additionally, we discovered that CAN XL performs better than the classical CAN and CAN FD when the frame payload is over 64 bytes, even if it runs at the same or higher bit rates than CAN FD.
|
|
| 5. |
- Berisa, Aldin, et al.
(författare)
-
Investigating and Analyzing CAN-to-TSN Gateway Forwarding Techniques
- 2023
-
Ingår i: Proc. - IEEE Int. Symp. Real-Time Distrib. Comput., ISORC. - : Institute of Electrical and Electronics Engineers Inc.. - 9798350339024 ; , s. 136-145
-
Konferensbidrag (refereegranskat)abstract
- Controller Area Network (CAN) and Ethernet network are expected to co-exist in automotive industry as Ethernet provides a high-bandwidth communication, while CAN is a legacy cost-effective solution. Due to the shortcomings of conventional switched Etherent, such as determinism, IEEE Time Sensitive Networking (TSN) task group developed a set of standards to enhance the switched Ethernet technology providing low-jitter and deterministic communication. Considering these two network domains, we investigate various design approaches for a gateway that connects a CAN domain to a TSN domain. We present three gateway forwarding techniques and we develop end-to-end delay analysis methods for them. Via the analysis methods and applying them to synthetic use cases we show that the intuitive existing approach of encapsulating multiple CAN frames into a single Ethernet frame is not necessarily an efficient solution. In fact, we demonstrate several cases where it is preferable to encapsulate only one CAN frame into a TSN frame, in particular when we use a high speed TSN network. The results have a significant impact on developing such gateways as the implementation of the one-to-one frame encapsulation is considerably simpler than other complex gateway-forwarding techniques.
|
|
| 6. |
- Bucaioni, Alessio, 1987-, et al.
(författare)
-
Alignment of Requirements and Testing in Agile : An Industrial Experience
- 2018
-
Ingår i: Advances in Intelligent Systems and Computing. - Cham : Springer Verlag. - 2194-5357 .- 2194-5365. ; 738, s. 225-232
-
Tidskriftsartikel (refereegranskat)abstract
- Agile development aims at switching the focus from processes to interactions between stakeholders, from heavy to minimalistic documentation, from contract negotiation and detailed plans to customer collaboration and prompt reaction to changes. With these premises, requirements traceability may appear to be an overly exigent activity, with little or no return-of-investment. However, since testing remains crucial even when going agile, the developers need to identify at a glance what to test and how to test it. That is why, even though requirements traceability has historically faced a firm resistance from the agile community, it can provide several benefits when promoting precise alignment of requirements with testing. This paper reports on our experience in promoting traceability of requirements and testing in the data communications for mission-critical systems in an industrial Scrum project. We define a semi-automated requirements tracing mechanism which coordinates four traceability techniques. We evaluate the solution by applying it to an industrial project aiming at enhancing the existing Virtual Router Redundancy Protocol by adding Simple Network Management Protocol support.
|
|
| 7. |
- Bucaioni, Alessio, 1987-, et al.
(författare)
-
From low-level programming to full-fledged industrial model-based development : the story of the Rubus Component Model
- 2023
-
Ingår i: Software and Systems Modeling. - : Springer Science and Business Media Deutschland GmbH. - 1619-1366 .- 1619-1374.
-
Tidskriftsartikel (refereegranskat)abstract
- Developing distributed real-time systems is a complex task that has historically entailed specialized handcraft. In this paper, we propose a retrospective on the (r)evolutionary changes that led to the transition from low-level programming to industrial full-fledged model-based development embodied by the Rubus Component Model and its tool-ecosystem. We focus on the needs, challenges, and solutions of a 15-year-long evolution journey of a software development approach that has gone from low-level and manual programming to a highly automated environment offering modeling, analysis, and development of vehicular software systems with multi-criticality for deployment on single- and multi-core platforms.
|
|
| 8. |
- Bucaioni, Alessio, 1987-, et al.
(författare)
-
On Model-based Development of Embedded Software for Evolving Automotive E/E Architectures
- 2020
-
Ingår i: Advances in Intelligent Systems and Computing, Volume 1134. - Las Vegas, United States : Springer International Publishing. - 9783030430191 ; , s. 693-699
-
Konferensbidrag (refereegranskat)abstract
- Fueled by an increasing demand for computational power and high data-rate low-latency on-board communication, the automotive electrical and electronic architectures are evolving from distributed to consolidated domain and centralised architectures. Future electrical and electronic automotive architectures are envisioned to leverage heterogeneous computing platforms, where several different processing units will be embedded within electronic control units. These powerful control units are expected to be connected by high-bandwidth and low-latency on-board backbone networks. This paper draws on the industrial collaboration with the Swedish automotive industry for tackling the challenges associated to the model-based development of predictable embedded software for contemporary and evolving automotive E/E architectures.
|
|
| 9. |
|
|
| 10. |
- Danielsson, Jakob, et al.
(författare)
-
Automatic Quality of Service Control in Multi-core Systems using Cache Partitioning
- 2021
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we present a last-level cache partitioning controller for multi-core systems. Our objective is to control the Quality of Service (QoS) of applications in multi-core systems by monitoring run-time performance and continuously re-sizing cache partition sizes according to the applications' needs. We discuss two different use-cases; one that promotes application fairness and another one that prioritizes applications according to the system engineers' desired execution behavior. We display the performance drawbacks of maintaining a fair schedule for all system tasks and its performance implications for system applications. We, therefore, implement a second control algorithm that enforces cache partition assignments according to user-defined priorities rather than system fairness. Our experiments reveal that it is possible, with non-instrusive (0.3-0.7\% CPU utilization) cache controlling measures, to increase performance according to setpoints and maintain the QoS for specific applications in an over-saturated system.
|
|
