{"title":"Modelling SAMIPS: a synthesisable asynchronous MIPS processor","authors":"Qianyi Zhang, G. Theodoropoulos","doi":"10.1109/SIMSYM.2004.1299484","DOIUrl":"https://doi.org/10.1109/SIMSYM.2004.1299484","url":null,"abstract":"The last fifteen years have witnessed a resurgence of interest in asynchronous digital design techniques as they promise to liberate VLSI systems from clock skew problems, offer the potential for low power and high performance and encourage a modular design philosophy which makes incremental technological migration a much easier task. This activity has revealed a need for modelling and simulation techniques suitable for the asynchronous design style. The concurrent process algebra communication sequential processes (CSP) is increasingly advocated as particularly suitable for this purpose. This paper discusses the modelling of SAMIPS, a synthesisable asynchronous MIPS processor core, in Balsa, a CSP-based, asynchronous hardware description language and synthesis tool.","PeriodicalId":152455,"journal":{"name":"37th Annual Simulation Symposium, 2004. Proceedings.","volume":"67 1-2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120909158","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}
J. Miller, Gregory T. Baramidze, A. Sheth, P. Fishwick
{"title":"Investigating ontologies for simulation modeling","authors":"J. Miller, Gregory T. Baramidze, A. Sheth, P. Fishwick","doi":"10.1109/SIMSYM.2004.1299465","DOIUrl":"https://doi.org/10.1109/SIMSYM.2004.1299465","url":null,"abstract":"Many fields have or are developing ontologies for their subdomains. The gene ontology (GO) is now considered to be a great success in biology, a field that has already developed several extensive ontologies. Similar advantages could accrue to the simulation and modeling community. Ontologies provide a way to establish common vocabularies and capture domain knowledge for organizing the domain with a community wide agreement or with the context of agreement between leading domain experts. They can be used to deliver significantly improved (semantic) search and browsing, integration of heterogeneous information sources, and improved analytics and knowledge discovery capabilities. Such knowledge can be used to establish common vocabularies, nomenclatures and taxonomies with links to detailed information sources. This paper investigates the use, the benefits and the development requirements of Web-accessible ontologies for discrete-event simulation and modeling. As a case study, the development of a prototype OWL-based ontology for modeling and simulation called the discrete-event modeling ontology (DeMO) is also discussed. Prototype ontologies such as DeMO can serve as a basis for achieving broader community agreement and adoption of ontologies for this field.","PeriodicalId":152455,"journal":{"name":"37th Annual Simulation Symposium, 2004. Proceedings.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129052866","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}
{"title":"Adaptive energy conservation model using dynamic caching for wireless devices","authors":"C. Mavromoustakis, H. Karatza","doi":"10.1109/SIMSYM.2004.1299490","DOIUrl":"https://doi.org/10.1109/SIMSYM.2004.1299490","url":null,"abstract":"One important issue that has to be taken into account in wireless devices is the energy conservation. Every infrastructureless network must be adaptively self configured particularly in terms of energy, connectivity, and memory. Efficient utilization of battery power is important for wireless users because due to their movements their energy is fluctuating at different levels during operation mode. Traffic plays a major role for energy consumption because of the unpredictable incoming-flow nature. This paper describes an adaptive method called adaptive dynamic caching energy conservation (ADCEC), which bounds an asynchronous operation where each node evaluates dissimilar sleep-wake schedules/states based on each node's incoming sleep-history traffic. Simulation study is carried out for the energy conservation evaluation of the proposed model taking into account a number of metrics and estimation of the effects of incrementing the sleep time duration to conserve energy.","PeriodicalId":152455,"journal":{"name":"37th Annual Simulation Symposium, 2004. Proceedings.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126097306","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}
{"title":"A simulation study of an energy efficient routing protocol for mobile ad hoc networks","authors":"Xiaojiang Du","doi":"10.1109/SIMSYM.2004.1299475","DOIUrl":"https://doi.org/10.1109/SIMSYM.2004.1299475","url":null,"abstract":"We present a novel energy efficient routing protocol for mobile ad hoc networks. This protocol is particularly designed for dense networks. Node location information is used to simplify routing strategy. Only a small number of nodes are involved in one routing. This reduces the routing overhead and saves energy for other nodes. We conduct extensive simulations to study the performance of the routing protocol, and compare the performance with LAR routing protocol. The simulation results demonstrate that the routing protocol has very good performance and good scalability. Both the computation and simulation show that the routing protocol incurs only about 25% of the routing overhead of LAR routing protocol.","PeriodicalId":152455,"journal":{"name":"37th Annual Simulation Symposium, 2004. Proceedings.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124277946","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}
{"title":"Integrated system design, analysis and database-driven simulation model generation","authors":"Ki-Young Jeong, Dave Allan","doi":"10.1109/SIMSYM.2004.1299468","DOIUrl":"https://doi.org/10.1109/SIMSYM.2004.1299468","url":null,"abstract":"This paper discusses an integrated framework of IDEF methods for generating a common data model usable for discrete manufacturing systems. From this data model, a simulation model is automatically generated using a database-driven and atom-based approach. A case study has been included to demonstrate the concept. A prototype function model, a data model and the resulting simulation model were constructed to show the feasibility of the approach. The concept and guidelines provided are expected to increase knowledge reusability between IDEF methods and improve simulation model reusability and maintainability through the features of the relational database technologies. Although the case study was performed for a semiconductor manufacturer, this concept can be easily extended to other areas.","PeriodicalId":152455,"journal":{"name":"37th Annual Simulation Symposium, 2004. Proceedings.","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115044060","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}
{"title":"Accelerating Web page retrieval through object usage declaration","authors":"Chi-Hung Chi, Xiang Li, Hongguang Wang","doi":"10.1109/SIMSYM.2004.1299473","DOIUrl":"https://doi.org/10.1109/SIMSYM.2004.1299473","url":null,"abstract":"With the increasing amount of dynamic and personalized Web content, researchers start to address the acceleration of the first time access of Web pages, hopefully to bring significant improvement to content delivery. While most of these efforts are related to the optimization of connectivity usage (e.g. persistent connection) and efficient content encoding (e.g. data compression and transcoding), this paper tries to address the same issue from the view point of content retrieval dependence within a Web page. A novel mechanism, called the object declaration (OD), is proposed to pass information about embedded object usage of a page to a client earlier, preferably without the need to fetch the data chunks of the page container object that defines them. Result shows that Web page latency can be reduced by about 3% to over 13%.","PeriodicalId":152455,"journal":{"name":"37th Annual Simulation Symposium, 2004. Proceedings.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134002369","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}
I. Chatzigiannakis, A. Kinalis, Athanassios S. Poulakidas, G. Prasinos, C. Zaroliagis
{"title":"DAP: a generic platform for the simulation of distributed algorithms","authors":"I. Chatzigiannakis, A. Kinalis, Athanassios S. Poulakidas, G. Prasinos, C. Zaroliagis","doi":"10.1109/SIMSYM.2004.1299480","DOIUrl":"https://doi.org/10.1109/SIMSYM.2004.1299480","url":null,"abstract":"DAP (distributed algorithms platform) is a generic and homogeneous simulation environment aiming at the implementation, simulation, and testing of distributed algorithms for wired and wireless networks. In this work, we present its architecture, the most important design decisions, and discuss its distinct features and functionalities. DAP allows the algorithm designer to implement a distributed protocol by creating his own customized environment, and programming in a standard programming language in a style very similar to that of a real-world application. DAP provides a graphical user interface that allows the designer to monitor and control the execution of simulations, visualize algorithms, as well as gather statistics and other information for their experimental analysis and testing.","PeriodicalId":152455,"journal":{"name":"37th Annual Simulation Symposium, 2004. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130089801","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}
{"title":"The benefits of load sharing when dimensioning networks","authors":"S. Lincke-Salecker","doi":"10.5555/987679.987726","DOIUrl":"https://doi.org/10.5555/987679.987726","url":null,"abstract":"With third and fourth generation (4G) wireless technology, operators may manage multiple wireless networks, including cellular networks of different generations, frequencies and cell sizes; potentially multiple wireless LAN networks operating at different data rates, and possibly satellite and other networks. Architectural studies on integrated heterogeneous networks propose that a common radio resource manager allocate sessions to wireless networks, based on service requirements and loading. This idea has merit: distributed operating systems has shown that distributing jobs across computer systems can lead to increased throughput, performance, modularity, survivability, and accessibility. This study investigates how the increased modularity and performance offered by load shared networks can translate into lower deployment costs in cellular networks, as in distributed systems.","PeriodicalId":152455,"journal":{"name":"37th Annual Simulation Symposium, 2004. Proceedings.","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124253367","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}
{"title":"Integrating metadata tools with the data services archive to provide Web-based management of large-scale scientific simulation data","authors":"V. Holmes, Wilbur R. Johnson, David J. Miller","doi":"10.1109/SIMSYM.2004.1299467","DOIUrl":"https://doi.org/10.1109/SIMSYM.2004.1299467","url":null,"abstract":"A metadata tool system and a data service system are undergoing development and integration, at Sandia National Laboratories, to provide Web-based access to high-performance computing clusters and its associated simulation data. These clusters host a set of scalable post-processing applications for very large data manipulation, and the examination of results generated by high-fidelity simulations in support of the design to analysis process for ensuring safety and reliability of the nation's nuclear weapons stockpile. The primary subject of this work is the integration of metadata tools with a data service archiving capability, resulting in a service-oriented and Web-based architecture, which provides end users the ability from their desktops to manage and understand simulation results for very large, complex problems.","PeriodicalId":152455,"journal":{"name":"37th Annual Simulation Symposium, 2004. Proceedings.","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115124456","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}
{"title":"Markov model based congestion control for TCP","authors":"S. Suthaharan","doi":"10.1109/SIMSYM.2004.1299493","DOIUrl":"https://doi.org/10.1109/SIMSYM.2004.1299493","url":null,"abstract":"The random early detection (RED) scheme for congestion control in TCP is well known over a decade. Due to a number of control parameters in RED, it cannot make acceptable packet-dropping decision, especially, under heavy network load and high delay to provide high throughput and low packet loss rate. We propose a solution to this problem using Markov chain based decision rule. We modeled the oscillation of the average queue size as a homogeneous Markov chain with three states and simulated the system using the network simulator software NS-2. The simulations show that the proposed scheme successfully estimates the maximum packet dropping probability for random early detection. It detects the congestion very early and adjusts the packet-dropping probability so that RED can make wise packet-dropping decisions. Simulation results show that the proposed scheme provides improved connection throughput and reduced packet loss rate.","PeriodicalId":152455,"journal":{"name":"37th Annual Simulation Symposium, 2004. Proceedings.","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123598976","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}