36th Annual Simulation Symposium, 2003.最新文献

筛选
英文 中文
An ns-based Bluetooth topology construction simulation environment 基于nss的蓝牙拓扑构建仿真环境
36th Annual Simulation Symposium, 2003. Pub Date : 2003-03-30 DOI: 10.1109/SIMSYM.2003.1192808
Chia-Jui Hsu, Yuh-Jzer Joung
{"title":"An ns-based Bluetooth topology construction simulation environment","authors":"Chia-Jui Hsu, Yuh-Jzer Joung","doi":"10.1109/SIMSYM.2003.1192808","DOIUrl":"https://doi.org/10.1109/SIMSYM.2003.1192808","url":null,"abstract":"Bluetooth is an emerging technology in wireless applications, and many related issues are yet to be explored both in academia and industry. Because of the complexity and the dynamics of computer networks, a good simulation tool plays an important role in the development stage. Of the existing simulation tools, ns is a popular open-source package that has a substantial support for simulation of TCP routing, and multicast protocols over wired and wireless networks. It also has BlueHoc as its extension for Bluetooth. Although BlueHoc offers many simulation functions for Bluetooth, all simulations must be done in a virtually fixed topology. Hence simulation about dynamic topology construction-the first and an important step in establishing a Bluetooth network-cannot be conducted. Besides, BlueHoc offers only a limited support for building a network. It also lacks flexibility in device control, in animated presentation, and in modeling mobility. The main contribution of the paper is therefore to enhance BlueHoc to support the aforementioned functions.","PeriodicalId":187135,"journal":{"name":"36th Annual Simulation Symposium, 2003.","volume":"470 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116413463","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}
引用次数: 12
Parallelizing black oil reservoir simulation systems for SMP machines SMP机黑油藏并行模拟系统
36th Annual Simulation Symposium, 2003. Pub Date : 2003-03-30 DOI: 10.1109/SIMSYM.2003.1192817
Fabrício A. B. Silva, E. P. Lopes, E. Aude, Flavio S. Mendes, H. Serdeira, Julio T. C. Silveira
{"title":"Parallelizing black oil reservoir simulation systems for SMP machines","authors":"Fabrício A. B. Silva, E. P. Lopes, E. Aude, Flavio S. Mendes, H. Serdeira, Julio T. C. Silveira","doi":"10.1109/SIMSYM.2003.1192817","DOIUrl":"https://doi.org/10.1109/SIMSYM.2003.1192817","url":null,"abstract":"We discuss the parallelization for SMP machines of black oil reservoir simulation programs. A reservoir simulator is a sophisticated computer program used to predict the future performance of a reservoir based on its current state and past performance. SMP architectures are composed of homogeneous microprocessors sharing access to the main memory. Due to advancements in microprocessor technology and the shared memory access, the best parallelization strategy for SMP (symmetric multiprocessing) machines may differ significantly from strategies used previously in MPP machines. We present a parallel implementation optimized for SMP machines of BOAST a three-phase, three-dimensional black oil simulator. The communication library used was LAM-MPI. We used the domain decomposition technique to parallelize the two more computing-intensive subprograms (routines) of BOAST which take about 80% of the total execution time of a typical simulation in a SMP machine. The speed-up obtained show that the chosen parallelization strategy has good load balancing and low communication overhead, achieving near-optimal performance in several simulations.","PeriodicalId":187135,"journal":{"name":"36th Annual Simulation Symposium, 2003.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129885690","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}
引用次数: 5
Simulating highly dependable applications in a distributed computing environment 在分布式计算环境中模拟高度可靠的应用程序
36th Annual Simulation Symposium, 2003. Pub Date : 2003-03-30 DOI: 10.1109/SIMSYM.2003.1192803
Yinong Chen, Zhongshi He
{"title":"Simulating highly dependable applications in a distributed computing environment","authors":"Yinong Chen, Zhongshi He","doi":"10.1109/SIMSYM.2003.1192803","DOIUrl":"https://doi.org/10.1109/SIMSYM.2003.1192803","url":null,"abstract":"The aims of the research are to investigate techniques that support the development of highly dependable applications in a distributed system environment. Techniques we developed include redundant task allocation, load balancing, fault-tolerant computing and communication. The application we have implemented in the system is a firewall application. The firewall runs in redundant mode. Each incoming or outgoing packet is checked by two or more copies of the firewall application. Only when the majority of the firewall copies decide to accept the packet, the packet can go through the firewall. Different decisions from the different firewall copies signify a possible hardware fault or a software error in the underlying system. This paper reports a recent implementation of a simulation system, in which computing nodes, redundant copies of tasks and packet queues are implemented as independent threads, as well as experimental result we obtained based on queuing models.","PeriodicalId":187135,"journal":{"name":"36th Annual Simulation Symposium, 2003.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129239054","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}
引用次数: 2
Modeling as craft 作为工艺的建模
36th Annual Simulation Symposium, 2003. Pub Date : 2003-03-30 DOI: 10.1109/SIMSYM.2003.1192792
P. Fishwick
{"title":"Modeling as craft","authors":"P. Fishwick","doi":"10.1109/SIMSYM.2003.1192792","DOIUrl":"https://doi.org/10.1109/SIMSYM.2003.1192792","url":null,"abstract":"Toy boats, automobiles, and planesare models that entertain and delight us inchildhood. As we grow, we might availourselves of more advanced models that aretruer to life--more real and engaging.Interactive computer games provide evengreater flexibility, while lacking in tactilefeedback and the sort of physical immersionwe expect from every day experience. Modelsthat are used in simulation for buildingsoftware and dynamic systems can be equallyas immersive, with a variety of aestheticfeatures. For example, a factory floor modelcan achieve high degrees of realism using 2Dand 3D visualization.The factory floor, like the model plane, isiconic in representation. It is a scale model.But what of the more mathematical models,including software? The structures in thesemodels, unlike with the iconic nature of scalemodeling, employ symbolic relations whereone object refers to another withoutnecessarily resembling it. We discuss aresearch project, with examples, to show thatone can retain the abstraction and rigorexpected from mathematical structure, whilesimultaneously achieving the benefits of thesort of aesthetics, styles, and engagement thatwe experience with physical models andcomputer games.","PeriodicalId":187135,"journal":{"name":"36th Annual Simulation Symposium, 2003.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126560837","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}
引用次数: 0
Approximate connectivity graph generation in mobile ad hoc radio networks 移动自组织无线网络中近似连接图的生成
36th Annual Simulation Symposium, 2003. Pub Date : 2003-03-30 DOI: 10.1109/SIMSYM.2003.1192801
C. Barrett, M. Marathe, D. C. Engelhart, A. Sivasubramaniam
{"title":"Approximate connectivity graph generation in mobile ad hoc radio networks","authors":"C. Barrett, M. Marathe, D. C. Engelhart, A. Sivasubramaniam","doi":"10.1109/SIMSYM.2003.1192801","DOIUrl":"https://doi.org/10.1109/SIMSYM.2003.1192801","url":null,"abstract":"Simulation is a widely used technique in the design and evaluation of mobile ad-hoc networks. However time and space constraints can often limit the extent of the size, complexity and detail of the networks that can be simulated. Approximations in the system model can possibly alleviate this problem, but we need to be careful about how much accuracy is compromised when employing them. This paper specifically focuses on one aspect of simulation cost that is incurred in the computation of the connectivity graph that is used to describe what mobile nodes can communicate with whom. Since such a graph is recomputed frequently during the simulation, we explore alternatives to computing this graph exactly and their accuracy in capturing the actual graph properties. We investigate three approximation alternatives to compute graph connectivity, and propose metrics for expressing their deviations from the actual graph. In addition, the graphs generated by these approximations are compared to the original by examining two previously proposed graph measures - the degree and clustering coefficient distributions. Results indicate that these approximations can be quite effective in avoiding repeated calculation of exact graph connectivity.","PeriodicalId":187135,"journal":{"name":"36th Annual Simulation Symposium, 2003.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129981633","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}
引用次数: 6
Enhancing multimedia caching algorithm performance through new interval definition strategies 通过新的间隔定义策略提高多媒体缓存算法的性能
36th Annual Simulation Symposium, 2003. Pub Date : 2003-03-30 DOI: 10.1109/SIMSYM.2003.1192811
Javier Fernández, J. Carretero, Félix García, J. M. Pérez, A. Calderón
{"title":"Enhancing multimedia caching algorithm performance through new interval definition strategies","authors":"Javier Fernández, J. Carretero, Félix García, J. M. Pérez, A. Calderón","doi":"10.1109/SIMSYM.2003.1192811","DOIUrl":"https://doi.org/10.1109/SIMSYM.2003.1192811","url":null,"abstract":"Nowadays, multimedia systems are evolving towards integrated storage platforms that meet the requirements of deterministic applications, multimedia systems, and traditional best-effort applications altogether These systems must incorporate a disk scheduling mechanism and a cache architecture that can handle the requirements of each kind of request while showing a good overall performance. In this paper a new interval caching strategy is proposed that includes several optimizations to the state of the art. This algorithm has been designed to become part of MUPIC (multipolicy integrated cache), a cache architecture designed to fit the requirements of an integrated storage system. This paper presents the mathematical enunciation that led us to deploy new interval caching strategies and an evaluation of the algorithm proposed using a simulation program that compares it with other algorithms described in the bibliography. As shown in the conclusions MUPIC behaves the same or better in all the situations while providing admission control.","PeriodicalId":187135,"journal":{"name":"36th Annual Simulation Symposium, 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130251678","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}
引用次数: 6
An efficient scheme for chaining with client-centric buffer reservation for multi-media streaming 为多媒体流提供了一种以客户端为中心的缓冲区保留链接的有效方案
36th Annual Simulation Symposium, 2003. Pub Date : 2003-03-30 DOI: 10.1109/SIMSYM.2003.1192795
Joel Jeffrey Schultz, T. Znati
{"title":"An efficient scheme for chaining with client-centric buffer reservation for multi-media streaming","authors":"Joel Jeffrey Schultz, T. Znati","doi":"10.1109/SIMSYM.2003.1192795","DOIUrl":"https://doi.org/10.1109/SIMSYM.2003.1192795","url":null,"abstract":"This paper proposes a \"chaining\" based media content delivery algorithm which supports \"VCR operations\". The proposed algorithm explicitly balances the client-side requirements to support the VCR functionalities, while preserving the advantages of using the client playback device as a proxy video server, as specified in the original chaining algorithm. The paper also investigates the effect of supporting VCR operations on the performance of the proposed scheme and the impact these operations have on chaining. To this end, a study to assess the performance of the proposed algorithm, within this framework, is conducted. The results show that, for a small community of clients, increasing user activity, in terms of VCR operations performed during stream delivery, have detrimental effects on primary bandwidth reduction. Furthermore, the results show that a limited subset of VCR operations appears to boost the effectiveness of chaining. Introducing a full range of VCR functionalities, however, lead to a decrease in the amount of primary server bandwidth reduction, thereby indicating an apparent interplay between the number of clients viewing a video and the range of VCR operations supported.","PeriodicalId":187135,"journal":{"name":"36th Annual Simulation Symposium, 2003.","volume":"68 1-2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114131620","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}
引用次数: 7
A supernet: engineering traffic across network boundaries 超级网络:跨网络边界的工程流量
36th Annual Simulation Symposium, 2003. Pub Date : 2003-03-30 DOI: 10.1109/SIMSYM.2003.1192805
S. Lincke, C. Hood
{"title":"A supernet: engineering traffic across network boundaries","authors":"S. Lincke, C. Hood","doi":"10.1109/SIMSYM.2003.1192805","DOIUrl":"https://doi.org/10.1109/SIMSYM.2003.1192805","url":null,"abstract":"Fourth generation networks lead to multiple distributed wireless networks, including cellular networks of different generations, frequencies and cell sizes; wireless LAN and PAN networks, and potentially satellite and other networks. Distributed operating systems has shown that distributing jobs across systems can lead to increased throughput, performance, modularity, survivability, and accessibility. Existing studies on hierarchical networks, integrated networks, and dual mode studies show how higher efficiency can be achieved by engineering traffic across networks. This study defines techniques that can be used to engineer traffic across networks, and reviews existing results for each method.","PeriodicalId":187135,"journal":{"name":"36th Annual Simulation Symposium, 2003.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114225815","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}
引用次数: 1
Efficient microprocessor design space exploration through statistical simulation 高效微处理器设计通过统计仿真探索空间
36th Annual Simulation Symposium, 2003. Pub Date : 2003-03-30 DOI: 10.1109/SIMSYM.2003.1192818
L. Eeckhout, D. Stroobandt, K. D. Bosschere
{"title":"Efficient microprocessor design space exploration through statistical simulation","authors":"L. Eeckhout, D. Stroobandt, K. D. Bosschere","doi":"10.1109/SIMSYM.2003.1192818","DOIUrl":"https://doi.org/10.1109/SIMSYM.2003.1192818","url":null,"abstract":"To cope with the widening design gap, the ever increasing impact of technology, reflected in increased interconnect delay and power consumption, and the time-consuming simulations needed to define the architecture of a microprocessor, computer engineers need techniques to explore the design space efficiently in an early design stage. These techniques should be able to identify a region of interest with desirable characteristics in terms performance, power consumption and cycle time. In addition, they should be fast since the design space is huge and the design time is limited. We demonstrate that statistical simulation is an early design stage technique capable of making viable microprocessor design decisions efficiently in early stages of the design flow while considering performance, power consumption and cycle time.","PeriodicalId":187135,"journal":{"name":"36th Annual Simulation Symposium, 2003.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131217857","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}
引用次数: 6
Implementing parallel Cell-DEVS 实现并行Cell-DEVS
36th Annual Simulation Symposium, 2003. Pub Date : 2003-03-30 DOI: 10.1109/SIMSYM.2003.1192823
Alejandro J. Troccoli, Gabriel A. Wainer
{"title":"Implementing parallel Cell-DEVS","authors":"Alejandro J. Troccoli, Gabriel A. Wainer","doi":"10.1109/SIMSYM.2003.1192823","DOIUrl":"https://doi.org/10.1109/SIMSYM.2003.1192823","url":null,"abstract":"Cell-DEVS is a formalism intended to model complex physical systems as cell spaces. Cell-DEVS allows to describe cellular models using timing delay constructions, allowing a simple definition of complex timing. The original specifications were extended to permit parallel specification of these models, and an associated simulation mechanism allows their execution. We present implementation issues related to the definition of parallel simulators for Cell-DEVS.","PeriodicalId":187135,"journal":{"name":"36th Annual Simulation Symposium, 2003.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131664088","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}
引用次数: 54
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书