{"title":"Generation of SystemC Simulation Models from Service Level UML Diagrams","authors":"R. Carvalho, Rebeca Alencar, Adriano Sarmento","doi":"10.1109/SBESC.2018.00025","DOIUrl":"https://doi.org/10.1109/SBESC.2018.00025","url":null,"abstract":"Modeling communication of embedded systems at service level, where most of the communication details are abstracted, is mandatory in the initial phase of design in order to decrease design complexity. For that, service level UML profiles have been adopted in recent years for specifying embedded systems. In order to quick validate early system specifications, designers have to write manually simulation models in system level languages like SystemC or SystemVerilog. The problem of these languages is that they do not abstract communication details such as ports and channels. Moreover, designers must add code to enable different execution modes (parallel or sequential) and to implement different communication modes (synchronous or asynchronous services calls). This work generates automatically SystemC simulation models from UML service level models. The generated simulation model comprises all the communication infrastructure (ports, channels and interconnections) and different communication and execution modes. An object recognition embedded system was designed in order to prove the efficacy of the proposed work. Results show that this work reduced significantly design time by generating most of the code of the simulation model.","PeriodicalId":323489,"journal":{"name":"2018 VIII Brazilian Symposium on Computing Systems Engineering (SBESC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134083092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Framework for Variable Quality in Applications through Context-Aware Approximate Computing","authors":"Roberto Alejandro Hidalgo Castro, L. Wanner","doi":"10.1109/SBESC.2018.00028","DOIUrl":"https://doi.org/10.1109/SBESC.2018.00028","url":null,"abstract":"We introduce a framework that enables applications to dynamically change their quality (and consequently their resource usage) according to contextual information and energy consumption goals. The framework combines a multi-implementation mathematical library with a context monitoring system service and an application adaptation support system. The library features multiple implementations of varying quality and cost for each supported function. The context monitoring system service continuously evaluates system resource usage, and signals applications to adapt their quality (by changing to lower or higher quality implementations) when overall energy usage deviates from a goal set by the user. The support system receives information from the monitoring system, and transparently changes the implementations used by applications. Our experiments demonstrate that the framework can save up to 62% in energy consumption by tolerating at most of 4% degradation in application quality. Experiments furthermore show that the framework can successfully reach desired energy goals by dynamically adjusting application quality.","PeriodicalId":323489,"journal":{"name":"2018 VIII Brazilian Symposium on Computing Systems Engineering (SBESC)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133010640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Carlos Michel Betemps, Mateus Melo, A. Rahmani, A. Miele, N. Dutt, B. Zatt
{"title":"Exploring Heterogeneous Task-Level Parallelism in a BMA Video Coding Application using System-Level Simulation","authors":"Carlos Michel Betemps, Mateus Melo, A. Rahmani, A. Miele, N. Dutt, B. Zatt","doi":"10.1109/SBESC.2018.00020","DOIUrl":"https://doi.org/10.1109/SBESC.2018.00020","url":null,"abstract":"High abstraction level models can be used within the system-level simulation to allow rapid evaluations of architectural aspects in early Design Space Exploration (DSE) and direct the development decisions. Further, early DSE is of paramount importance in the specification of future Embedded Systems (ES) and its evaluation for applications with high computing demands and energy restrictions. This paper presents the exploration of Heterogeneous Task-Level Parallelism (HTLP) in a Block-Matching Algorithm (BMA) video coding application. HTLP means the creation and execution of simultaneous threads of kernels defined for different types of Processing Elements (PE) - e.g., CPU and GPU - but all for an equal purpose. We employ a BMA implementation as a case study, and its characteristics are used to explore the HTLP - in particular, its kernels for data preparation, SAD (sum of absolute differences) criteria calculation, and SAD values grouping. For the exploration, a system-level simulation framework (SAVE-htlp) is augmented, being able to support the HTLP. In the performed experiments, SAVE-htlp simulates workload and architecture models and explores 22 settings varying the PE type employed during the tasks' execution and the number of concurrent threads for each kernel. Execution time, performance, energy, and power results show HTLP settings overcoming CPU-only ones as well as those with solely GPUs to process its tasks.","PeriodicalId":323489,"journal":{"name":"2018 VIII Brazilian Symposium on Computing Systems Engineering (SBESC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122309113","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Javan Ataide De Oliveira Junior, Wesley Klewerton Guez Assunção, D. Jeronymo
{"title":"Multi-objective Tuning of Generalized Predictive Controller: A Trade-Off Between Performance and Robustness","authors":"Javan Ataide De Oliveira Junior, Wesley Klewerton Guez Assunção, D. Jeronymo","doi":"10.1109/SBESC.2018.00034","DOIUrl":"https://doi.org/10.1109/SBESC.2018.00034","url":null,"abstract":"This paper investigates the application of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) to the Generalized Predictive Controller (GPC) parameter tuning. GPC stands out for using predictions of a future system behavior in order to evaluate an optimal control law according to certain performance criteria. GPC deals with multiple conflicting objectives such as minimizing set-point error, reducing variation of control actions and greater robustness. In this work, NSGA-II is applied to the problem of parameter tuning considering the trade-off between performance and robustness. A rule is deduced for choosing an adequate solution in the Pareto front which leads to overall best compromise between performance and robustness criteria. From the results we can observe that NSGA-II reaches satisfactory solutions that allows a better decision-making.","PeriodicalId":323489,"journal":{"name":"2018 VIII Brazilian Symposium on Computing Systems Engineering (SBESC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130416728","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wellington Lacerda Silveira da Silva, M. A. Ramos, R. Macêdo
{"title":"Byzantine Fault Tolerance in the Partitioned Synchronous System Model","authors":"Wellington Lacerda Silveira da Silva, M. A. Ramos, R. Macêdo","doi":"10.1109/SBESC.2018.00024","DOIUrl":"https://doi.org/10.1109/SBESC.2018.00024","url":null,"abstract":"Byzantine fault tolerance was introduced to implement systems capable of tolerating arbitrary component failures, where n − f replicated state machines maintain their state consistent despite the action of up to f arbitrarily or Byzantine faulty state machines, for n ≥ 3f + 1. This notion was extended later for tolerating malicious attacks or intrusions when some of the systems components get compromised by a malicious intruder or attacker. Due to its high costs in terms of minimum needed redundancy (minimum 3f + 1 replicas), and related latency, several authors have turned their attention to alternative approaches where faulty processes can be excluded from the system adapting the current quorum of operational processes. In this paper, we explore the Partitioned Synchronous distributed system model, which suits existing real systems, such as large computational grids and distributed industrial plants, to propose a new Byzantine failure detector and related consensus algorithm for such a model. From our simulations we show that our approach indeed improves resilience when compared to static quorum approaches, with the continuous detection of faulty processes.","PeriodicalId":323489,"journal":{"name":"2018 VIII Brazilian Symposium on Computing Systems Engineering (SBESC)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115509896","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Reliable Integration of Thermal Flow Sensors into Air Data Systems","authors":"F. A. Viana, F. Sill","doi":"10.1109/SBESC.2018.00023","DOIUrl":"https://doi.org/10.1109/SBESC.2018.00023","url":null,"abstract":"Having in mind its impact on the security of air flight applications, there is a high demand for robust and reliable airspeed measurement systems. Thermal flow sensors are a recent proposal in order to circumvent the critical limitations of classic airspeed sensors and have the potential to considerably enhance the security of future aircrafts. This paper is a step towards the application of these sensors and explores how existing state-of-the-art reliability techniques can be applied for this new class of devices. Therefore, a detailed simulation model of a thermal flow sensors is setup in a redundant manner and widely applied voting mechanism are added to the system. Using extensive fault simulations, we explored the applicability of each mechanism for different fault classes and determined the most reliable solution. Results indicate that not the most complex but a more simpler method based on median estimation shows the highest robustness for this new kind of airspeed sensors.","PeriodicalId":323489,"journal":{"name":"2018 VIII Brazilian Symposium on Computing Systems Engineering (SBESC)","volume":"257 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115870611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. L. Marins, T. Cabreira, Kristofer S. Kappel, P. Ferreira
{"title":"A Closed-Form Energy Model for Multi-rotors Based on the Dynamic of the Movement","authors":"J. L. Marins, T. Cabreira, Kristofer S. Kappel, P. Ferreira","doi":"10.1109/SBESC.2018.00047","DOIUrl":"https://doi.org/10.1109/SBESC.2018.00047","url":null,"abstract":"An energy model for a quadcopter based on the dynamic of the movement and on the Physics principles of superposition and energy conservation is proposed here. Its accuracy was checked against another model published recently in the literature, which is based on experiments carried on specifically for that purpose. The model fits the experimental data and can be easily extended for other types of multi-rotors because is a function of quadcopter parameters. More than that, as it is based only on the dynamic of the movement equations, it is differentiable and integrable, and can be applied even to gasoline-powered drone, provide that we know the efficiencies of the combustion motors. It was also studied which simplifications are allowed without compromising its accuracy, for instance, drag effects. The model confirms that there is an optimal velocity for different flight path lengths and allows to calculate that velocity. Finally, the model was used to calculate the energy consumption during a real flight with a good result and it was also applied to obtain accurate results related to energy consumption during turning maneuvers.","PeriodicalId":323489,"journal":{"name":"2018 VIII Brazilian Symposium on Computing Systems Engineering (SBESC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127207378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
F. Ribeiro, A. Rettberg, C. Pereira, Charles Steinmetz, M. S. Soares
{"title":"Non-functional Constraints Annotation to Real-Time Embedded System Design","authors":"F. Ribeiro, A. Rettberg, C. Pereira, Charles Steinmetz, M. S. Soares","doi":"10.1109/SBESC.2018.00041","DOIUrl":"https://doi.org/10.1109/SBESC.2018.00041","url":null,"abstract":"Development of Real-Time Embedded Systems (RTES) is currently a great challenge, as industry has to coherently model, develop and evaluate functional and non-functional requirements of these systems. Several approaches to RTES specification and design have been proposed in past years, but they most often fail to support early timing representation and, also, for advanced evaluation of timing constraints. Furthermore, not all of these approaches describe non-functional constraints in all viewpoints, models and refinements along the system design process. This research aims to identify and model real-time and embedded constraints in system design artifacts and, also, to refine and trace them along of architectural viewpoints. MARTE constraints have been consistently applied in design models and implemented at lower abstraction models. Here, timing constraints generation are performed from the graphical models to the final code models. Additionally, a case study in the automotive domain has been proposed in order to check the imposed timing constraints regarding specification of architectural models.","PeriodicalId":323489,"journal":{"name":"2018 VIII Brazilian Symposium on Computing Systems Engineering (SBESC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130080494","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
G. Künzel, G. Cainelli, M. Feldman, I. Müller, C. Pereira
{"title":"Simulation and Performance Analysis of a Weighted Routing Algorithm for Industrial Wireless Sensor Networks","authors":"G. Künzel, G. Cainelli, M. Feldman, I. Müller, C. Pereira","doi":"10.1109/SBESC.2018.00013","DOIUrl":"https://doi.org/10.1109/SBESC.2018.00013","url":null,"abstract":"Industrial Wireless Sensor Networks such as Wire-lessHART and ISA SP100.11a are attractive for automation and process control applications. In those standards, routing is a relevant aspect that affects network performance. Routing algorithms have been proposed over the last years for the construction of routes and graphs with path redundancy to increase reliability. Those routing algorithms are evaluated with different parameters, scenarios and operating conditions that make difficult to compare them. They also use simulators with protocols that have little similarity to the current standard protocols. This work aims to analyze the performance of an algorithm that uses weights to define routes and compare it with other state-of-the-art algorithms. Using a simulation environment with the complete implementation of the WirelessHART stack, the algorithm was subjected to random topologies representing recurrent IWSNs application scenarios to assess how latency, network lifetime, packet error rate and graph reliability were affected by changes in the weights and also to compare its performance over other algorithms. The results show that, within the scenarios tested, some sets of weights are able to balance parameters such as latency and network lifetime, and that the empirical adjustment of weights may be unsuitable for practical applications, and new approaches must be used to aid in those adjustments.","PeriodicalId":323489,"journal":{"name":"2018 VIII Brazilian Symposium on Computing Systems Engineering (SBESC)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125572741","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"[Title page iii]","authors":"","doi":"10.1109/sbesc.2018.00002","DOIUrl":"https://doi.org/10.1109/sbesc.2018.00002","url":null,"abstract":"","PeriodicalId":323489,"journal":{"name":"2018 VIII Brazilian Symposium on Computing Systems Engineering (SBESC)","volume":"238 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116460009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}