发布求助
文献互助 智能选刊 最新文献

Proceedings of 1997 SCS Simulation Multiconference最新文献

筛选
英文 中文
A simulation framework for the analysis of multicast tree algorithms 一个分析组播树算法的仿真框架
Proceedings of 1997 SCS Simulation Multiconference Pub Date : 1997-04-07 DOI: 10.1109/SIMSYM.1997.586560
Tawfig Alrabiah, T. Znati
{"title":"A simulation framework for the analysis of multicast tree algorithms","authors":"Tawfig Alrabiah, T. Znati","doi":"10.1109/SIMSYM.1997.586560","DOIUrl":"https://doi.org/10.1109/SIMSYM.1997.586560","url":null,"abstract":"Group communications in high speed networks require the development of efficient multicast algorithms. Finding the optimal multicast routing tree for a subset of a network nodes is an NP-complete problem known as the Steiner Minimal Tree (SMT). Several heuristics were developed to provide an approximate solutions for this problem. The analysis of these heuristics, however, have been limited to specific network topologies. This paper discusses a flexible simulation framework to study the performance of multicasting algorithms in different topologies, including dense and sparse networks. The framework is then used to provide a detailed analysis of the performance of a selected set of path distance heuristics frequently discussed in the literature. The performance of these heuristics as then compared to two new heuristics, namely Normalized Average Distance Heuristic (NADH) and Shared Average Distance Heuristic (SADH). The results show that, on average, NADH outperforms all other heuristics in dense network topologies. The results also show that SADH out-performs the selected set of path distance heuristics for most network topologies.","PeriodicalId":176748,"journal":{"name":"Proceedings of 1997 SCS Simulation Multiconference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129252529","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
JSIM: A Java-based simulation and animation environment JSIM:一个基于java的仿真和动画环境
Proceedings of 1997 SCS Simulation Multiconference Pub Date : 1997-04-07 DOI: 10.1109/SIMSYM.1997.586473
J. Miller, R. Nair, Zhiwei Zhang, Hongwei Zhao
{"title":"JSIM: A Java-based simulation and animation environment","authors":"J. Miller, R. Nair, Zhiwei Zhang, Hongwei Zhao","doi":"10.1109/SIMSYM.1997.586473","DOIUrl":"https://doi.org/10.1109/SIMSYM.1997.586473","url":null,"abstract":"In this paper, we present JSIM, a Java-based simulation and animation environment being developed at the University of Georgia. The JSIM library includes many Java classes to make developing simulation models easy. A model is constructed by building a graph with nodes (e.g. Queues and ServerBays) and edges (e.g. Transports). A model of moderate complexity can be constructed with minimal effort. Furthermore, in a future release of JSIM, much of the code will be created by a graphical designer. Using the built-in features of JSIM, the design diagram may be animated when the simulation is run. A novel aspect of the environment is that it follows the principles of Query Driven Simulation for the purpose of storing and retrieving simulation models and results in databases.","PeriodicalId":176748,"journal":{"name":"Proceedings of 1997 SCS Simulation Multiconference","volume":"226 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122528125","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}
引用次数: 110
A study of dynamic traffic re-routing in the National Airspace System 国家空域系统中动态交通改道的研究
Proceedings of 1997 SCS Simulation Multiconference Pub Date : 1997-04-07 DOI: 10.1109/SIMSYM.1997.586499
D. Bushey, B. Malloy
{"title":"A study of dynamic traffic re-routing in the National Airspace System","authors":"D. Bushey, B. Malloy","doi":"10.1109/SIMSYM.1997.586499","DOIUrl":"https://doi.org/10.1109/SIMSYM.1997.586499","url":null,"abstract":"We exploit object technology to design a coarse grained model of an air traffic control system. Since aircraft delay is a critical variable in air traffic control, we consider two factors that contribute to delay: workload and capacity. Parameters to our model permit us to study workload by modifying takeoff frequencies at the airports under consideration. We study capacity by varying the frequency of arrivals and departures. Through modification of these parameters, the ripple effect of increased workload and reduced sector capacity on arrival and departure times is exposed. In both cases, we show that by dynamically rerouting traffic around problem sectors, we can reduce delays considerably; in some cases, dynamic rerouting reduced the number of delays by an order of magnitude. Incorporating the dynamic rerouting technique into our simulator required modifications to a single C++ class, showing that our object oriented model is easily modified and extended. However, a significant feature of our simulator is efficiency: we model a 24 hour period of air travel, including 50 airports with over 50,000 takeoffs, in a few minutes, obviating the need to parallelize our system.","PeriodicalId":176748,"journal":{"name":"Proceedings of 1997 SCS Simulation Multiconference","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134128953","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
ADVISE. Performance evaluation of parallel VHDL simulation 建议。并行VHDL仿真的性能评价
Proceedings of 1997 SCS Simulation Multiconference Pub Date : 1997-04-07 DOI: 10.1109/SIMSYM.1997.586510
Wilco Van Hoogstraeten, H. Corporaal
{"title":"ADVISE. Performance evaluation of parallel VHDL simulation","authors":"Wilco Van Hoogstraeten, H. Corporaal","doi":"10.1109/SIMSYM.1997.586510","DOIUrl":"https://doi.org/10.1109/SIMSYM.1997.586510","url":null,"abstract":"VHDL is one of the most important and widely used hardware description languages at this time. Applications written in VHDL are increasing in size and complexity, which prompts the use of parallel algorithms to obtain acceptable simulation performance. We have investigated the use of optimistic distributed algorithms with VHDL simulation. Optimistic simulation algorithms have been shown to deliver the highest performance of the currently available simulation strategies. It is however a difficult algorithm to implement, especially for VHDL which has all the characteristics of a high level programming language. With our simulation environment, ADVISE, we obtain speedups of around four for a medium-sized benchmark. The amount of speedup depends on the type of multiprocessor architecture used, partitioning algorithm, and optimizations. Further optimization of the simulation and partitioning algorithms within ADVISE, the use of more advanced compilation strategies, and larger benchmarks should lead to higher speedups, which makes it worthwhile to investigate this approach further.","PeriodicalId":176748,"journal":{"name":"Proceedings of 1997 SCS Simulation Multiconference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127467266","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
MC++: a parallel, portable, Monte Carlo neutron transport code in C++ 一个并行的，可移植的，蒙特卡罗中子输运的c++代码
Proceedings of 1997 SCS Simulation Multiconference Pub Date : 1997-04-07 DOI: 10.1109/SIMSYM.1997.586500
Stephen R. Lee, J. Cummings, S. Nolen
{"title":"MC++: a parallel, portable, Monte Carlo neutron transport code in C++","authors":"Stephen R. Lee, J. Cummings, S. Nolen","doi":"10.1109/SIMSYM.1997.586500","DOIUrl":"https://doi.org/10.1109/SIMSYM.1997.586500","url":null,"abstract":"MC++ is a multi group Monte Carlo neutron transport code written in C++ and based on the Parallel Object Oriented Methods and Applications (POOMA) class library. MC++ runs in parallel on and is portable to a wide variety of platforms, including MPPs, SMPs, clustered SMPs, and clusters of Unix workstations. MC++ is being developed to provide transport capabilities to the Accelerated Strategic Computing Initiative (ASCI). It is also intended to form the basis of the first transport physics framework (TPF), which is a C++ class library containing appropriate abstractions, objects, and methods for the particle transport problem. The transport problem is briefly described, as well as the current status and algorithms in MC++ for solving the transport equation. The alpha version of the POOMA class library is also discussed, along with the implementation of the transport solution algorithms using POOMA. Finally, some simple test problems are defined and performance and physics results on a variety of platforms are discussed.","PeriodicalId":176748,"journal":{"name":"Proceedings of 1997 SCS Simulation Multiconference","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126991024","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
A multiple domain environment for efficient simulation 高效仿真的多域环境
Proceedings of 1997 SCS Simulation Multiconference Pub Date : 1997-04-07 DOI: 10.1109/SIMSYM.1997.586490
K. Panetta, E. Manolakos, E. Czeck
{"title":"A multiple domain environment for efficient simulation","authors":"K. Panetta, E. Manolakos, E. Czeck","doi":"10.1109/SIMSYM.1997.586490","DOIUrl":"https://doi.org/10.1109/SIMSYM.1997.586490","url":null,"abstract":"The paper presents a concurrent simulation methodology for digital logic experimentation, which supports a multiple experiment environment for creating and maintaining scenarios of independent experiments without being exhaustive. It efficiently compresses multiple experiments in a single simulation and requires no pre-analysis of the circuit. In addition, scenarios can be created which allow experiments to interact with each other and spawn offspring experiments should new behaviors arise. The user initializes the simulation with independent experiments and the interactions are dynamically created if necessary. By utilizing the similarity among experiments, we gain efficiency in storage and CPU time without resorting to parallel hardware. Providing this capability in digital logic simulators, allows more test cases to be run in less time, provides the exact location and causes of every behavior and can be used to track the signature paths of test patterns for coverage analysis. We describe the multiple experiment algorithms, discuss the function list that makes dynamic interactions possible and report on its effectiveness for attacking an exhaustive simulation problem such as Multiple Stuck-at Fault simulations for digital logic. New directions for this type of testing methodology and applicability to other model types for creating experiment scenarios are also discussed based on our results.","PeriodicalId":176748,"journal":{"name":"Proceedings of 1997 SCS Simulation Multiconference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125684174","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
The acceleration of VHDL simulation by classifying events 基于事件分类的VHDL仿真加速
Proceedings of 1997 SCS Simulation Multiconference Pub Date : 1997-04-07 DOI: 10.1109/SIMSYM.1997.586539
Kwang-Il Park, Jun Sung Kim, Heung Bum Kim, Jong Hyuk Choi, Kyungmin Park
{"title":"The acceleration of VHDL simulation by classifying events","authors":"Kwang-Il Park, Jun Sung Kim, Heung Bum Kim, Jong Hyuk Choi, Kyungmin Park","doi":"10.1109/SIMSYM.1997.586539","DOIUrl":"https://doi.org/10.1109/SIMSYM.1997.586539","url":null,"abstract":"The performance and efficiency of event-driven simulations, such as VHDL and Verilog simulation, depend on the number of events that occur during the simulation. In this paper, we classify events into two categories, sensitive events and insensitive events, according to the necessity of simulations, and implement the optimization methodology that eliminates unnecessary simulations caused by the insensitive events. Five experiments show that optimized VHDL programs run much faster than the original ones.","PeriodicalId":176748,"journal":{"name":"Proceedings of 1997 SCS Simulation Multiconference","volume":"323 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115909724","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
A simulation environment for core based embedded systems 基于核心的嵌入式系统仿真环境
Proceedings of 1997 SCS Simulation Multiconference Pub Date : 1997-04-07 DOI: 10.1109/SIMSYM.1997.586495
F. Pétrot, Denis Hommais, A. Greiner
{"title":"A simulation environment for core based embedded systems","authors":"F. Pétrot, Denis Hommais, A. Greiner","doi":"10.1109/SIMSYM.1997.586495","DOIUrl":"https://doi.org/10.1109/SIMSYM.1997.586495","url":null,"abstract":"As integration of a whole system on a chip becomes possible, the need for fast and precise simulation tools increases. We present a high speed cycle precise simulation environment dedicated to core based embedded systems. We show that for the type of systems we aim at simulating, a correct simulation is obtained without event propagation. This restricted set of systems is suitable for embedded core based ASICs, and can be simulated at very high speed, since a single evaluation is necessary per cycle. For a sample system including a MIPS around a PI-Bus, simulation rates of 120,000 cycles per second are achieved on a SS10/51.","PeriodicalId":176748,"journal":{"name":"Proceedings of 1997 SCS Simulation Multiconference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117092837","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}
引用次数: 14
A new role of graphical simulation: Software testing 图形模拟的新角色:软件测试
Proceedings of 1997 SCS Simulation Multiconference Pub Date : 1997-04-07 DOI: 10.1109/SIMSYM.1997.586576
Ju-Yeon Jo, Yoohwan Kim, S. Ameduri, Andy Podgurski
{"title":"A new role of graphical simulation: Software testing","authors":"Ju-Yeon Jo, Yoohwan Kim, S. Ameduri, Andy Podgurski","doi":"10.1109/SIMSYM.1997.586576","DOIUrl":"https://doi.org/10.1109/SIMSYM.1997.586576","url":null,"abstract":"Simulation is an effective technique to test software where testing in the real environment is not feasible. A 3D graphical simulator can make the software testing process much more effective and efficient. With graphical representation, the software's behavior can be observed in a virtual environment similar to the real environment. This kind of simulator can be best used in testing embedded system software, specifically in systems with many moving objects. Typically, however, the creation of a simulator is expensive in terms of time and cost. In addition, it is difficult to verify the accuracy of the system. We propose an inexpensive 3D graphical simulation method for software testing of embedded systems. This system eliminates the need for mathematical modeling by modeling the physical objects with simple rules. These objects self-coordinate their operation through the application of these rules. The 3D graphical simulator integrates the entire modeling process, eliminating the need for separate simulation and graphical display units. The simulator provides instant graphical feedback of system behavior to illustrate the feasibility and reliability of the system.","PeriodicalId":176748,"journal":{"name":"Proceedings of 1997 SCS Simulation Multiconference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117236241","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}
引用次数: 3
Two nondeterministic event building methods derived from the Barrel Shifter 从桶式移位器派生的两种不确定事件构建方法
Proceedings of 1997 SCS Simulation Multiconference Pub Date : 1997-04-07 DOI: 10.1109/SIMSYM.1997.586506
G. Harangozó
{"title":"Two nondeterministic event building methods derived from the Barrel Shifter","authors":"G. Harangozó","doi":"10.1109/SIMSYM.1997.586506","DOIUrl":"https://doi.org/10.1109/SIMSYM.1997.586506","url":null,"abstract":"In high energy physics experiments, extensive parallelism allows scalable, high bandwidth data acquisition systems. Online event building of physical events is only feasible by using switch based event builders. The Barrel Shifter is a well known event building method for switch based event builders. Two nondeterministic versions of the Barrel Shifter introduced in the paper provide cost effective alternatives to the Barrel Shifter. Simulation results are presented to show the source buffer requirements of both nondeterministic methods and the Barrel Shifter at different types of detector dataflow.","PeriodicalId":176748,"journal":{"name":"Proceedings of 1997 SCS Simulation Multiconference","volume":"77 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123226125","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}
引用次数: 4
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信