Spelling suggestions: "subject:"simulationlation performance"" "subject:"motionsimulation performance""
1 |
Performancevergleich aktiver und passiver Anlagestrategien mittels historischer SimulationThöni, David. January 2008 (has links) (PDF)
Bachelor-Arbeit Univ. St. Gallen, 2008.
|
2 |
A STUDY OF VHDL-AMS SIMULATION PERFORMANCE AS A FUNCTION OF MODEL COMPLEXITYGHALI, KALYAN VENKATA 11 October 2001 (has links)
No description available.
|
3 |
Distributed Particle Filters for Data Assimilation in Simulation of Large Scale Spatial Temporal SystemsBai, Fan 18 December 2014 (has links)
Assimilating real time sensor into a running simulation model can improve simulation results for simulating large-scale spatial temporal systems such as wildfire, road traffic and flood. Particle filters are important methods to support data assimilation. While particle filters can work effectively with sophisticated simulation models, they have high computation cost due to the large number of particles needed in order to converge to the true system state. This is especially true for large-scale spatial temporal simulation systems that have high dimensional state space and high computation cost by themselves. To address the performance issue of particle filter-based data assimilation, this dissertation developed distributed particle filters and applied them to large-scale spatial temporal systems. We first implemented a particle filter-based data assimilation framework and carried out data assimilation to estimate system state and model parameters based on an application of wildfire spread simulation. We then developed advanced particle routing methods in distributed particle filters to route particles among the Processing Units (PUs) after resampling in effective and efficient manners. In particular, for distributed particle filters with centralized resampling, we developed two routing policies named minimal transfer particle routing policy and maximal balance particle routing policy. For distributed PF with decentralized resampling, we developed a hybrid particle routing approach that combines the global routing with the local routing to take advantage of both. The developed routing policies are evaluated from the aspects of communication cost and data assimilation accuracy based on the application of data assimilation for large-scale wildfire spread simulations. Moreover, as cloud computing is gaining more and more popularity; we developed a parallel and distributed particle filter based on Hadoop & MapReduce to support large-scale data assimilation.
|
4 |
Performance Analysis Of Reliable Multicast ProtocolsCelik, Coskun 01 December 2004 (has links) (PDF)
IP multicasting is a method for transmitting the same information to multiple receivers over IP networks. Reliability issue of multicasting contains the challenges for detection and recovery of packet losses and ordered delivery of the entire data. In this work, existing reliable multicast protocols are classified into three main groups, namely tree based, NACK-only and router assisted, and a representative protocol for each group is selected to demonstrate the advantages and disadvantages of the corresponding approaches. The selected protocols are SRM, PGM and RMTP. Performance characteristics of these protocols are empirically evaluated by using simulation results. Network Simulator-2 (ns2), a discrete event simulator is used for the implementation and simulation of the selected protocols. The contributions of the thesis are twofold, i.e. the extension of the ns library with an open source implementation of RMTP which did not exist earlier and the evaluation of the selected protocols by investigating performance metrics like distribution delay and recovery latency with respect to varying multicast group size, network diameter, link loss rate, etc.
|
5 |
An efficiency rating tool for process-level VHDL behavioral modelsWicks, John A. 06 June 2008 (has links)
Due to the great complexity of VHDL models that are created today, the amount of processing time required to simulate these models and the amount of labor required to develop these models have become critical issues. The amount of processing time required to simulate a model can be directly influenced by the efficient use of VHDL concepts in creating the model. This dissertation presents an approach to aiding the modeler in the development of more efficient VHDL models. This is done by measuring the simulation efficiency of process-level VHDL behavioral models. Research in the determination of what VHDL constructs and modeling styles are most efficient is presented. The development and use of a tool that parses VHDL behavioral models and reveals the efficiency of the code in the form of a numerical efficiency rating is also presented. / Ph. D.
|
6 |
On Qos Multicast Routing Routing ProtocolsBereketli, Alper 01 September 2005 (has links) (PDF)
Multicasting is a technique used for distributing data packets from one or more sources to a set of receivers on interconnected networks. Currently developing network applications bring specific quality of service (QoS) requirements like bounded delay, minimum bandwidth, and maximum data loss rate. Providing the required quality of service addresses routing and resource reservation concepts. In this study, a literature survey is carried out on traditional and QoS multicast routing protocols, and the need for QoS routing protocols is investigated. QoS multicast routing protocols are classified and compared according to their multicast tree construction and resource reservation approaches. Two QoS protocols, QROUTE and QMBF, are selected, and their performances are experimentally compared using the network simulation tool Network Simulator-2 (ns-2). The objective of the simulations is to compare the QoS routing algorithms and their tree construction efficiencies. The first contribution of the thesis is the survey and classification of traditional and QoS multicast routing protocols. Another contribution is the ns-2 implementation of two QoS multicast routing protocols. The final contribution of the thesis is the performance evaluation of the recent protocols from a different perspective.
|
7 |
Satellite multiple access protocols for land mobile terminals : a study of the multiple access environment for land mobile satellite terminals, including the design analysis and simulation of a suitable protocol and the evaluation of its performance in a U.K. systemFenech, Hector Tony January 1987 (has links)
This thesis is a study of multiple access schemes for satellite land mobile systems that provide a domestic or regional service to a large number of small terminals. Three orbit options are studied, namely the geostationary, elliptical (Molniya) and inclined circular orbits. These are investigated for various mobile applications and the choice of the Molniya orbit is justified for a U. K. system. Frequency, Time and Code Division Multiple Access (FDMA, TDMA and CDMA) are studied and their relative merits in the mobile environment are highlighted. A hybrid TDMA/FDMA structure is suggested for a large system. Reservation ALOHA schemes are appraised in a TDMA environment and an adaptive reservation multiple access protocol is proposed and analysed for a wide range of mobile communication traffic profiles. The system can cope with short and long data messages as well as voice calls. Various protocol options are presented and a target system having 100,000 users is considered. Analyses are presented for the steady state of protocols employing pure and slotted ALOHA and for the stabilty of the slotted variant, while simulation techniques were employed to validate the steady state analysis of the slotted ALOHA protocol and to analyse the stability problem of the pure ALOHA version. An innovative technique is put forward to integrate the reservation and the acquisition processes. It employs the geographical spread of the users to form part of the random delay in P-ALOHA. Finally an economic feasibility study is performed for the spacesegment. For costs of capital (r) less than 23 % the discounted payback period is less than the project's lifetime (10 years). At r- 8% the payback period is about 5.6 years, while the internal-rate-of-return is 22.2 %. The net present value at the end of the projects lifetime is £M 70 at r-8%.
|
8 |
Effiziente parallele Sortier- und Datenumverteilungsverfahren für Partikelsimulationen auf Parallelrechnern mit verteiltem SpeicherHofmann, Michael 09 March 2012 (has links)
Partikelsimulationen repräsentieren eine Klasse von daten- und rechenintensiven Simulationsanwendungen, die in unterschiedlichen Bereichen der Wissenschaft und der industriellen Forschung zum Einsatz kommen. Der hohe Berechnungsaufwand der eingesetzten Lösungsmethoden und die großen Datenmengen, die zur Modellierung realistischer Probleme benötigt werden, machen die Nutzung paralleler Rechentechnik hierfür unverzichtbar. Parallelrechner mit verteiltem Speicher stellen dabei eine weit verbreitete Architektur dar, bei der eine Vielzahl an parallel arbeitenden Rechenknoten über ein Verbindungsnetzwerk miteinander Daten austauschen können. Die Berechnung von Wechselwirkungen zwischen Partikeln stellt oft den Hauptaufwand einer Partikelsimulation dar und wird mit Hilfe schneller Lösungsmethoden, wie dem Barnes-Hut-Algorithmus oder der Schnellen Multipolmethode, durchgeführt. Effiziente parallele Implementierungen dieser Algorithmen benötigen dabei eine Sortierung der Partikel nach ihren räumlichen Positionen. Die Sortierung ist sowohl notwendig, um einen effizienten Zugriff auf die Partikeldaten zu erhalten, als auch Teil von Optimierungen zur Erhöhung der Lokalität von Speicherzugriffen, zur Minimierung der Kommunikation und zur Verbesserung der Lastbalancierung paralleler Berechnungen.
Die vorliegende Dissertation beschäftigt sich mit der Entwicklung eines effizienten parallelen Sortierverfahrens und der dafür benötigten Kommunikationsoperationen zur Datenumverteilung in Partikelsimulationen. Hierzu werden eine Vielzahl existierender paralleler Sortierverfahren für verteilten Speicher analysiert und mit den Anforderungen von Seiten der Partikelsimulationsanwendungen verglichen. Besondere Herausforderungen ergeben sich dabei hinsichtlich der Aufteilung der Partikeldaten auf verteilten Speicher, der Gewichtung zu sortierender Daten zur verbesserten Lastbalancierung, dem Umgang mit doppelten Schlüsselwerten sowie der Verfügbarkeit und Nutzung speichereffizienter Kommunikationsoperationen. Um diese Anforderungen zu erfüllen, wird ein neues paralleles Sortierverfahren entwickelt und in die betrachteten Anwendungsprogramme integriert. Darüber hinaus wird ein neuer In-place-Algorithmus für der MPI_Alltoallv-Kommunikationsoperation vorgestellt, mit dem der Speicherverbrauch für die notwendige Datenumverteilung innerhalb der parallelen Sortierung deutlich reduziert werden kann. Das Verhalten aller entwickelten Verfahren wird jeweils isoliert und im praxisrelevanten Einsatz innerhalb verschiedener Anwendungsprogramme und unter Verwendung unterschiedlicher, insbesondere auch hochskalierbarer Parallelrechner untersucht.
|
9 |
Performance evaluation of routing protocols using NS-2 and realistic traces on driving simulatorChen, Mingye 21 May 2014 (has links)
Indiana University-Purdue University Indianapolis (IUPUI) / With the rapid growth in wireless mobile communication technology, Vehicular Ad-hoc Network (VANET) has emerged as a promising method to effectively solve transportation-related issues. So far, most of researches on VANETs have been conducted with simulations as the real-world experiment is expensive. A core problem affecting the fidelity of simulation is the mobility model employed. In this thesis, a sophisticated traffic simulator capable of generating realistic vehicle traces is introduced. Combined with network simulator NS-2, we used this tool to evaluate the general performance of several routing protocols and studied the impact of intersections on simulation results. We show that static nodes near the intersection tend to become more active in packet delivery with higher transferred throughput.
|
Page generated in 0.0885 seconds