Pub Date : 2019-10-01DOI: 10.1109/DS-RT47707.2019.8958689
Sergio Martiradonna, A. Abrardo, M. Moretti, G. Piro, G. Boggia
The Fifth Generation of mobile networks is emerging as a key enabler for Ultra Reliable and Low Latency Communications. However, to effectively design and provide safety-critical applications through mobile systems, many research issues still need to be deeply investigated. The most important ones include: (1) the dynamic and flexible management of radio resources of a new Radio Access Network jointly used by many virtual mobile operators, (2) the optimized and realtime configuration of network slices, and (3) the harmonious integration of Multi-access Edge Computing services. Starting from the efficient methodologies and solutions available in the current state of the art, this position paper sheds some important basis for the design of a comprehensive architecture enabling Radio Access Network slicing for Ultra Reliable and Low Latency Communications, including design criteria, system components and their baseline interactions, and critical open issues to be investigated in future research initiatives.
{"title":"Architecting RAN Slicing for URLLC: Design Decisions and Open Issues","authors":"Sergio Martiradonna, A. Abrardo, M. Moretti, G. Piro, G. Boggia","doi":"10.1109/DS-RT47707.2019.8958689","DOIUrl":"https://doi.org/10.1109/DS-RT47707.2019.8958689","url":null,"abstract":"The Fifth Generation of mobile networks is emerging as a key enabler for Ultra Reliable and Low Latency Communications. However, to effectively design and provide safety-critical applications through mobile systems, many research issues still need to be deeply investigated. The most important ones include: (1) the dynamic and flexible management of radio resources of a new Radio Access Network jointly used by many virtual mobile operators, (2) the optimized and realtime configuration of network slices, and (3) the harmonious integration of Multi-access Edge Computing services. Starting from the efficient methodologies and solutions available in the current state of the art, this position paper sheds some important basis for the design of a comprehensive architecture enabling Radio Access Network slicing for Ultra Reliable and Low Latency Communications, including design criteria, system components and their baseline interactions, and critical open issues to be investigated in future research initiatives.","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130013834","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 : 2019-10-01DOI: 10.1109/DS-RT47707.2019.8958691
Quentin Ricard, P. Owezarski
The rising interest in Intelligent Transportation Systems shines light on a complex task: The evaluation of new applications and services that could prevent accident, regulate traffic, and help the automotive industry in designing energy efficient vehicles. These applications will rely on a new communication channel between vehicles, infrastructure and cloud services, and will have to operate under various network performances. However, testing applications and services in real-life networks is costly and reproducing network behaviour in a controlled environment is challenging. Furthermore, simulation tools lack real-time evaluation capabilities. Therefore, we present in this paper an environment for the real-time emulation of cellular vehicular communications. It allows the user to rapidly and cost efficiently implement and test applications under realistic mobile network performances.
{"title":"Autobot: An Emulation Environment For Cellular Vehicular Communications","authors":"Quentin Ricard, P. Owezarski","doi":"10.1109/DS-RT47707.2019.8958691","DOIUrl":"https://doi.org/10.1109/DS-RT47707.2019.8958691","url":null,"abstract":"The rising interest in Intelligent Transportation Systems shines light on a complex task: The evaluation of new applications and services that could prevent accident, regulate traffic, and help the automotive industry in designing energy efficient vehicles. These applications will rely on a new communication channel between vehicles, infrastructure and cloud services, and will have to operate under various network performances. However, testing applications and services in real-life networks is costly and reproducing network behaviour in a controlled environment is challenging. Furthermore, simulation tools lack real-time evaluation capabilities. Therefore, we present in this paper an environment for the real-time emulation of cellular vehicular communications. It allows the user to rapidly and cost efficiently implement and test applications under realistic mobile network performances.","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128966690","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 : 2019-10-01DOI: 10.1109/ds-rt47707.2019.8958667
{"title":"DS-RT 2019 Organizing Committee","authors":"","doi":"10.1109/ds-rt47707.2019.8958667","DOIUrl":"https://doi.org/10.1109/ds-rt47707.2019.8958667","url":null,"abstract":"","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122987575","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 : 2019-10-01DOI: 10.1109/DS-RT47707.2019.8958697
A. D’Ambrogio, A. Falcone, A. Garro, Andrea Giglio
Modern systems are exposing an ever increasing degree of complexity also due to the heterogeneity of the involved components. Distributed simulation is widely recognized as an effective tool to carry out verification and validation activities for heterogeneous and complex systems. Unfortunately, the use of distributed simulation frameworks and related implementation technologies require a proper modeling and simulation know-how, as well as a significant effort and software development skills. As a result, distributed simulation is not typically addressed by systems engineers who do not have the required expertise or background. The MONADS model-driven method has been introduced to overcome such limitations and provide systems engineers with the ability to properly carry out simulation-based verification and validation activities. The method specifically addresses the HLA (High Level Architecture) distributed simulation framework and introduces an automated approach to generate a significant portion of the HLA code from system models specified in SysML, the standard modeling language in the systems engineering field. The automatically obtained code is then to be finalized by a manual programming activity. This paper contributes to make easier and further reduce the effort of such a manual activity by integrating the reactive features of the RxHLA framework into the MONADS method. This integration enables the use of streams to effectively manage HLA-based asynchronous interactions. The paper describes the technical details of the various strategies that can be used to integrate RxHLA into the MONADS method, thus providing a significant degree of flexibility to MONADS users.
{"title":"Enabling Reactive Streams in HLA-based Simulations through a Model-Driven Solution","authors":"A. D’Ambrogio, A. Falcone, A. Garro, Andrea Giglio","doi":"10.1109/DS-RT47707.2019.8958697","DOIUrl":"https://doi.org/10.1109/DS-RT47707.2019.8958697","url":null,"abstract":"Modern systems are exposing an ever increasing degree of complexity also due to the heterogeneity of the involved components. Distributed simulation is widely recognized as an effective tool to carry out verification and validation activities for heterogeneous and complex systems. Unfortunately, the use of distributed simulation frameworks and related implementation technologies require a proper modeling and simulation know-how, as well as a significant effort and software development skills. As a result, distributed simulation is not typically addressed by systems engineers who do not have the required expertise or background. The MONADS model-driven method has been introduced to overcome such limitations and provide systems engineers with the ability to properly carry out simulation-based verification and validation activities. The method specifically addresses the HLA (High Level Architecture) distributed simulation framework and introduces an automated approach to generate a significant portion of the HLA code from system models specified in SysML, the standard modeling language in the systems engineering field. The automatically obtained code is then to be finalized by a manual programming activity. This paper contributes to make easier and further reduce the effort of such a manual activity by integrating the reactive features of the RxHLA framework into the MONADS method. This integration enables the use of streams to effectively manage HLA-based asynchronous interactions. The paper describes the technical details of the various strategies that can be used to integrate RxHLA into the MONADS method, thus providing a significant degree of flexibility to MONADS users.","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"276 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134265075","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 : 2019-10-01DOI: 10.1109/DS-RT47707.2019.8958709
R. Beraldi, Gabriele Proietti Mattia
In this paper, we propose and report a study of a low latency resource sharing protocol for Fog Computing. The protocol has its root in the power-of-random choices family of randomization protocol. The protocol, dubbed $LL_{g}(T)$ is designed to cope with a not homogeneous set of nodes and dealing with a communication latency comparable with the task execution, a characteristic of time-constrained applications supported by this service delivery model. The protocol allows to determine when a task can be moved from the origin fog node that receives the task to another node, where it can be executed faster. This task handoff is controlled via a threshold T. The remote node is selected uniformly at random.
{"title":"A Randomized Low Latency Resource Sharing Algorithm for Fog Computing","authors":"R. Beraldi, Gabriele Proietti Mattia","doi":"10.1109/DS-RT47707.2019.8958709","DOIUrl":"https://doi.org/10.1109/DS-RT47707.2019.8958709","url":null,"abstract":"In this paper, we propose and report a study of a low latency resource sharing protocol for Fog Computing. The protocol has its root in the power-of-random choices family of randomization protocol. The protocol, dubbed $LL_{g}(T)$ is designed to cope with a not homogeneous set of nodes and dealing with a communication latency comparable with the task execution, a characteristic of time-constrained applications supported by this service delivery model. The protocol allows to determine when a task can be moved from the origin fog node that receives the task to another node, where it can be executed faster. This task handoff is controlled via a threshold T. The remote node is selected uniformly at random.","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129213727","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 : 2019-10-01DOI: 10.1109/ds-rt47707.2019.8958676
K. Trivedi
High reliability and availability is a requirement for most technical systems. Reliability and availability assurance methods based on probabilistic models is the topic addressed in this talk. Non-statespace solution methods are often used to solve models based on reliability block diagrams, fault trees and reliability graphs. Relatively efficient algorithms are known to handle systems with hundreds of components and have been implemented in many software packages. Nevertheless, many practical problems cannot be handled by such algorithms. Bounding algorithms are then used in such cases as was done for a major subsystem of Boeing 787. Non-state-space methods derive their efficiency from the independence assumption that is often violated in practice. State space methods based on Markov chains, stochastic Petri nets, semi-Markov and Markov regenerative processes can be used to model various kinds of dependencies among system components. However, the resulting state space explosion severely restricts the size of the problem that can be solved. Hierarchical and fixed-point iterative methods provide a scalable alternative that combines the strengths of state space and non-state-space methods and have been extensively used to solve real-life problems. We will take a journey through these model types via interesting real-world examples chosen from IBM, Cisco, Sun Microsystems, and Boeing. These methods and applications are fully described in a recently completed book: Reliability and Availability Engineering: Modeling, Analysis and Applications, Cambridge University Press, 2017.
{"title":"Reliability and Availability Assessment in Practice","authors":"K. Trivedi","doi":"10.1109/ds-rt47707.2019.8958676","DOIUrl":"https://doi.org/10.1109/ds-rt47707.2019.8958676","url":null,"abstract":"High reliability and availability is a requirement for most technical systems. Reliability and availability assurance methods based on probabilistic models is the topic addressed in this talk. Non-statespace solution methods are often used to solve models based on reliability block diagrams, fault trees and reliability graphs. Relatively efficient algorithms are known to handle systems with hundreds of components and have been implemented in many software packages. Nevertheless, many practical problems cannot be handled by such algorithms. Bounding algorithms are then used in such cases as was done for a major subsystem of Boeing 787. Non-state-space methods derive their efficiency from the independence assumption that is often violated in practice. State space methods based on Markov chains, stochastic Petri nets, semi-Markov and Markov regenerative processes can be used to model various kinds of dependencies among system components. However, the resulting state space explosion severely restricts the size of the problem that can be solved. Hierarchical and fixed-point iterative methods provide a scalable alternative that combines the strengths of state space and non-state-space methods and have been extensively used to solve real-life problems. We will take a journey through these model types via interesting real-world examples chosen from IBM, Cisco, Sun Microsystems, and Boeing. These methods and applications are fully described in a recently completed book: Reliability and Availability Engineering: Modeling, Analysis and Applications, Cambridge University Press, 2017.","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127919715","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 : 2019-10-01DOI: 10.1109/DS-RT47707.2019.8958700
Shichao Guan, A. Boukerche
The advancements in mobile hardware and network technologies facilitate the processing power, storage capability, and connection quality. Such developments enable sophistic functions, ubiquitous power- and bandwidth-hungry applications that fundamentally changes the individual’s lifestyle. Although Cloud Computing technologies have already been leveraged to coordinate with the capability and battery-constraint mobile User Equipment (UE), the long-distance propagation delay downgrades the network QoS and user QoE. In this paper, we propose a queueing-based Mobile Edge Computing (MEC) model that concerns the offloading procedure, especially in the time-constraint scenarios. A queueing model is proposed for the offloading process, considering the dynamic network queueing delay. A heuristic scheduling model is designed to maximize the offloading energy and execution efficiency. A regression prediction model is implemented to achieve dynamic resource allocation. In the experiment, the proposed model is compared to the recent studies, and the results indicate that the proposed model can outperform the current studies in terms of execution time and energy reservation.
{"title":"A MEC-based Distributed Offloading Model for Ubiquitous and Time-constraint Offloading","authors":"Shichao Guan, A. Boukerche","doi":"10.1109/DS-RT47707.2019.8958700","DOIUrl":"https://doi.org/10.1109/DS-RT47707.2019.8958700","url":null,"abstract":"The advancements in mobile hardware and network technologies facilitate the processing power, storage capability, and connection quality. Such developments enable sophistic functions, ubiquitous power- and bandwidth-hungry applications that fundamentally changes the individual’s lifestyle. Although Cloud Computing technologies have already been leveraged to coordinate with the capability and battery-constraint mobile User Equipment (UE), the long-distance propagation delay downgrades the network QoS and user QoE. In this paper, we propose a queueing-based Mobile Edge Computing (MEC) model that concerns the offloading procedure, especially in the time-constraint scenarios. A queueing model is proposed for the offloading process, considering the dynamic network queueing delay. A heuristic scheduling model is designed to maximize the offloading energy and execution efficiency. A regression prediction model is implemented to achieve dynamic resource allocation. In the experiment, the proposed model is compared to the recent studies, and the results indicate that the proposed model can outperform the current studies in terms of execution time and energy reservation.","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131685308","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 : 2019-10-01DOI: 10.1109/DS-RT47707.2019.8958695
F. Cicirelli, L. Nigro
Home Energy Management Systems (HEMSs) are devoted to monitoring and control the operation of domestic appliances in order to purposely shape the in-home energy consumption curves. A challenge in the design and implementation of a HEMS is to guarantee a proper coupling between the cyber discrete part of the system with the continuous modes of the physical environment in which the HEMS operates. This paper is concerned with the development of a HEMS by using the Theatre actor system. Theatre favors the construction of cyber-physical systems (CPSs) by exploiting a notion of hybrid actors. As a key feature, Theatre enables a same actor model to be exploited during the analysis, design, prototyping and implementation phases of a CPS. For analysis purposes, a Theatre model is reduced to UPPAAL hybrid timed automata for property assessment by statistical model checking.
{"title":"Home Energy Management Using Theatre With Hybrid Actors","authors":"F. Cicirelli, L. Nigro","doi":"10.1109/DS-RT47707.2019.8958695","DOIUrl":"https://doi.org/10.1109/DS-RT47707.2019.8958695","url":null,"abstract":"Home Energy Management Systems (HEMSs) are devoted to monitoring and control the operation of domestic appliances in order to purposely shape the in-home energy consumption curves. A challenge in the design and implementation of a HEMS is to guarantee a proper coupling between the cyber discrete part of the system with the continuous modes of the physical environment in which the HEMS operates. This paper is concerned with the development of a HEMS by using the Theatre actor system. Theatre favors the construction of cyber-physical systems (CPSs) by exploiting a notion of hybrid actors. As a key feature, Theatre enables a same actor model to be exploited during the analysis, design, prototyping and implementation phases of a CPS. For analysis purposes, a Theatre model is reduced to UPPAAL hybrid timed automata for property assessment by statistical model checking.","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131553038","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 : 2019-10-01DOI: 10.1109/DS-RT47707.2019.8958680
Chun-Wei Lin, Yuanfa Li, Matin Pirouz, Linlin Tang, M. Voznák, L. Sevcik
High utility pattern mining (HUPM) has become a key issue in knowledge discovery since it provides retailers and managers with useful information for making decisions efficiently. However, previous studies most focused on mining the high-utility patterns (HUPs) from a single database. In this paper, we present a framework to incorporate the weighted model for parallel synthesis of the discovered HUPs from various databases. The pre-large concept was also used as a buffer here in order to provide more prospective HUPs, thus providing higher accuracy of the synthesized patterns. From our experiments, the developed model exceeds existing works, in particular the designed model has increased precision and recall on knowledge synthesization compared to the previous works.
{"title":"Synthesization of High-Utility Patterns in Parallel Computing","authors":"Chun-Wei Lin, Yuanfa Li, Matin Pirouz, Linlin Tang, M. Voznák, L. Sevcik","doi":"10.1109/DS-RT47707.2019.8958680","DOIUrl":"https://doi.org/10.1109/DS-RT47707.2019.8958680","url":null,"abstract":"High utility pattern mining (HUPM) has become a key issue in knowledge discovery since it provides retailers and managers with useful information for making decisions efficiently. However, previous studies most focused on mining the high-utility patterns (HUPs) from a single database. In this paper, we present a framework to incorporate the weighted model for parallel synthesis of the discovered HUPs from various databases. The pre-large concept was also used as a buffer here in order to provide more prospective HUPs, thus providing higher accuracy of the synthesized patterns. From our experiments, the developed model exceeds existing works, in particular the designed model has increased precision and recall on knowledge synthesization compared to the previous works.","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130851092","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 : 2019-10-01DOI: 10.1109/DS-RT47707.2019.8958702
Daniel Rajf, T. Potuzak
In this paper, we describe a fair comparison of the performance of a microscopic road traffic simulation performed on a GPU and on a CPU. The aim of our work is to determine the speedup, which can be achieved if the GPU is used for the same simulation instead of the (multi-core) CPU. A microscopic road traffic simulator capable of running on both platforms was created for this purpose with the aim to make the GPU-based and the CPU-based simulations as similar as possible. The performances of both the GPU-based and the CPU-based simulations were tested using two different road traffic models (a car-following model and a cellular automaton model), four road traffic networks (regular square grids of crossroads) of different sizes, and three different hardware configurations. The maximal achieved speedup using the GPU instead of the multi-core CPU for the cellular automaton model was 12.4. For the car-following model, the maximal achieved speedup was 10.7.
{"title":"Comparison of Road Traffic Simulation Speed on CPU and GPU","authors":"Daniel Rajf, T. Potuzak","doi":"10.1109/DS-RT47707.2019.8958702","DOIUrl":"https://doi.org/10.1109/DS-RT47707.2019.8958702","url":null,"abstract":"In this paper, we describe a fair comparison of the performance of a microscopic road traffic simulation performed on a GPU and on a CPU. The aim of our work is to determine the speedup, which can be achieved if the GPU is used for the same simulation instead of the (multi-core) CPU. A microscopic road traffic simulator capable of running on both platforms was created for this purpose with the aim to make the GPU-based and the CPU-based simulations as similar as possible. The performances of both the GPU-based and the CPU-based simulations were tested using two different road traffic models (a car-following model and a cellular automaton model), four road traffic networks (regular square grids of crossroads) of different sizes, and three different hardware configurations. The maximal achieved speedup using the GPU instead of the multi-core CPU for the cellular automaton model was 12.4. For the car-following model, the maximal achieved speedup was 10.7.","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132290608","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
扫码关注我们
求助内容：
应助结果提醒方式：