Pub Date : 2017-10-18DOI: 10.1109/DISTRA.2017.8167661
Jalil Boudjadar
Nowadays, multicore platforms are being widely used for the deployment of embedded systems due to their potential in terms of processing capacity. However, the resulting interleaving and memory interference make real-time guarantees of safety critical systems hard to be delivered. Beside to safety requirements, energy consumption represents a strong constraint for the deployment of such systems as they operate on energy-limited sources. Dynamic Voltage and Frequency Scaling (DVFS) was introduced as a technology to reduce the energy consumption of systems by tuning the frequency of processing cores according to the workload. One way of improving schedulability could be by running all cores with maximum frequency. Nevertheless, it has been proved in the literature that this solution is not optimal because it drains the battery energy and leads to eternal bottleneck as the number of memory requests increases linearly with the cores frequency. In this paper, we introduce a framework for fine grained specification and formal analysis of the schedulability and performance of DVFS-multicore systems having a hierarchy of shared memories. We design a collaborative scheduling algorithm to reduce the energy consumption and improve cores utilization. Our collaborative scheduling technique drives the scheduling of a core according to the adopted policy and the resulting memory interference. To that end, our framework provides the ability to run other ready tasks, when the current running tasks fall in a dense memory interference queue, rather than stalling on the memory interference.
{"title":"An efficient energy-driven scheduling of DVFS-multicore systems with a hierarchy of shared memories","authors":"Jalil Boudjadar","doi":"10.1109/DISTRA.2017.8167661","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167661","url":null,"abstract":"Nowadays, multicore platforms are being widely used for the deployment of embedded systems due to their potential in terms of processing capacity. However, the resulting interleaving and memory interference make real-time guarantees of safety critical systems hard to be delivered. Beside to safety requirements, energy consumption represents a strong constraint for the deployment of such systems as they operate on energy-limited sources. Dynamic Voltage and Frequency Scaling (DVFS) was introduced as a technology to reduce the energy consumption of systems by tuning the frequency of processing cores according to the workload. One way of improving schedulability could be by running all cores with maximum frequency. Nevertheless, it has been proved in the literature that this solution is not optimal because it drains the battery energy and leads to eternal bottleneck as the number of memory requests increases linearly with the cores frequency. In this paper, we introduce a framework for fine grained specification and formal analysis of the schedulability and performance of DVFS-multicore systems having a hierarchy of shared memories. We design a collaborative scheduling algorithm to reduce the energy consumption and improve cores utilization. Our collaborative scheduling technique drives the scheduling of a core according to the adopted policy and the resulting memory interference. To that end, our framework provides the ability to run other ready tasks, when the current running tasks fall in a dense memory interference queue, rather than stalling on the memory interference.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123672845","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}
Pub Date : 2017-10-18DOI: 10.1109/DISTRA.2017.8167667
H. Deschamps, G. Cappello, J. Cardoso, P. Siron
This paper presents ongoing work on the formalism of Cyber-Physical Systems (CPS) simulations. These systems are distributed real-time systems, and their simulations might be distributed or not. In this paper, we propose a model to describe the modular components forming a simulation of a CPS. The main goal is to introduce a model of generic simulation distributed architecture, on which we are able to execute a logical architecture of simulation. This architecture of simulation allows the expression of structural and behavioural constraints on the simulation, abstracting its execution. We will propose two implementations of the execution architecture based on generic architectures of distributed simulation: The High Level Architecture (HLA), an IEEE standard for distributed simulation, and one of its open-source implementation of RunTime Infrastructure (RTI): CERTI. The Distributed Simulation Scheduler (DSS), an Airbus framework scheduling predefined models. Finally, we present the initial results obtained applying our formalism to the open-source case study from the ROSACE case study.
{"title":"Toward a formalism to study the scheduling of cyber-physical systems simulations","authors":"H. Deschamps, G. Cappello, J. Cardoso, P. Siron","doi":"10.1109/DISTRA.2017.8167667","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167667","url":null,"abstract":"This paper presents ongoing work on the formalism of Cyber-Physical Systems (CPS) simulations. These systems are distributed real-time systems, and their simulations might be distributed or not. In this paper, we propose a model to describe the modular components forming a simulation of a CPS. The main goal is to introduce a model of generic simulation distributed architecture, on which we are able to execute a logical architecture of simulation. This architecture of simulation allows the expression of structural and behavioural constraints on the simulation, abstracting its execution. We will propose two implementations of the execution architecture based on generic architectures of distributed simulation: The High Level Architecture (HLA), an IEEE standard for distributed simulation, and one of its open-source implementation of RunTime Infrastructure (RTI): CERTI. The Distributed Simulation Scheduler (DSS), an Airbus framework scheduling predefined models. Finally, we present the initial results obtained applying our formalism to the open-source case study from the ROSACE case study.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126441262","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}
Pub Date : 2017-10-18DOI: 10.1109/DISTRA.2017.8167665
Rolf Egert, Carlos Garcia Cordero, A. Tundis, M. Mühlhäuser
The process of designing and evaluating distributed Cyber-Physical Systems (CPSs) is not a trivial task. There are many challenges to tackle such as managing distributed resources, enabling communication between components, and choosing performance metrics to evaluate the “goodness” of the system. Smart Grids (SGs) are prominent representatives of CPSs, a particular type of Critical Infrastructure (CI), whose organizational model is becoming more distributed and dynamic. Due to this paradigm shift, new control and management mechanisms need to be identified and tested to guarantee uninterrupted operation. However, novel approaches cannot always be tested against real networks as the economic cost and risk can be high. In contrast, modeling and simulation techniques are viable evaluation mechanisms that support the continuous evolution of CIs. In this paper, we present an Open Source time-discrete simulation software, called HOLEG, that models and evaluates SGs. The software is based on the Holon analogy, a bio-inspired approach that enables systems resilience through flexible reconfiguration mechanisms. The presented software provides features that enable the integration and execution of optimization algorithms along with their evaluation. To demonstrate HOLEG, a case study is presented where a heuristic algorithm is implemented to minimize wasted energy while preventing network destabilization.
{"title":"HOLEG: A simulator for evaluating resilient energy networks based on the Holon analogy","authors":"Rolf Egert, Carlos Garcia Cordero, A. Tundis, M. Mühlhäuser","doi":"10.1109/DISTRA.2017.8167665","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167665","url":null,"abstract":"The process of designing and evaluating distributed Cyber-Physical Systems (CPSs) is not a trivial task. There are many challenges to tackle such as managing distributed resources, enabling communication between components, and choosing performance metrics to evaluate the “goodness” of the system. Smart Grids (SGs) are prominent representatives of CPSs, a particular type of Critical Infrastructure (CI), whose organizational model is becoming more distributed and dynamic. Due to this paradigm shift, new control and management mechanisms need to be identified and tested to guarantee uninterrupted operation. However, novel approaches cannot always be tested against real networks as the economic cost and risk can be high. In contrast, modeling and simulation techniques are viable evaluation mechanisms that support the continuous evolution of CIs. In this paper, we present an Open Source time-discrete simulation software, called HOLEG, that models and evaluates SGs. The software is based on the Holon analogy, a bio-inspired approach that enables systems resilience through flexible reconfiguration mechanisms. The presented software provides features that enable the integration and execution of optimization algorithms along with their evaluation. To demonstrate HOLEG, a case study is presented where a heuristic algorithm is implemented to minimize wasted energy while preventing network destabilization.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116484046","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}
Pub Date : 2017-10-18DOI: 10.1109/DISTRA.2017.8167668
Paolo Bocciarelli, A. D’Ambrogio, Emiliano Paglia, Andrea Giglio
Inter-organization business process collaboration is one of the most significant factors driving today's global business development. Such collaborations are typically composed by various processes executed by different organizations and are often difficult to specify and analyze, due to their distributed nature and to data interoperability issues. The standard notation for business process modeling, namely BPMN (Business Process Model and Notation), only provides a limited support to the specification of collaborations. This paper introduces a data model extension of BPMN inspired by the HLA (High Level Architecture) distributed simulation standard. In addition, the paper proposes a metamodel-based mapping from BPMN to HLA, which can be seen as a significant step towards the implementation of a conceptual framework for specifying and analyzing collaborative business processes by use of distributed simulation approaches.
{"title":"An HLA-based BPMN extension for the specification of business process collaborations","authors":"Paolo Bocciarelli, A. D’Ambrogio, Emiliano Paglia, Andrea Giglio","doi":"10.1109/DISTRA.2017.8167668","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167668","url":null,"abstract":"Inter-organization business process collaboration is one of the most significant factors driving today's global business development. Such collaborations are typically composed by various processes executed by different organizations and are often difficult to specify and analyze, due to their distributed nature and to data interoperability issues. The standard notation for business process modeling, namely BPMN (Business Process Model and Notation), only provides a limited support to the specification of collaborations. This paper introduces a data model extension of BPMN inspired by the HLA (High Level Architecture) distributed simulation standard. In addition, the paper proposes a metamodel-based mapping from BPMN to HLA, which can be seen as a significant step towards the implementation of a conceptual framework for specifying and analyzing collaborative business processes by use of distributed simulation approaches.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126967921","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}
Pub Date : 2017-10-18DOI: 10.1109/DISTRA.2017.8167684
L. Nigro, P. F. Sciammarella
This paper proposes an approach to modelling and analysis of distributed real-time actor systems, which is based on the Uppaal statistical model checker (SMC). SMC was chosen because it automatizes simulations, offers a temporal logic language to formalize specifications and exploits statistical techniques to infer quantitative measures about a model. The approach is integrated in a system life-cycle where a same model can be transitioned without distortions from analysis down to design and implementation, currently based on Java. The paper describes the adopted actor modelling language and its architectural framework, illustrates the Uppaal SMC approach and demonstrates its practical usefulness through a running example.
{"title":"Statistical model checking of distributed real-time actor systems","authors":"L. Nigro, P. F. Sciammarella","doi":"10.1109/DISTRA.2017.8167684","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167684","url":null,"abstract":"This paper proposes an approach to modelling and analysis of distributed real-time actor systems, which is based on the Uppaal statistical model checker (SMC). SMC was chosen because it automatizes simulations, offers a temporal logic language to formalize specifications and exploits statistical techniques to infer quantitative measures about a model. The approach is integrated in a system life-cycle where a same model can be transitioned without distortions from analysis down to design and implementation, currently based on Java. The paper describes the adopted actor modelling language and its architectural framework, illustrates the Uppaal SMC approach and demonstrates its practical usefulness through a running example.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127841588","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}
Pub Date : 2017-10-18DOI: 10.1109/DISTRA.2017.8167677
Anuj Kaul, K. Obraczka, Mateus A. S. Santos, Christian Esteve Rothenberg, T. Turletti
We propose D2-ITS, a flexible and extensible framework to dynamically distribute network control to enable message dissemination in Intelligent Transport Systems (ITS). By decoupling the control-from the data plane, D2-ITS leverages network programmability to address ITS scalability, delay intolerance and decentralization. It uses a distributed control plane based on a hierarchy of controllers that can dynamically adjust to environment- and network conditions in order to satisfy ITS application requirements. We demonstrate the benefits of D2-ITS through a proof-of-concept prototype using the ns-3 simulation platform. Results indicate lower message delivery latency with minimal additional overhead.
{"title":"Dynamically distributed network control for message dissemination in ITS","authors":"Anuj Kaul, K. Obraczka, Mateus A. S. Santos, Christian Esteve Rothenberg, T. Turletti","doi":"10.1109/DISTRA.2017.8167677","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167677","url":null,"abstract":"We propose D2-ITS, a flexible and extensible framework to dynamically distribute network control to enable message dissemination in Intelligent Transport Systems (ITS). By decoupling the control-from the data plane, D2-ITS leverages network programmability to address ITS scalability, delay intolerance and decentralization. It uses a distributed control plane based on a hierarchy of controllers that can dynamically adjust to environment- and network conditions in order to satisfy ITS application requirements. We demonstrate the benefits of D2-ITS through a proof-of-concept prototype using the ns-3 simulation platform. Results indicate lower message delivery latency with minimal additional overhead.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125355133","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}
Pub Date : 2017-10-18DOI: 10.1109/DISTRA.2017.8167687
Nunzia Palmieri, Xin-She Yang, F. Rango
We study a situation where a swarm of robots is deployed to handle multiple different targets in a confined unknown area. The targets are found in real time and each target requires a certain amount of resources. An individual robot may not have sufficient capabilities for its execution, therefore an announcement process can start. We address the issue of how each robot responds itself to one of the discovered targets in an efficient way, considering a dynamic scenario where failure of the robots and unreliable communications unpredictably can occur. We propose a network architecture that incorporates a self-regulating mechanism allowing the distribution among the targets, with the minimal exchange of information. We have conducted experiments for evaluating our proposed approach in a simulated environment, considering different network parameters and studying the scalability and the robustness of the proposed model.
{"title":"Self-adaptive mechanism for coalitions formation in a robot network","authors":"Nunzia Palmieri, Xin-She Yang, F. Rango","doi":"10.1109/DISTRA.2017.8167687","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167687","url":null,"abstract":"We study a situation where a swarm of robots is deployed to handle multiple different targets in a confined unknown area. The targets are found in real time and each target requires a certain amount of resources. An individual robot may not have sufficient capabilities for its execution, therefore an announcement process can start. We address the issue of how each robot responds itself to one of the discovered targets in an efficient way, considering a dynamic scenario where failure of the robots and unreliable communications unpredictably can occur. We propose a network architecture that incorporates a self-regulating mechanism allowing the distribution among the targets, with the minimal exchange of information. We have conducted experiments for evaluating our proposed approach in a simulated environment, considering different network parameters and studying the scalability and the robustness of the proposed model.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125728573","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}
Pub Date : 2017-10-18DOI: 10.1109/DISTRA.2017.8167666
T. Tocci, Alessandro Pellegrini, F. Quaglia, J. Casanovas, T. Suzumura
Taking advantage of computing capabilities offered by modern parallel and distributed architectures is fundamental to run large-scale simulation models based on the Parallel Discrete Event Simulation (PDES) paradigm. By relying on this computing organization, it is possible to effectively overcome both the power and the memory wall, which are core limiting aspects to deliver high-performance simulations. This is even more the case when relying on the speculative Time Warp synchronization protocol, which could be particularly memory greedy. At the same time, some form of coordination, such as the computation of the Global Virtual Time (GVT), is required by Time Warp Systems. These coordination points could easily become the bottleneck of large-scale simulations, hindering an efficient exploitation of the computing power offered by large supercomputing facilities. In this paper we present ORCHESTRA, a coordination algorithm which is both wait-free and asynchronous. The nature of this algorithm allows any computing node to carry on simulation activities while the global agreement is reached, thus offering an effective building block to achieve scalable PDES. We claim that the general organization of ORCHESTRA could be adopted by different high-performance computing applications, thus paving the way to a more effective usage of modern computing infrastructures.
{"title":"ORCHESTRA: An asynchronous wait-free distributed GVT algorithm","authors":"T. Tocci, Alessandro Pellegrini, F. Quaglia, J. Casanovas, T. Suzumura","doi":"10.1109/DISTRA.2017.8167666","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167666","url":null,"abstract":"Taking advantage of computing capabilities offered by modern parallel and distributed architectures is fundamental to run large-scale simulation models based on the Parallel Discrete Event Simulation (PDES) paradigm. By relying on this computing organization, it is possible to effectively overcome both the power and the memory wall, which are core limiting aspects to deliver high-performance simulations. This is even more the case when relying on the speculative Time Warp synchronization protocol, which could be particularly memory greedy. At the same time, some form of coordination, such as the computation of the Global Virtual Time (GVT), is required by Time Warp Systems. These coordination points could easily become the bottleneck of large-scale simulations, hindering an efficient exploitation of the computing power offered by large supercomputing facilities. In this paper we present ORCHESTRA, a coordination algorithm which is both wait-free and asynchronous. The nature of this algorithm allows any computing node to carry on simulation activities while the global agreement is reached, thus offering an effective building block to achieve scalable PDES. We claim that the general organization of ORCHESTRA could be adopted by different high-performance computing applications, thus paving the way to a more effective usage of modern computing infrastructures.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126620445","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}
Pub Date : 2017-10-18DOI: 10.1109/DISTRA.2017.8167690
Eugene Ch’ng, Ziyang Chen, S. See
Data visualization is an important aspect of data analytics in an age where decisions are all based on information. Approaches in data visualization, particularly those that have the capability of processing large-scale textual datasets and visualize them as structured information in real-time can be useful for monitoring trends in social media. In this article, we present our GPU accelerated project, which uses CUDA to distribute and parallelize the processing and analysis of textual data in order to visualize information in real-time, or close to real-time as a foundational system for the future of real-time applications which monitors trends in social media, applicable to political elections, social media analytics, and other needs in computational social sciences which are time-critical.
{"title":"Real-time GPU-accelerated social media sentiment processing and visualization","authors":"Eugene Ch’ng, Ziyang Chen, S. See","doi":"10.1109/DISTRA.2017.8167690","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167690","url":null,"abstract":"Data visualization is an important aspect of data analytics in an age where decisions are all based on information. Approaches in data visualization, particularly those that have the capability of processing large-scale textual datasets and visualize them as structured information in real-time can be useful for monitoring trends in social media. In this article, we present our GPU accelerated project, which uses CUDA to distribute and parallelize the processing and analysis of textual data in order to visualize information in real-time, or close to real-time as a foundational system for the future of real-time applications which monitors trends in social media, applicable to political elections, social media analytics, and other needs in computational social sciences which are time-critical.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"388 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122781616","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}
Pub Date : 2017-10-18DOI: 10.1109/DISTRA.2017.8167685
Vincenzo Inzillo, A. Santamaria, A. Ariza-Quintana
Simulations in complex network scenario environments such as Adaptive Beamforming Networks (ABFN), are very expensive in terms of computational costs. To reduce the overall computational burden, we propose to integrate Omnet++ simulator with Matlab in order to provide a co-simulation model for allowing an efficient communication system that is able to emulate high complexity simulation contexts.
{"title":"Integration of Omnet++ simulator with Matlab for realizing an adaptive beamforming system","authors":"Vincenzo Inzillo, A. Santamaria, A. Ariza-Quintana","doi":"10.1109/DISTRA.2017.8167685","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167685","url":null,"abstract":"Simulations in complex network scenario environments such as Adaptive Beamforming Networks (ABFN), are very expensive in terms of computational costs. To reduce the overall computational burden, we propose to integrate Omnet++ simulator with Matlab in order to provide a co-simulation model for allowing an efficient communication system that is able to emulate high complexity simulation contexts.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"134 17","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132802498","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：