Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Enabling Peer-to-Peer Co-Simulation
Halmstad University, School of Information Technology.
2015 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesisAlternative title
Möjliggöra distribuerad simulering via P2P (Swedish)
Abstract [en]

Simulation enables preliminary testing of products that may otherwise be dicult, ex-pensive, or dangerous to test physically. Unfortunately, intellectual property concernscan make it dicult or impossible to share the human-readable simulation models toend-users. In fact, there can even be diculties with sharing executables because ofthe possibility for reverse-engineering. This presents a problem when simulating if themodel relies on components for which the source code or executable is not available,such as proprietary components developed by another party. This thesis investigateswhether it is possible to enable a set of networked peers to all take part in computingthe same simulation without any of them having access to the entire model. One way tosolve this problem is to let each system that holds a model of a component to computeits part of the simulation for a single timestep and to share the new state through peer-to-peer connections with the other systems, once a response has been received fromall other peers, the local simulation can advance one timestep and the process can berepeated. But running a simulation over a network can make it signicantly slower,since local operations on the CPU and memory are much faster than operations overa network, and the peers will be spending most of their time waiting for each other asa result. To avoid such delays, each peer maintains expected values for variables thatare not in the local model, and updates are sent only when a local variable changes.These updates are stamped with the local simulation-time, thus allowing the recipientpeers to know when the update is required in the simulations future, or to when itshould be retroactively applied in the simulations past. Using this technique, the peerscan compute their respective local models under the assumption that the variablesthat the other peers control are unchanged. Thus the peers can advance any numberof timesteps without needing to stop and wait for other peers. These techniques willlikely result in wasted work if one or more peers are advancing their simulation timeslower than the others, when this happens, the peers have the ability to re-distributethe workload on the y by transferring control over models. This also makes it possibleto accommodate for systems joining or leaving the simulation while it is running.In this thesis we show that co-simulating in this fashion is a workable option to tra-ditional simulation when the local models are incomplete, but that the performanceis very dependent on the models being simulated. Especially the relation between thefrequency of required synchronizations, and the time to compute a timestep. In ourexperiments with fairly basic models, the performance ratio, compared to traditionalsimulation, ranged between less than one percent of that of traditional simulation, upto roughly 70%. But with slower models always having a better ratio.

Place, publisher, year, edition, pages
2015. , 45 p.
Keyword [en]
Simulation, Co-Simulation, Distributed simulation
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:hh:diva-29553OAI: oai:DiVA.org:hh-29553DiVA: diva2:858915
Subject / course
Computer Systems Technology
Presentation
2015-10-01, 20:33 (English)
Supervisors
Examiners
Available from: 2015-10-14 Created: 2015-10-01 Last updated: 2015-10-14Bibliographically approved

Open Access in DiVA

fulltext(9905 kB)66 downloads
File information
File name FULLTEXT02.pdfFile size 9905 kBChecksum SHA-512
0ebf0e1f6b14746d65fe47f3c0f30e77805fbc16e74d64546b793d8341aad48446c0bc452688bd13c0581f7843360ee8e121b2ec72501d027967eb7dab10c0fc
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Eriksson, Felix
By organisation
School of Information Technology
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 66 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 136 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf