Pub Date : 2017-10-18DOI: 10.1109/DISTRA.2017.8167675
Behnam Torabi, R. Wenkstern, Robert Saylor
In this paper we discuss a multi-agent cooperative approach for decentralized, coordinated traffic systems. Intersection controllers are equipped with agents, i.e., autonomous software systems which are capable of communicating and cooperating with one another to achieve an individual or global goal. Our approach is based on real-world traffic parameters and constraints, and is meant to be implemented in existing traffic systems with minimal changes. Experimental results show that the agent-based approach outperforms the traditional pre-timed and actuated modes when traffic is heavy.
{"title":"Agent-based decentralized traffic signal timing","authors":"Behnam Torabi, R. Wenkstern, Robert Saylor","doi":"10.1109/DISTRA.2017.8167675","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167675","url":null,"abstract":"In this paper we discuss a multi-agent cooperative approach for decentralized, coordinated traffic systems. Intersection controllers are equipped with agents, i.e., autonomous software systems which are capable of communicating and cooperating with one another to achieve an individual or global goal. Our approach is based on real-world traffic parameters and constraints, and is meant to be implemented in existing traffic systems with minimal changes. Experimental results show that the agent-based approach outperforms the traditional pre-timed and actuated modes when traffic is heavy.","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":"128824496","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.8167664
Mirko Stoffers, Ralf Bettermann, Klaus Wehrle
Simulations, and in particular large scale parameter studies, typically exhibit a considerable amount of redundancies. These redundancies can be avoided by memoization, a technique that stores and re-uses intermediate results. This requires a Memoization Unit (MU) to be identified first and then transformed. We have recently enabled the automation of the second step to also be applicable to impure computations, allowing it to become a valuable tool for the modeling and simulation domain. However, the first step still needs to be performed manually. Hence, the user needs to understand the model and the concept of memoization well enough to specify which computations to annotate for memoization. In this paper, we describe our approach to automatically identify memoization-worth computations. Input to this algorithm is an unmodified parameter study. After identifying the most promising memoization opportunities, we use the existing automated memoization tool to create a memoized parameter study, which can then be executed quickly. Our evaluation shows that our automated approach is able to identify those MUs that previously had to be annotated manually. This identification takes less than 2 minutes for a case study that without memoization takes several hours.
{"title":"Automated memoization: Automatically identifying memoization units in simulation parameter studies","authors":"Mirko Stoffers, Ralf Bettermann, Klaus Wehrle","doi":"10.1109/DISTRA.2017.8167664","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167664","url":null,"abstract":"Simulations, and in particular large scale parameter studies, typically exhibit a considerable amount of redundancies. These redundancies can be avoided by memoization, a technique that stores and re-uses intermediate results. This requires a Memoization Unit (MU) to be identified first and then transformed. We have recently enabled the automation of the second step to also be applicable to impure computations, allowing it to become a valuable tool for the modeling and simulation domain. However, the first step still needs to be performed manually. Hence, the user needs to understand the model and the concept of memoization well enough to specify which computations to annotate for memoization. In this paper, we describe our approach to automatically identify memoization-worth computations. Input to this algorithm is an unmodified parameter study. After identifying the most promising memoization opportunities, we use the existing automated memoization tool to create a memoized parameter study, which can then be executed quickly. Our evaluation shows that our automated approach is able to identify those MUs that previously had to be annotated manually. This identification takes less than 2 minutes for a case study that without memoization takes several hours.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"127 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":"132758057","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.8167681
M. Fujinami, Y. Mizukoshi
Vehicle-to-vehicle (V2V) communication technology based on Wi-Fi technology has recently been used to prevent vehicles from colliding with each other. However, in V2V communications, radio waves cannot be diffracted well enough at intersections at which vehicles cannot detect each other. Therefore, such technology might not prevent traffic accidents from occurring. In this study, we used mobile networks to exchange location information, such as longitude and latitude, every 100 msec and enable vehicles to use the information to predict the locations of surrounding vehicles of near future and avoid traffic accidents in any situation. However, the LTE network will become overloaded with radio resources, and data fees might become too expensive. Therefore, we have to reduce the amount of data packets to 2% and maintain location accuracy in the location-management servers at the same time. In this study, by using networked dead reckoning and our vehicle motion model, we developed a data reduction/compression and communication method to reduce the uploading frequency of location information from clients to servers in the LTE network and maintain the accuracy of location prediction at location-management severs.
{"title":"Study on performance of networked dead reckoning for real vehicles","authors":"M. Fujinami, Y. Mizukoshi","doi":"10.1109/DISTRA.2017.8167681","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167681","url":null,"abstract":"Vehicle-to-vehicle (V2V) communication technology based on Wi-Fi technology has recently been used to prevent vehicles from colliding with each other. However, in V2V communications, radio waves cannot be diffracted well enough at intersections at which vehicles cannot detect each other. Therefore, such technology might not prevent traffic accidents from occurring. In this study, we used mobile networks to exchange location information, such as longitude and latitude, every 100 msec and enable vehicles to use the information to predict the locations of surrounding vehicles of near future and avoid traffic accidents in any situation. However, the LTE network will become overloaded with radio resources, and data fees might become too expensive. Therefore, we have to reduce the amount of data packets to 2% and maintain location accuracy in the location-management servers at the same time. In this study, by using networked dead reckoning and our vehicle motion model, we developed a data reduction/compression and communication method to reduce the uploading frequency of location information from clients to servers in the LTE network and maintain the accuracy of location prediction at location-management severs.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"29 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":"132033186","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.8167670
Seifeddine Nsaibi, L. Leurs, H. Schotten
Time-Sensitive Networking (TSN) is becoming more important in automotive and industrial sectors. There is no clear strategy how to use TSN to improve and migrate the established real-time protocols without excluding legacy devices. This paper presents a realistic concept to integrate TSN into automation networks. We choose Sercos as a deterministic Industrial-Ethernet protocol to be extended with the TSN Standards IEEE 802.1AS-Rev and IEEE 802.1Qbv. By simulating the Sercos over TSN network, we investigate the impact of integrating a TSN-capable switch in a Sercos network to enable a topology extension from line/ring to star/tree. By comparing the impact of: increasing the data rate and topology extension, we demonstrate the improvement of Industrial-Ethernet timing performance.
{"title":"Formal and simulation-based timing analysis of Industrial-Ethernet sercos III over TSN","authors":"Seifeddine Nsaibi, L. Leurs, H. Schotten","doi":"10.1109/DISTRA.2017.8167670","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167670","url":null,"abstract":"Time-Sensitive Networking (TSN) is becoming more important in automotive and industrial sectors. There is no clear strategy how to use TSN to improve and migrate the established real-time protocols without excluding legacy devices. This paper presents a realistic concept to integrate TSN into automation networks. We choose Sercos as a deterministic Industrial-Ethernet protocol to be extended with the TSN Standards IEEE 802.1AS-Rev and IEEE 802.1Qbv. By simulating the Sercos over TSN network, we investigate the impact of integrating a TSN-capable switch in a Sercos network to enable a topology extension from line/ring to star/tree. By comparing the impact of: increasing the data rate and topology extension, we demonstrate the improvement of Industrial-Ethernet timing performance.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"18 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":"134323881","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.8167686
Tuur Benoit, S. Moten, Y. Lemmens
The paper presents recent technological advancements that have been made by Siemens PLM in its simulation tools for multi-body analyses and multi-physics simulation in order to run physics-based high fidelity models in real-time. The motivation is enable reuse of simulation models developed during the engineering phase during the validation phase with hardware or humans in the loop. To demonstrate these capabilities, two simulator have been developed. A short overview of these simulators is presented.
{"title":"Real-time physics-based simulation of mechanisms and systems","authors":"Tuur Benoit, S. Moten, Y. Lemmens","doi":"10.1109/DISTRA.2017.8167686","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167686","url":null,"abstract":"The paper presents recent technological advancements that have been made by Siemens PLM in its simulation tools for multi-body analyses and multi-physics simulation in order to run physics-based high fidelity models in real-time. The motivation is enable reuse of simulation models developed during the engineering phase during the validation phase with hardware or humans in the loop. To demonstrate these capabilities, two simulator have been developed. A short overview of these simulators is presented.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"28 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":"121233475","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.8167680
Abbas Siddiqui, H. Heinimann
Research on critical infrastructures (CI)s deals with sensitive data that demands underlying platform to be secure, in addition, testing of CI resilience strategies requires reproducibility of results. Disruption or natural disaster scenarios can not be tested on the physical systems, thus simulations are used for experimentation on CIs and as they are inherently distributed and interdependent which is why here, to model CIs, we use a distributed simulations standard namely High Level Architecture (HLA). The main goals of HLA are to provide interoperability and flexibility. Security and events logging are neither included nor emphasis of HLA standard. This paper presents a framework to have a supervised and secure messages exchange across distributed simulations using HLA standard.
{"title":"Framework for supervised and secure distributed simulations of critical infrastructures","authors":"Abbas Siddiqui, H. Heinimann","doi":"10.1109/DISTRA.2017.8167680","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167680","url":null,"abstract":"Research on critical infrastructures (CI)s deals with sensitive data that demands underlying platform to be secure, in addition, testing of CI resilience strategies requires reproducibility of results. Disruption or natural disaster scenarios can not be tested on the physical systems, thus simulations are used for experimentation on CIs and as they are inherently distributed and interdependent which is why here, to model CIs, we use a distributed simulations standard namely High Level Architecture (HLA). The main goals of HLA are to provide interoperability and flexibility. Security and events logging are neither included nor emphasis of HLA standard. This paper presents a framework to have a supervised and secure messages exchange across distributed simulations using HLA standard.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"50 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":"131993730","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.8167674
L. Yilmaz
Complex simulations are often explained in terms of their features. However, the disconnect between such high-level analysis features and their ad hoc realization in a simulation program impedes effectively conducting exploratory analysis across the structural and representational space of the problem domain. Motivated by the significant role that exploratory analysis plays in computational discovery across a broad range of domains from scientific problem solving to policy analysis, a feature-driven simulation modeling strategy is introduced. The strategy leverages the concept of activity, agent, and feature algebras, allowing flexible run-time as well as design-time composition of agent-based simulation programs in terms of features.
{"title":"FeatureSim: Feature-driven simulation for exploratory analysis with agent-based models","authors":"L. Yilmaz","doi":"10.1109/DISTRA.2017.8167674","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167674","url":null,"abstract":"Complex simulations are often explained in terms of their features. However, the disconnect between such high-level analysis features and their ad hoc realization in a simulation program impedes effectively conducting exploratory analysis across the structural and representational space of the problem domain. Motivated by the significant role that exploratory analysis plays in computational discovery across a broad range of domains from scientific problem solving to policy analysis, a feature-driven simulation modeling strategy is introduced. The strategy leverages the concept of activity, agent, and feature algebras, allowing flexible run-time as well as design-time composition of agent-based simulation programs in terms of features.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"11 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":"134436639","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.8167679
L. Donatiello, G. Marfia, Armir Bujari, C. Palazzi
In this paper we propose event goodput, i.e., the fraction of events which may be successfully managed by a system, as a relevant metric to describe the performance of battery powered real-time sensor networks. Unlike other performance metrics as response, completion, maximum lateness times, all representing fundamental, but different, figures of merit for the description of the behavior of real-time systems, event goodput provides an immediate and a direct relation with the events which may be satisfactorily managed (or not) by a real-time application. We will show such metric well serves the purpose of describing the performance of battery powered, random event-driven networks, such as sensor networks deployed for surveillance and intrusion detection applications, operating in time critical scenarios. In essence, such real-time systems may be assessed in terms of the fraction of events which they successfully/unsuccessfully detect and report within a time interval of interest. The importance of such metric is here demonstrated providing a simulation model and results where the use of the event goodput metric is discussed in conjunction with those metrics which are traditionally utilized for the assessment of a real-time sensor networks.
{"title":"A simulation model for event goodput estimation in real-time sensor networks","authors":"L. Donatiello, G. Marfia, Armir Bujari, C. Palazzi","doi":"10.1109/DISTRA.2017.8167679","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167679","url":null,"abstract":"In this paper we propose event goodput, i.e., the fraction of events which may be successfully managed by a system, as a relevant metric to describe the performance of battery powered real-time sensor networks. Unlike other performance metrics as response, completion, maximum lateness times, all representing fundamental, but different, figures of merit for the description of the behavior of real-time systems, event goodput provides an immediate and a direct relation with the events which may be satisfactorily managed (or not) by a real-time application. We will show such metric well serves the purpose of describing the performance of battery powered, random event-driven networks, such as sensor networks deployed for surveillance and intrusion detection applications, operating in time critical scenarios. In essence, such real-time systems may be assessed in terms of the fraction of events which they successfully/unsuccessfully detect and report within a time interval of interest. The importance of such metric is here demonstrated providing a simulation model and results where the use of the event goodput metric is discussed in conjunction with those metrics which are traditionally utilized for the assessment of a real-time sensor networks.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"218 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":"116288432","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-06DOI: 10.1109/DISTRA.2017.8167672
S. Ferretti, Gabriele D’angelo, V. Ghini, M. Marzolla
This paper presents a methodology for simulating the Internet of Things (IoT) using multi-level simulation models. With respect to conventional simulators, this approach allows us to tune the level of detail of different parts of the model without compromising the scalability of the simulation. As a use case, we have developed a two-level simulator to study the deployment of smart services over rural territories. The higher level is base on a coarse grained, agent-based adaptive parallel and distributed simulator. When needed, this simulator spawns OMNeT++ model instances to evaluate in more detail the issues concerned with wireless communications in restricted areas of the simulated world. The performance evaluation confirms the viability of multi-level simulations for IoT environments.
{"title":"The quest for scalability and accuracy: Multi-level simulation of the Internet of Things","authors":"S. Ferretti, Gabriele D’angelo, V. Ghini, M. Marzolla","doi":"10.1109/DISTRA.2017.8167672","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167672","url":null,"abstract":"This paper presents a methodology for simulating the Internet of Things (IoT) using multi-level simulation models. With respect to conventional simulators, this approach allows us to tune the level of detail of different parts of the model without compromising the scalability of the simulation. As a use case, we have developed a two-level simulator to study the deployment of smart services over rural territories. The higher level is base on a coarse grained, agent-based adaptive parallel and distributed simulator. When needed, this simulator spawns OMNeT++ model instances to evaluate in more detail the issues concerned with wireless communications in restricted areas of the simulated world. The performance evaluation confirms the viability of multi-level simulations for IoT environments.","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114165205","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}
Cloud computing is attracting an increased number of researches in delivering modeling and simulation abilities as a service. Among which, simulation execution as a service (EaaS) is a hot spot. It aims at releasing users from complex running configurations and meanwhile guaranteeing the QoS requirements. Under the motivation, focusing on EaaS for parallel and distributed simulation (PADS) application, the paper proposes a QoS-aware job scheduling framework in two-tier virtualization-based private cloud data center. In PADS EaaS, an adaptive job size adjustment component is designed to realize intelligent and adaptive job size setting for PADS instead of assigning by users. Furthermore, an adaptive deadline-aware job size adjustment algorithm, named ADaSA, is designed in the adjustment component to realize efficient job scheduling with high job responsiveness. ADaSA algorithm firstly computes a minimum processor requested that leads to maximum runtime stretch. It makes sure that more jobs can be scheduled at the same time while satisfying current job's deadline requirements. On other hand, ADaSA tries to pick up all possible idle CPU time in background virtual machines and reserved ones for other jobs. Through that way, more chances are generated to response more jobs in waiting queue. Finally, we conduct extensive experiments with trace-driven simulation. The results show that ADaSA outperforms both cloud-based job scheduling algorithm KCEASY and traditional EASY in terms of response time (up to 90%) and bounded slow down (up to 95%), and at the same time guarantees approximately equivalent deadline-missed rate. ADaSA also outperforms two representative moldable scheduling algorithms in terms of deadline-missed rate (up to 60%).
{"title":"QoS-aware parallel job scheduling framework for simulation execution as a service","authors":"Zhen Li, Bin Chen, Xiaocheng Liu, Dandan Ning, Wei Duan, X. Qiu, Chengda Xu","doi":"10.1109/DISTRA.2017.8167689","DOIUrl":"https://doi.org/10.1109/DISTRA.2017.8167689","url":null,"abstract":"Cloud computing is attracting an increased number of researches in delivering modeling and simulation abilities as a service. Among which, simulation execution as a service (EaaS) is a hot spot. It aims at releasing users from complex running configurations and meanwhile guaranteeing the QoS requirements. Under the motivation, focusing on EaaS for parallel and distributed simulation (PADS) application, the paper proposes a QoS-aware job scheduling framework in two-tier virtualization-based private cloud data center. In PADS EaaS, an adaptive job size adjustment component is designed to realize intelligent and adaptive job size setting for PADS instead of assigning by users. Furthermore, an adaptive deadline-aware job size adjustment algorithm, named ADaSA, is designed in the adjustment component to realize efficient job scheduling with high job responsiveness. ADaSA algorithm firstly computes a minimum processor requested that leads to maximum runtime stretch. It makes sure that more jobs can be scheduled at the same time while satisfying current job's deadline requirements. On other hand, ADaSA tries to pick up all possible idle CPU time in background virtual machines and reserved ones for other jobs. Through that way, more chances are generated to response more jobs in waiting queue. Finally, we conduct extensive experiments with trace-driven simulation. The results show that ADaSA outperforms both cloud-based job scheduling algorithm KCEASY and traditional EASY in terms of response time (up to 90%) and bounded slow down (up to 95%), and at the same time guarantees approximately equivalent deadline-missed rate. ADaSA also outperforms two representative moldable scheduling algorithms in terms of deadline-missed rate (up to 60%).","PeriodicalId":109971,"journal":{"name":"2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"313 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116538683","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
扫码关注我们
求助内容：
应助结果提醒方式：