Pub Date : 2017-10-18DOI: 10.1109/DISTRA.2017.8167691
A. Falcone, A. Garro, Simon J. E. Taylor, A. Anagnostou
The IEEE 1516-2010 — Standard for Modeling and Simulation High Level Architecture (HLA) range of standards are widely used for distributed simulation, interoperability, reusability and the modeling of large-scale systems in many application domains. Although it provides several advantages, the development of distributed simulations based on the HLA standards remains a challenging task that requires a considerable effort in terms of time, cost and expertise. The HLA Development Kit software framework (DKF) is a software framework that aims to facilitate the development of HLA-based distributed simulations. This tutorial presents an overview of the DKF and a methodology for its use. Examples of the DKF in action are given from the Simulation Exploration Experience (SEE), a worldwide project led by NASA that annually gives the opportunity to build collaboratively a distributed simulation of a scientific base placed on the moon surface.
{"title":"Simplifying the development of HLA-based distributed simulations with the HLA Development Kit software framework (DKF)","authors":"A. Falcone, A. Garro, Simon J. E. Taylor, A. Anagnostou","doi":"10.1109/DISTRA.2017.8167691","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167691","url":null,"abstract":"The IEEE 1516-2010 — Standard for Modeling and Simulation High Level Architecture (HLA) range of standards are widely used for distributed simulation, interoperability, reusability and the modeling of large-scale systems in many application domains. Although it provides several advantages, the development of distributed simulations based on the HLA standards remains a challenging task that requires a considerable effort in terms of time, cost and expertise. The HLA Development Kit software framework (DKF) is a software framework that aims to facilitate the development of HLA-based distributed simulations. This tutorial presents an overview of the DKF and a methodology for its use. Examples of the DKF in action are given from the Simulation Exploration Experience (SEE), a worldwide project led by NASA that annually gives the opportunity to build collaboratively a distributed simulation of a scientific base placed on the moon surface.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"21 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":"124750077","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.8167682
Lamia Ben Amor, Imene Lahyani, M. Jmaiel
Real time mobile Health applications highly depend on sensor readings to provide high-quality health services. However, real-time sensor readings may be inaccurate and cause abnormal physiological measurements due to internal and external factors. Thus, abnormal readings have a significant impact on the reliability of such applications and consequently affect the patient's life. This paper addresses the following issue by proposing a robust approach for online detection of abnormal medical measurements. The proposed approach is based on robust Principal Component Analysis (PCA) to analyze collected physiological measurements from sensors and detect the occurrence of multivariate anomalies based on squared prediction error at runtime. We apply our proposed approach on real medical dataset. Our simulation results prove the effectiveness of our approach in achieving good recall with a low false alarm rate. The reduced time and space complexity of our approach make it useful and efficient for real time settings.
实时移动医疗应用高度依赖传感器读数来提供高质量的医疗服务。然而，由于内部和外部因素，实时传感器读数可能不准确，并导致生理测量异常。因此，异常读数对此类应用的可靠性产生重大影响，从而影响患者的生命。本文通过提出一种在线检测异常医学测量的鲁棒方法来解决以下问题。该方法基于鲁棒主成分分析(robust Principal Component Analysis, PCA)对传感器采集的生理测量数据进行分析，并在运行时基于预测误差的平方来检测多变量异常的发生。我们将所提出的方法应用于真实的医学数据集。仿真结果证明了该方法在低虚警率下获得良好召回率的有效性。我们的方法减少了时间和空间的复杂性，使其对实时设置有用且有效。
{"title":"PCA-based multivariate anomaly detection in mobile healthcare applications","authors":"Lamia Ben Amor, Imene Lahyani, M. Jmaiel","doi":"10.1109/DISTRA.2017.8167682","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167682","url":null,"abstract":"Real time mobile Health applications highly depend on sensor readings to provide high-quality health services. However, real-time sensor readings may be inaccurate and cause abnormal physiological measurements due to internal and external factors. Thus, abnormal readings have a significant impact on the reliability of such applications and consequently affect the patient's life. This paper addresses the following issue by proposing a robust approach for online detection of abnormal medical measurements. The proposed approach is based on robust Principal Component Analysis (PCA) to analyze collected physiological measurements from sensors and detect the occurrence of multivariate anomalies based on squared prediction error at runtime. We apply our proposed approach on real medical dataset. Our simulation results prove the effectiveness of our approach in achieving good recall with a low false alarm rate. The reduced time and space complexity of our approach make it useful and efficient for real time settings.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"6 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":"133334513","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.8167662
Mauro Ianni, Romolo Marotta, Alessandro Pellegrini, F. Quaglia
The increasing diffusion of shared-memory multi-core machines has given rise to a change in the design of Parallel Discrete Event Simulation (PDES) platforms. In particular, the possibility to share large amounts of memory by many worker threads has lead to a boost in the adoption of non-blocking coordination algorithms, which have been proven to offer higher scalability when compared to their blocking counterparts based on critical sections. In this article we present an innovative non-blocking algorithm for computing Global Virtual Time (GVT) — namely, the current commit horizon-in multi-thread PDES engines to be run on top of multi-core machines. Beyond being non-blocking, our proposal has the advantage of providing a logarithmic (rather than linear) number of per-thread memory operations — read/write operations of values involved in the reduction for computing the GVT value-vs the amount of threads participating in the GVT computation. This allows for keeping low the actual CPU time that is required for determining the new GVT value. We compare our algorithm with a literature solution, still based on the non-blocking approach, but entailing a linear number of memory operations, quantifying the advantages from our proposal especially for very large numbers of threads participating in the GVT computation.
{"title":"A non-blocking global virtual time algorithm with logarithmic number of memory operations","authors":"Mauro Ianni, Romolo Marotta, Alessandro Pellegrini, F. Quaglia","doi":"10.1109/DISTRA.2017.8167662","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167662","url":null,"abstract":"The increasing diffusion of shared-memory multi-core machines has given rise to a change in the design of Parallel Discrete Event Simulation (PDES) platforms. In particular, the possibility to share large amounts of memory by many worker threads has lead to a boost in the adoption of non-blocking coordination algorithms, which have been proven to offer higher scalability when compared to their blocking counterparts based on critical sections. In this article we present an innovative non-blocking algorithm for computing Global Virtual Time (GVT) — namely, the current commit horizon-in multi-thread PDES engines to be run on top of multi-core machines. Beyond being non-blocking, our proposal has the advantage of providing a logarithmic (rather than linear) number of per-thread memory operations — read/write operations of values involved in the reduction for computing the GVT value-vs the amount of threads participating in the GVT computation. This allows for keeping low the actual CPU time that is required for determining the new GVT value. We compare our algorithm with a literature solution, still based on the non-blocking approach, but entailing a linear number of memory operations, quantifying the advantages from our proposal especially for very large numbers of threads participating in the GVT computation.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"1 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":"122251261","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.8167669
B. Möller, A. Garro, A. Falcone, E. Crues, Dan Dexter
In the Space domain the High Level Architecture (HLA) is one of the reference standard for Distributed Simulation. However, for the different organization involved in the Space domain (e.g. NASA, ESA, Roscosmos, and JAXA) and their industrial partners, it is difficult to implement HLA simulators (called Federates) able to interact and interoperate in the context of a distributed HLA simulation (called Federation). The lack of a common FOM (Federation Object Model) for the Space domain is one of the main reasons that precludes a-priori interoperability between heterogeneous federates. To fill this lack a Product Development Group (PDG) has been recently activated in the Simulation Interoperability Standards Organization (SISO) with the aim to provide a Space Reference FOM (SRFOM) for international collaboration on Space systems simulations. Members of the PDG come from several countries and contribute experiences from projects within NASA, ESA and other organizations. Participants represent government, academia and industry. The paper presents an overview of the ongoing Space Reference FOM standardization initiative by focusing on the solution provided for managing the execution of an SRFOM-based Federation.
{"title":"On the execution control of HLA federations using the SISO space reference FOM","authors":"B. Möller, A. Garro, A. Falcone, E. Crues, Dan Dexter","doi":"10.1109/DISTRA.2017.8167669","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167669","url":null,"abstract":"In the Space domain the High Level Architecture (HLA) is one of the reference standard for Distributed Simulation. However, for the different organization involved in the Space domain (e.g. NASA, ESA, Roscosmos, and JAXA) and their industrial partners, it is difficult to implement HLA simulators (called Federates) able to interact and interoperate in the context of a distributed HLA simulation (called Federation). The lack of a common FOM (Federation Object Model) for the Space domain is one of the main reasons that precludes a-priori interoperability between heterogeneous federates. To fill this lack a Product Development Group (PDG) has been recently activated in the Simulation Interoperability Standards Organization (SISO) with the aim to provide a Space Reference FOM (SRFOM) for international collaboration on Space systems simulations. Members of the PDG come from several countries and contribute experiences from projects within NASA, ESA and other organizations. Participants represent government, academia and industry. The paper presents an overview of the ongoing Space Reference FOM standardization initiative by focusing on the solution provided for managing the execution of an SRFOM-based Federation.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"149 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":"132324193","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.8167676
V. Vu, Gary S. H. Tan
Mesoscopic Traffic Simulation is an important tool in traffic analysis and traffic management support. The balance between traffic modeling details and performance has made Mesoscopic Traffic Simulation one of the key solutions for traffic controllers and policy makers. Mesoscopic traffic simulators offer acceptable speed in simulating normal traffic. However, when traffic prediction and optimization for large scale networks come into context, the performance of mesoscopic traffic simulators is unsatisfactory in optimizing a massive number of control parameters for a much longer prediction horizon. This issue again emphasizes the need to further speed up mesoscopic traffic simulation. This paper proposes a comprehensive framework to massively speed up mesoscopic traffic simulation using GPU without compromising its correctness and realistic modeling property. It also gives an in-depth analysis into the trade-off between simulation correctness and performance speedup. By combining the power of GPU with optimal design and data structures, mesoscopic traffic simulation is able to speed up to more than 6 times compared to original CPU implementation.
{"title":"High-performance mesoscopic traffic simulation with GPU for large scale networks","authors":"V. Vu, Gary S. H. Tan","doi":"10.1109/DISTRA.2017.8167676","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167676","url":null,"abstract":"Mesoscopic Traffic Simulation is an important tool in traffic analysis and traffic management support. The balance between traffic modeling details and performance has made Mesoscopic Traffic Simulation one of the key solutions for traffic controllers and policy makers. Mesoscopic traffic simulators offer acceptable speed in simulating normal traffic. However, when traffic prediction and optimization for large scale networks come into context, the performance of mesoscopic traffic simulators is unsatisfactory in optimizing a massive number of control parameters for a much longer prediction horizon. This issue again emphasizes the need to further speed up mesoscopic traffic simulation. This paper proposes a comprehensive framework to massively speed up mesoscopic traffic simulation using GPU without compromising its correctness and realistic modeling property. It also gives an in-depth analysis into the trade-off between simulation correctness and performance speedup. By combining the power of GPU with optimal design and data structures, mesoscopic traffic simulation is able to speed up to more than 6 times compared to original CPU implementation.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"30 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":"125390644","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.8167688
Rongxiao Wang, Bin Chen, S. Qiu, Zhengqiu Zhu, Liang Ma, X. Qiu, Wei Duan
Real-time prediction of the air contaminant dispersion is an important issue in hazard assessment and emergency management of air pollution. The conventional atmospheric simulation can seldom give the precise prediction results due to inaccurate input parameters. To improve the accuracy of the prediction of atmospheric model, a real-time data driven atmospheric dispersion simulation based on data assimilation is proposed by applying particle filer to the Gaussian puff based model. The coefficients of dispersion in this model are selected as the system state variables and updated by assimilating observed data into the model in real time. To obtain high-quality observed data, a UAV-based air contaminant sensory system is developed. Two experiments are designed and implemented to verify the performance of the method. The results show that the method proposed can update the model parameters and improve the accuracy of prediction results effectively.
{"title":"Real-time data driven simulation of air contaminant dispersion using particle filter and UAV sensory system","authors":"Rongxiao Wang, Bin Chen, S. Qiu, Zhengqiu Zhu, Liang Ma, X. Qiu, Wei Duan","doi":"10.1109/DISTRA.2017.8167688","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167688","url":null,"abstract":"Real-time prediction of the air contaminant dispersion is an important issue in hazard assessment and emergency management of air pollution. The conventional atmospheric simulation can seldom give the precise prediction results due to inaccurate input parameters. To improve the accuracy of the prediction of atmospheric model, a real-time data driven atmospheric dispersion simulation based on data assimilation is proposed by applying particle filer to the Gaussian puff based model. The coefficients of dispersion in this model are selected as the system state variables and updated by assimilating observed data into the model in real time. To obtain high-quality observed data, a UAV-based air contaminant sensory system is developed. Two experiments are designed and implemented to verify the performance of the method. The results show that the method proposed can update the model parameters and improve the accuracy of prediction results effectively.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"30 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":"127494488","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.8167663
Mauro Ianni, Romolo Marotta, Alessandro Pellegrini, F. Quaglia
Shared-memory multi-core platforms are changing the nature of Parallel Discrete Event Simulation (PDES) because of the possibility to fully share the workload of events to be processed across threads. In this context, one rising PDES paradigm — referred to as share-everything PDES — is no longer based on the concept of (temporary) biding of simulation objects to worker threads. Rather, each worker threads can — at any time — pick from a fully shared event pool an event to process which can be destined to whatever simulation object. While attention has been posed on the design of concurrent shared pools, allowing non-blocking parallel operations, the scenario where two (or more) threads pick events destined to the same simulation object still lacks adequate synchronization support. In fact, these events are currently sequentialized and processed in a critical section touching the simulation object state, thus leading threads to mutually block each other. In this article we present the design of a share-everything speculative PDES engine that prevents mutual thread blocks because of the access to a same object state. In our design, the non-blocking property is seen as a vertical attribute of the engine (not only of the event pool). This vertical view demands for innovative event-dispatching schemes and, at the same time, innovative interactions with (and management of) the fully-shared event pool, which are features that we embed in our innovative design.
{"title":"Towards a fully non-blocking share-everything PDES platform","authors":"Mauro Ianni, Romolo Marotta, Alessandro Pellegrini, F. Quaglia","doi":"10.1109/DISTRA.2017.8167663","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167663","url":null,"abstract":"Shared-memory multi-core platforms are changing the nature of Parallel Discrete Event Simulation (PDES) because of the possibility to fully share the workload of events to be processed across threads. In this context, one rising PDES paradigm — referred to as share-everything PDES — is no longer based on the concept of (temporary) biding of simulation objects to worker threads. Rather, each worker threads can — at any time — pick from a fully shared event pool an event to process which can be destined to whatever simulation object. While attention has been posed on the design of concurrent shared pools, allowing non-blocking parallel operations, the scenario where two (or more) threads pick events destined to the same simulation object still lacks adequate synchronization support. In fact, these events are currently sequentialized and processed in a critical section touching the simulation object state, thus leading threads to mutually block each other. In this article we present the design of a share-everything speculative PDES engine that prevents mutual thread blocks because of the access to a same object state. In our design, the non-blocking property is seen as a vertical attribute of the engine (not only of the event pool). This vertical view demands for innovative event-dispatching schemes and, at the same time, innovative interactions with (and management of) the fully-shared event pool, which are features that we embed in our innovative design.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"3 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":"133532837","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.8167673
Fan Zhang, R. E. Grande, A. Boukerche
Modeling and simulation have shown essential for forecasting load and resource availability in large-scale complex scenarios. The growth of urban environments, as well as the use of ICT in enabling applications and services, has encouraged several works on the modeling of transportation. High mobility of vehicles in such a context consists of a significant challenge in modeling traffic. Several microscopic and macroscopic models have been designed aiming to represent the movement of vehicles accurately in road segments, involving different levels of complexity, precision, and realism. Out of these models, Free-flow models have shown useful due to being light and reasonably accurate for estimating load in short-time predictions. A recent free-flow traffic flow modeled using queues assumed constant vehicle speed along the road segment; this assumption may lead to a lack of realism and accuracy. Therefore, we propose a free-flow model based on this previous work where the road segment is split into several intervals, representing the oscillations of the speed of vehicles. The proposed model has shown correctness comparable to the previous free-flow model, considering that it has included speed varying behavior of vehicles.
{"title":"Macroscopic interval-split free-flow model for vehicular cloud computing","authors":"Fan Zhang, R. E. Grande, A. Boukerche","doi":"10.1109/DISTRA.2017.8167673","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167673","url":null,"abstract":"Modeling and simulation have shown essential for forecasting load and resource availability in large-scale complex scenarios. The growth of urban environments, as well as the use of ICT in enabling applications and services, has encouraged several works on the modeling of transportation. High mobility of vehicles in such a context consists of a significant challenge in modeling traffic. Several microscopic and macroscopic models have been designed aiming to represent the movement of vehicles accurately in road segments, involving different levels of complexity, precision, and realism. Out of these models, Free-flow models have shown useful due to being light and reasonably accurate for estimating load in short-time predictions. A recent free-flow traffic flow modeled using queues assumed constant vehicle speed along the road segment; this assumption may lead to a lack of realism and accuracy. Therefore, we propose a free-flow model based on this previous work where the road segment is split into several intervals, representing the oscillations of the speed of vehicles. The proposed model has shown correctness comparable to the previous free-flow model, considering that it has included speed varying behavior of vehicles.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"428 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":"125963917","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.8167683
Georgios L. Stavrinides, H. Karatza
As cloud computing continues to gain momentum, big data analytics are now offered as Software as a Service (SaaS). Besides the heterogeneity and multi-tenancy of the underlying virtualized environment, scheduling such real-time, data-intensive, embarrassingly parallel applications in a SaaS cloud involves another serious challenge: data locality. Consequently, data-aware scheduling policies should be employed, in order to effectively exploit data locality, while at the same time taking into account the other attributes of the workload and the characteristics of the resources. Towards this direction, we investigate via simulation the impact of data locality on the performance of a SaaS cloud, where real-time, data-intensive bags-of-tasks are scheduled dynamically, under various data availability conditions. A non-data-aware baseline scheduling policy is compared with two proposed data-aware heuristics, in an attempt to shed light on the effect of data locality awareness on the system performance.
{"title":"The impact of data locality on the performance of a SaaS cloud with real-time data-intensive applications","authors":"Georgios L. Stavrinides, H. Karatza","doi":"10.1109/DISTRA.2017.8167683","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167683","url":null,"abstract":"As cloud computing continues to gain momentum, big data analytics are now offered as Software as a Service (SaaS). Besides the heterogeneity and multi-tenancy of the underlying virtualized environment, scheduling such real-time, data-intensive, embarrassingly parallel applications in a SaaS cloud involves another serious challenge: data locality. Consequently, data-aware scheduling policies should be employed, in order to effectively exploit data locality, while at the same time taking into account the other attributes of the workload and the characteristics of the resources. Towards this direction, we investigate via simulation the impact of data locality on the performance of a SaaS cloud, where real-time, data-intensive bags-of-tasks are scheduled dynamically, under various data availability conditions. A non-data-aware baseline scheduling policy is compared with two proposed data-aware heuristics, in an attempt to shed light on the effect of data locality awareness on the system performance.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"1 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":"129823254","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.8167671
Andre Ippisch, Salem Sati, Kalman Graffi
Available smartphone« and smart objects can use short range connections like Wi-Fi and Bluetooth as a communication technique to exchange information with nearby devices. Those techniques are used in cases of absent end-to-end connection such as in Delay Tolerant or Opportunistic Networks. The study of message transmission processes and contact information in such networks has gained more attention nowadays, where contact information and message transfer have a great impact on Store-Carry-Forward routing decisions. The performance of routing mechanisms is measured based on bandwidth utilization and energy consumption regarding the delivery ratio. Therefore, in this paper we present a study framework to formulate the message propagation process in addition to contact information with a view on energy consumption. The study gives a detailed expression of contact information such as contact probability based on node density and transmission range in a bounded area. Furthermore, the message exchange process as element of channel utilization and energy consumption will be studied. Based on our simulation experiment results we evaluate the influence of various parameters on each other and finally on the system performance.
{"title":"Device to device communication in mobile Delay Tolerant networks","authors":"Andre Ippisch, Salem Sati, Kalman Graffi","doi":"10.1109/DISTRA.2017.8167671","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167671","url":null,"abstract":"Available smartphone« and smart objects can use short range connections like Wi-Fi and Bluetooth as a communication technique to exchange information with nearby devices. Those techniques are used in cases of absent end-to-end connection such as in Delay Tolerant or Opportunistic Networks. The study of message transmission processes and contact information in such networks has gained more attention nowadays, where contact information and message transfer have a great impact on Store-Carry-Forward routing decisions. The performance of routing mechanisms is measured based on bandwidth utilization and energy consumption regarding the delivery ratio. Therefore, in this paper we present a study framework to formulate the message propagation process in addition to contact information with a view on energy consumption. The study gives a detailed expression of contact information such as contact probability based on node density and transmission range in a bounded area. Furthermore, the message exchange process as element of channel utilization and energy consumption will be studied. Based on our simulation experiment results we evaluate the influence of various parameters on each other and finally on the system performance.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"7 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":"123646989","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
扫码关注我们
求助内容：
应助结果提醒方式：