IDEAS home Printed from https://ideas.repec.org/a/taf/tjsmxx/v6y2012i3p193-204.html
   My bibliography  Save this article

On computation and synchronization costs in spatial distributed simulation

Author

Listed:
  • R Zunino

Abstract

We consider the problem of simulating spatially distributed entities which can move, see each other, and react accordingly. We provide centralized reference algorithms for both time-stepped and discrete-event simulation. Under reasonable assumptions, we then proceed to distribute the simulation among several nodes by assigning each node a subregion of the simulation space. A main characteristic of our approach is that the subregions do not form a partitioning, but a covering. That is, they partially overlap, hence causing some duplicated computation, which is apparently redundant. The amount of overlapping is a tunable parameter of our algorithms, which affects the overall performance in a non-trivial way. Through an analytical model as well as experimental results we discover a trade-off. Choosing a small overlapping requires to perform frequent synchronizations, which negatively affect performance. However, a large overlapping leads to more duplicated work, which also decreases performance. Balancing the amount of overlapping is then required to optimize performance.

Suggested Citation

  • R Zunino, 2012. "On computation and synchronization costs in spatial distributed simulation," Journal of Simulation, Taylor & Francis Journals, vol. 6(3), pages 193-204, August.
    • Handle: RePEc:taf:tjsmxx:v:6:y:2012:i:3:p:193-204
    DOI: 10.1057/jos.2012.9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1057/jos.2012.9
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/jos.2012.9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tjsmxx:v:6:y:2012:i:3:p:193-204. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjsm .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.