This paper presents a problem solving environment (PSE) for the grid-enabled execution of Monte Carlo simulations. Our main concern during the design and development of the PSE was to hide the complexity of using the grid infrastructure from the actual users and simplify the way users run their application on grid resources. In order to assist non grid-expert users to execute their simulations on the grid, we have implemented transparent mechanisms that automatically create the appropriate scripts and components required for grid execution by taking as input plain Matlab files. The PSE sets up a temporary distributed Matlab environment on grid resources by using the Matlab compiler and allows the concurrent execution of standard Matlab code. The PSE has been used for several wideband code division multiple access (WCDMA) system simulation scenarios in the production grid provided by the EGEE infrastructure. Simulation results regarding performance of the PSE are presented.
{"title":"A Grid Enabled Problem Solving Environment for Monte Carlo Matlab Simulations","authors":"T. Athanaileas, G. Tsoulos, Dimitra I. Kaklamani","doi":"10.1109/DS-RT.2007.8","DOIUrl":"https://doi.org/10.1109/DS-RT.2007.8","url":null,"abstract":"This paper presents a problem solving environment (PSE) for the grid-enabled execution of Monte Carlo simulations. Our main concern during the design and development of the PSE was to hide the complexity of using the grid infrastructure from the actual users and simplify the way users run their application on grid resources. In order to assist non grid-expert users to execute their simulations on the grid, we have implemented transparent mechanisms that automatically create the appropriate scripts and components required for grid execution by taking as input plain Matlab files. The PSE sets up a temporary distributed Matlab environment on grid resources by using the Matlab compiler and allows the concurrent execution of standard Matlab code. The PSE has been used for several wideband code division multiple access (WCDMA) system simulation scenarios in the production grid provided by the EGEE infrastructure. Simulation results regarding performance of the PSE are presented.","PeriodicalId":266467,"journal":{"name":"11th IEEE International Symposium on Distributed Simulation and Real-Time Applications (DS-RT'07)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130189414","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}
Simultaneous events are a fundamental challenge in distributed discrete-event simulation: Different execution orders may lead to different simulation results. Commonly, simultaneous events are handled by tie-breaking rules in order to guarantee reproducibility. A second approach, however, is examining different execution orders with a branching mechanism. By analyzing the effects of simultaneous events, confidence in simulation results may be increased. Naturally, branching may get expensive with large numbers of simultaneous events. Thus, efficiency is crucial for branching in order to be a practical method. In this paper, we present an efficient branching mechanism for simultaneous events in distributed simulation, which may be used in conjunction with, or as an alternative to tie-breaking rules. We apply techniques which optimize the detection of simultaneous events and reduce the number of branches as much as possible. Furthermore, we use cloning to share computations among different branches.
{"title":"Efficient Analysis of Simultaneous Events in Distributed Simulation","authors":"Patrick Peschlow, P. Martini","doi":"10.1109/DS-RT.2007.24","DOIUrl":"https://doi.org/10.1109/DS-RT.2007.24","url":null,"abstract":"Simultaneous events are a fundamental challenge in distributed discrete-event simulation: Different execution orders may lead to different simulation results. Commonly, simultaneous events are handled by tie-breaking rules in order to guarantee reproducibility. A second approach, however, is examining different execution orders with a branching mechanism. By analyzing the effects of simultaneous events, confidence in simulation results may be increased. Naturally, branching may get expensive with large numbers of simultaneous events. Thus, efficiency is crucial for branching in order to be a practical method. In this paper, we present an efficient branching mechanism for simultaneous events in distributed simulation, which may be used in conjunction with, or as an alternative to tie-breaking rules. We apply techniques which optimize the detection of simultaneous events and reduce the number of branches as much as possible. Furthermore, we use cloning to share computations among different branches.","PeriodicalId":266467,"journal":{"name":"11th IEEE International Symposium on Distributed Simulation and Real-Time Applications (DS-RT'07)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124389289","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}
Several approaches for scalable interest management (IM) within real-time distributed virtual environments (DVEs) have been proposed based upon some division of the data-space in to disjoint volumes or cells. Responsibility for the entire space can then be distributed. Any such approach, however, must implement some mechanism for propagating the query and update messages around the distributed system. The efficiency of this process can greatly effect the scalability of such systems. In this paper we evaluate an adaptive approach to this problem, designed for use in cell-based systems in general.
{"title":"An Evaluation of Push-Pull Algorithms in Support of Cell-Based Interest Management","authors":"Rob Minson, G. Theodoropoulos","doi":"10.1109/DS-RT.2007.13","DOIUrl":"https://doi.org/10.1109/DS-RT.2007.13","url":null,"abstract":"Several approaches for scalable interest management (IM) within real-time distributed virtual environments (DVEs) have been proposed based upon some division of the data-space in to disjoint volumes or cells. Responsibility for the entire space can then be distributed. Any such approach, however, must implement some mechanism for propagating the query and update messages around the distributed system. The efficiency of this process can greatly effect the scalability of such systems. In this paper we evaluate an adaptive approach to this problem, designed for use in cell-based systems in general.","PeriodicalId":266467,"journal":{"name":"11th IEEE International Symposium on Distributed Simulation and Real-Time Applications (DS-RT'07)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130522748","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}
In this paper, we present WiFra, a new framework for the detailed simulation of very large-scale wireless networks. WiFra is based on the parallel and distributed simulation approach and provides high scalability in terms of size of simulated networks and number of execution units running the simulation. In order to improve the performance of distributed simulation, additional techniques are proposed. Their aim is to reduce the communication overhead and to maintain a good level of load-balancing. Simulation architectures composed of low-cost Commercial-Off-The-Shelf (COTS) hardware are specifically supported by WiFra. The framework dynamically reconfigures the simulation, taking care of the performance of each part of the execution architecture and dealing with unpredictable fluctuations of the available computation power and communication load on the single execution units. A fine-grained model of the 802.11 DCF protocol has been used for the performance evaluation of the proposed framework. The results demonstrate that the distributed approach is suitable for the detailed simulation of very-large scale wireless networks.
{"title":"Detailed Simulation of Large-Scale Wireless Networks","authors":"Michele Bracuto, Gabriele D’angelo","doi":"10.1109/DS-RT.2007.19","DOIUrl":"https://doi.org/10.1109/DS-RT.2007.19","url":null,"abstract":"In this paper, we present WiFra, a new framework for the detailed simulation of very large-scale wireless networks. WiFra is based on the parallel and distributed simulation approach and provides high scalability in terms of size of simulated networks and number of execution units running the simulation. In order to improve the performance of distributed simulation, additional techniques are proposed. Their aim is to reduce the communication overhead and to maintain a good level of load-balancing. Simulation architectures composed of low-cost Commercial-Off-The-Shelf (COTS) hardware are specifically supported by WiFra. The framework dynamically reconfigures the simulation, taking care of the performance of each part of the execution architecture and dealing with unpredictable fluctuations of the available computation power and communication load on the single execution units. A fine-grained model of the 802.11 DCF protocol has been used for the performance evaluation of the proposed framework. The results demonstrate that the distributed approach is suitable for the detailed simulation of very-large scale wireless networks.","PeriodicalId":266467,"journal":{"name":"11th IEEE International Symposium on Distributed Simulation and Real-Time Applications (DS-RT'07)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132097160","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}
This paper presents Construct3D, an application for geometry educationthat has been developed at the VR group at Vienna University of Technology throughout the past 6 years. Specific design aspects to allow distributed collaboration in Construct3D are presented. This concerns improvements of the user interface, usability and system performance including bandwidth efficiency.
{"title":"Distributed Virtual Reality in Education","authors":"H. Kaufmann","doi":"10.1109/DS-RT.2007.22","DOIUrl":"https://doi.org/10.1109/DS-RT.2007.22","url":null,"abstract":"This paper presents Construct3D, an application for geometry educationthat has been developed at the VR group at Vienna University of Technology throughout the past 6 years. Specific design aspects to allow distributed collaboration in Construct3D are presented. This concerns improvements of the user interface, usability and system performance including bandwidth efficiency.","PeriodicalId":266467,"journal":{"name":"11th IEEE International Symposium on Distributed Simulation and Real-Time Applications (DS-RT'07)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114566785","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}
K. Demestichas, Evgenia F. Adamopoulou, M. Theologou, C. Desiniotis, J. Markoulidakis
The present paper introduces the innovative concept of a new type of services, called ambient community services (ACS). The ACS concept utilizes information that resides in communities of mobile terminals, such as location, speed, sensor-related data or user-created multimedia content. After the collection, processing and filtering of these data, a number of innovative, heterogeneous value-added applications can be provided to the end-users, such as the provision of vehicular traffic conditions. ACS advances the social networking by allowing users to form cooperative, service-enabling communities. This paper includes a thorough description of the state-of- the-art, the proposed system architecture and communication flow, potential enabled applications, important implementation aspects, as well as future research activities.
{"title":"Towards Ambient Community Services","authors":"K. Demestichas, Evgenia F. Adamopoulou, M. Theologou, C. Desiniotis, J. Markoulidakis","doi":"10.1109/DS-RT.2007.43","DOIUrl":"https://doi.org/10.1109/DS-RT.2007.43","url":null,"abstract":"The present paper introduces the innovative concept of a new type of services, called ambient community services (ACS). The ACS concept utilizes information that resides in communities of mobile terminals, such as location, speed, sensor-related data or user-created multimedia content. After the collection, processing and filtering of these data, a number of innovative, heterogeneous value-added applications can be provided to the end-users, such as the provision of vehicular traffic conditions. ACS advances the social networking by allowing users to form cooperative, service-enabling communities. This paper includes a thorough description of the state-of- the-art, the proposed system architecture and communication flow, potential enabled applications, important implementation aspects, as well as future research activities.","PeriodicalId":266467,"journal":{"name":"11th IEEE International Symposium on Distributed Simulation and Real-Time Applications (DS-RT'07)","volume":"365 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124586626","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}
Jorge L. V. Barbosa, Rodrigo Hahn, Daniele Bonatto, Fábio Reis Cecin, C. Geyer
The ubiquitous computing scenario brings many new problems such as coping with the limited processing power of mobile devices, frequent disconnections, the migration of code and tasks between heterogeneous devices, and others. Current practical approaches to the ubiquitous computing problem usually rely upon traditional computing paradigms conceived back when distributed applications where not a concern. In this paper we propose UbiHolo, a new end-to-end model oriented to development and execution of applications over large- scale ubiquitous computing systems. UbiHolo is based on the Holoparadigm (in short, Holo), a new software paradigm oriented to the development of distributed computer systems. After that we show that UbiHolo is scalable, and that it is possible to create and manage execution of applications over large-scale ubiquitous environments without a great impact on application 's user response tunes. Our results are obtained through a simulation of a Holo system with up to 950 nodes, which was implemented over the p2psim simulator.
{"title":"Evaluation of a Large-Scale Ubiquitous System Model through Peer-to-Peer Protocol Simulation","authors":"Jorge L. V. Barbosa, Rodrigo Hahn, Daniele Bonatto, Fábio Reis Cecin, C. Geyer","doi":"10.1109/DS-RT.2007.26","DOIUrl":"https://doi.org/10.1109/DS-RT.2007.26","url":null,"abstract":"The ubiquitous computing scenario brings many new problems such as coping with the limited processing power of mobile devices, frequent disconnections, the migration of code and tasks between heterogeneous devices, and others. Current practical approaches to the ubiquitous computing problem usually rely upon traditional computing paradigms conceived back when distributed applications where not a concern. In this paper we propose UbiHolo, a new end-to-end model oriented to development and execution of applications over large- scale ubiquitous computing systems. UbiHolo is based on the Holoparadigm (in short, Holo), a new software paradigm oriented to the development of distributed computer systems. After that we show that UbiHolo is scalable, and that it is possible to create and manage execution of applications over large-scale ubiquitous environments without a great impact on application 's user response tunes. Our results are obtained through a simulation of a Holo system with up to 950 nodes, which was implemented over the p2psim simulator.","PeriodicalId":266467,"journal":{"name":"11th IEEE International Symposium on Distributed Simulation and Real-Time Applications (DS-RT'07)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127709423","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}
In this paper we introduce distributed multiagent simulation and recall some solutions based on HLA protocol. We make a short presentation of peer-to- peer systems. We highlight the architecture of a distributed multiagent system based on a peer-to-peer model. We present some preliminary experimental results to show the performance of this architecture running a distributed version of ants model. We compare this implementation with a non-distributed ants version and with a distributed version on Client/Server architecture.
{"title":"Distributed Multiagent Simulation on P2P Architecture","authors":"A. Cabani, M. Itmi, J. Pécuchet","doi":"10.1109/DS-RT.2007.21","DOIUrl":"https://doi.org/10.1109/DS-RT.2007.21","url":null,"abstract":"In this paper we introduce distributed multiagent simulation and recall some solutions based on HLA protocol. We make a short presentation of peer-to- peer systems. We highlight the architecture of a distributed multiagent system based on a peer-to-peer model. We present some preliminary experimental results to show the performance of this architecture running a distributed version of ants model. We compare this implementation with a non-distributed ants version and with a distributed version on Client/Server architecture.","PeriodicalId":266467,"journal":{"name":"11th IEEE International Symposium on Distributed Simulation and Real-Time Applications (DS-RT'07)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121876087","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
扫码关注我们
求助内容：
应助结果提醒方式：