Trade-off between sequential and time warp-based parallel simulation

Discrete event simulation is a methodology to study the behavior of complex systems. Its drawback is that, in order to get reliable results, simulations usually have to be run over a long stretch of time. This time requirement could decrease through the usage of parallel or distributed computing sys...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on parallel and distributed systems 1999-08, Vol.10 (8), p.781-794
Hauptverfasser: Quaglia, F., Cortellessa, V., Ciciani, B.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 794
container_issue 8
container_start_page 781
container_title IEEE transactions on parallel and distributed systems
container_volume 10
creator Quaglia, F.
Cortellessa, V.
Ciciani, B.
description Discrete event simulation is a methodology to study the behavior of complex systems. Its drawback is that, in order to get reliable results, simulations usually have to be run over a long stretch of time. This time requirement could decrease through the usage of parallel or distributed computing systems. In this paper, we analyze the Time Warp synchronization protocol for parallel discrete event simulation and present an analytical model evaluating the upper bound on the completion time of a Time Warp simulation. In our analysis, we consider the case of a simulation model with homogeneous logical processes, where "homogeneous" means they have the same average event routine time and the same state saving cost. Then we propose a methodology to determine when it is time-convenient to use a Time Warp synchronized simulation, instead of a sequential one, for a simulation model with features matching those considered in our analysis. We give an answer to this question without the need to preliminary generate the simulation code. Examples of methodology usage are reported for the case of both a synthetic benchmark and a real world model.
doi_str_mv 10.1109/71.790597
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_28693958</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>790597</ieee_id><sourcerecordid>28693958</sourcerecordid><originalsourceid>FETCH-LOGICAL-c340t-b98802df6f3576720ed5ac90e302b745c0875d79c8f1d02910a9b703b36143d13</originalsourceid><addsrcrecordid>eNqF0E1LxDAQBuAgCq6rB6-eelI8dJ0kTZM5yvoJC17Wc0mbKVTSD5Mui__eShePepqBeWYYXsYuOaw4B7zTfKURFOojtuBKmVRwI4-nHjKVouB4ys5i_ADgmYJswR62wTpK-7pOShr3RF0S6XNH3dhYn9jOJWPTUrK3YUhLG8klgw3We_JJbNqdt2PTd-fspLY-0sWhLtn70-N2_ZJu3p5f1_ebtJIZjGmJxoBwdV5LpXMtgJyyFQJJEKXOVAVGK6exMjV3IJCDxVKDLGXOM-m4XLKb-e4Q-unHOBZtEyvy3nbU72KBHKclBJzk9Z9SmBwlKvM_1NyIPIcJ3s6wCn2MgepiCE1rw1fBofiJvtC8mKOf7NVsGyL6dYfhNwW8fJI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>27182660</pqid></control><display><type>article</type><title>Trade-off between sequential and time warp-based parallel simulation</title><source>IEEE Electronic Library (IEL)</source><creator>Quaglia, F. ; Cortellessa, V. ; Ciciani, B.</creator><creatorcontrib>Quaglia, F. ; Cortellessa, V. ; Ciciani, B.</creatorcontrib><description>Discrete event simulation is a methodology to study the behavior of complex systems. Its drawback is that, in order to get reliable results, simulations usually have to be run over a long stretch of time. This time requirement could decrease through the usage of parallel or distributed computing systems. In this paper, we analyze the Time Warp synchronization protocol for parallel discrete event simulation and present an analytical model evaluating the upper bound on the completion time of a Time Warp simulation. In our analysis, we consider the case of a simulation model with homogeneous logical processes, where "homogeneous" means they have the same average event routine time and the same state saving cost. Then we propose a methodology to determine when it is time-convenient to use a Time Warp synchronized simulation, instead of a sequential one, for a simulation model with features matching those considered in our analysis. We give an answer to this question without the need to preliminary generate the simulation code. Examples of methodology usage are reported for the case of both a synthetic benchmark and a real world model.</description><identifier>ISSN: 1045-9219</identifier><identifier>EISSN: 1558-2183</identifier><identifier>DOI: 10.1109/71.790597</identifier><identifier>CODEN: ITDSEO</identifier><language>eng</language><publisher>IEEE</publisher><subject>Analytical models ; Complex systems ; Computational modeling ; Computer networks ; Computer simulation ; Computer Society ; Costs ; Discrete event simulation ; Distributed computing ; Mathematical analysis ; Methodology ; Protocols ; Synchronization ; Time warp simulation ; Tradeoffs ; Upper bound ; Warp</subject><ispartof>IEEE transactions on parallel and distributed systems, 1999-08, Vol.10 (8), p.781-794</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c340t-b98802df6f3576720ed5ac90e302b745c0875d79c8f1d02910a9b703b36143d13</citedby><cites>FETCH-LOGICAL-c340t-b98802df6f3576720ed5ac90e302b745c0875d79c8f1d02910a9b703b36143d13</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/790597$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/790597$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Quaglia, F.</creatorcontrib><creatorcontrib>Cortellessa, V.</creatorcontrib><creatorcontrib>Ciciani, B.</creatorcontrib><title>Trade-off between sequential and time warp-based parallel simulation</title><title>IEEE transactions on parallel and distributed systems</title><addtitle>TPDS</addtitle><description>Discrete event simulation is a methodology to study the behavior of complex systems. Its drawback is that, in order to get reliable results, simulations usually have to be run over a long stretch of time. This time requirement could decrease through the usage of parallel or distributed computing systems. In this paper, we analyze the Time Warp synchronization protocol for parallel discrete event simulation and present an analytical model evaluating the upper bound on the completion time of a Time Warp simulation. In our analysis, we consider the case of a simulation model with homogeneous logical processes, where "homogeneous" means they have the same average event routine time and the same state saving cost. Then we propose a methodology to determine when it is time-convenient to use a Time Warp synchronized simulation, instead of a sequential one, for a simulation model with features matching those considered in our analysis. We give an answer to this question without the need to preliminary generate the simulation code. Examples of methodology usage are reported for the case of both a synthetic benchmark and a real world model.</description><subject>Analytical models</subject><subject>Complex systems</subject><subject>Computational modeling</subject><subject>Computer networks</subject><subject>Computer simulation</subject><subject>Computer Society</subject><subject>Costs</subject><subject>Discrete event simulation</subject><subject>Distributed computing</subject><subject>Mathematical analysis</subject><subject>Methodology</subject><subject>Protocols</subject><subject>Synchronization</subject><subject>Time warp simulation</subject><subject>Tradeoffs</subject><subject>Upper bound</subject><subject>Warp</subject><issn>1045-9219</issn><issn>1558-2183</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1999</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNqF0E1LxDAQBuAgCq6rB6-eelI8dJ0kTZM5yvoJC17Wc0mbKVTSD5Mui__eShePepqBeWYYXsYuOaw4B7zTfKURFOojtuBKmVRwI4-nHjKVouB4ys5i_ADgmYJswR62wTpK-7pOShr3RF0S6XNH3dhYn9jOJWPTUrK3YUhLG8klgw3We_JJbNqdt2PTd-fspLY-0sWhLtn70-N2_ZJu3p5f1_ebtJIZjGmJxoBwdV5LpXMtgJyyFQJJEKXOVAVGK6exMjV3IJCDxVKDLGXOM-m4XLKb-e4Q-unHOBZtEyvy3nbU72KBHKclBJzk9Z9SmBwlKvM_1NyIPIcJ3s6wCn2MgepiCE1rw1fBofiJvtC8mKOf7NVsGyL6dYfhNwW8fJI</recordid><startdate>19990801</startdate><enddate>19990801</enddate><creator>Quaglia, F.</creator><creator>Cortellessa, V.</creator><creator>Ciciani, B.</creator><general>IEEE</general><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>7SP</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>19990801</creationdate><title>Trade-off between sequential and time warp-based parallel simulation</title><author>Quaglia, F. ; Cortellessa, V. ; Ciciani, B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c340t-b98802df6f3576720ed5ac90e302b745c0875d79c8f1d02910a9b703b36143d13</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Analytical models</topic><topic>Complex systems</topic><topic>Computational modeling</topic><topic>Computer networks</topic><topic>Computer simulation</topic><topic>Computer Society</topic><topic>Costs</topic><topic>Discrete event simulation</topic><topic>Distributed computing</topic><topic>Mathematical analysis</topic><topic>Methodology</topic><topic>Protocols</topic><topic>Synchronization</topic><topic>Time warp simulation</topic><topic>Tradeoffs</topic><topic>Upper bound</topic><topic>Warp</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Quaglia, F.</creatorcontrib><creatorcontrib>Cortellessa, V.</creatorcontrib><creatorcontrib>Ciciani, B.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>ANTE: Abstracts in New Technology &amp; Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on parallel and distributed systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Quaglia, F.</au><au>Cortellessa, V.</au><au>Ciciani, B.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Trade-off between sequential and time warp-based parallel simulation</atitle><jtitle>IEEE transactions on parallel and distributed systems</jtitle><stitle>TPDS</stitle><date>1999-08-01</date><risdate>1999</risdate><volume>10</volume><issue>8</issue><spage>781</spage><epage>794</epage><pages>781-794</pages><issn>1045-9219</issn><eissn>1558-2183</eissn><coden>ITDSEO</coden><abstract>Discrete event simulation is a methodology to study the behavior of complex systems. Its drawback is that, in order to get reliable results, simulations usually have to be run over a long stretch of time. This time requirement could decrease through the usage of parallel or distributed computing systems. In this paper, we analyze the Time Warp synchronization protocol for parallel discrete event simulation and present an analytical model evaluating the upper bound on the completion time of a Time Warp simulation. In our analysis, we consider the case of a simulation model with homogeneous logical processes, where "homogeneous" means they have the same average event routine time and the same state saving cost. Then we propose a methodology to determine when it is time-convenient to use a Time Warp synchronized simulation, instead of a sequential one, for a simulation model with features matching those considered in our analysis. We give an answer to this question without the need to preliminary generate the simulation code. Examples of methodology usage are reported for the case of both a synthetic benchmark and a real world model.</abstract><pub>IEEE</pub><doi>10.1109/71.790597</doi><tpages>14</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1045-9219
ispartof IEEE transactions on parallel and distributed systems, 1999-08, Vol.10 (8), p.781-794
issn 1045-9219
1558-2183
language eng
recordid cdi_proquest_miscellaneous_28693958
source IEEE Electronic Library (IEL)
subjects Analytical models
Complex systems
Computational modeling
Computer networks
Computer simulation
Computer Society
Costs
Discrete event simulation
Distributed computing
Mathematical analysis
Methodology
Protocols
Synchronization
Time warp simulation
Tradeoffs
Upper bound
Warp
title Trade-off between sequential and time warp-based parallel simulation
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T09%3A52%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Trade-off%20between%20sequential%20and%20time%20warp-based%20parallel%20simulation&rft.jtitle=IEEE%20transactions%20on%20parallel%20and%20distributed%20systems&rft.au=Quaglia,%20F.&rft.date=1999-08-01&rft.volume=10&rft.issue=8&rft.spage=781&rft.epage=794&rft.pages=781-794&rft.issn=1045-9219&rft.eissn=1558-2183&rft.coden=ITDSEO&rft_id=info:doi/10.1109/71.790597&rft_dat=%3Cproquest_RIE%3E28693958%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=27182660&rft_id=info:pmid/&rft_ieee_id=790597&rfr_iscdi=true