Performance limitations of parallel simulations
This study shows how the performance of a parallel simulation may be affected by the structure of the system being simulated. We consider a wide class of “linearly synchronous” simulations consisting of asynchronous and synchronous parallel simulations (or other distributed‐processing systems), with...
Gespeichert in:
Veröffentlicht in: | International journal of stochastic analysis 1998-01, Vol.11 (3), p.397-409 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 409 |
---|---|
container_issue | 3 |
container_start_page | 397 |
container_title | International journal of stochastic analysis |
container_volume | 11 |
creator | Chen, Liang Serfozo, Richard F. |
description | This study shows how the performance of a parallel simulation may be affected by the structure of the system being simulated. We consider a wide class of “linearly synchronous” simulations consisting of asynchronous and synchronous parallel simulations (or other distributed‐processing systems), with conservative or optimistic protocols, in which the differences in the virtual times of the logical processes being simulated in real time t are of the order o ( t ) as t tends to infinity. Using a random time transformation idea, we show how a simulation′s processing rate in real time is related to the throughput rates in virtual time of the system being simulated. This relation is the basis for establishing upper bounds on simulation processing rates. The bounds for the rates are tight and are close to the actual rates as numerical experiments indicate. We use the bounds to determine the maximum number of processors that a simulation can effectively use. The bounds also give insight into efficient assignment of processors to the logical processes in a simulation. |
doi_str_mv | 10.1155/S1048953398000331 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1155_S1048953398000331</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>28520252</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2341-a5ca6d03a0970e5d18b389ec3e9b1e84cdac662a0cfbd1db8c7f1025d578adf03</originalsourceid><addsrcrecordid>eNplkEtLw0AUhQdRsNT-AHdZuYu9d24mmVlK8QUFBXUdbuYBkUlSZ9KF_96WihtX53D4OItPiGuEW0Sl1m8IlTaKyGgAIMIzsZBgoCSq4Pyvk7wUq5w_4QgZ2SAtxPrVpzClgUfri9gP_cxzP425mEKx48Qx-ljkftjH034lLgLH7Fe_uRQfD_fvm6dy-_L4vLnbllZShSUry7UDYjANeOVQd6SNt-RNh15X1rGta8lgQ-fQddo2AUEqpxrNLgAtxc3pd5emr73Pczv02foYefTTPrdSK3ng5QHEE2jTlHPyod2lfuD03SK0RzvtPzv0A9lPV0Y</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28520252</pqid></control><display><type>article</type><title>Performance limitations of parallel simulations</title><source>Wiley Online Library Open Access</source><source>Alma/SFX Local Collection</source><creator>Chen, Liang ; Serfozo, Richard F.</creator><creatorcontrib>Chen, Liang ; Serfozo, Richard F.</creatorcontrib><description>This study shows how the performance of a parallel simulation may be affected by the structure of the system being simulated. We consider a wide class of “linearly synchronous” simulations consisting of asynchronous and synchronous parallel simulations (or other distributed‐processing systems), with conservative or optimistic protocols, in which the differences in the virtual times of the logical processes being simulated in real time t are of the order o ( t ) as t tends to infinity. Using a random time transformation idea, we show how a simulation′s processing rate in real time is related to the throughput rates in virtual time of the system being simulated. This relation is the basis for establishing upper bounds on simulation processing rates. The bounds for the rates are tight and are close to the actual rates as numerical experiments indicate. We use the bounds to determine the maximum number of processors that a simulation can effectively use. The bounds also give insight into efficient assignment of processors to the logical processes in a simulation.</description><identifier>ISSN: 2090-3332</identifier><identifier>ISSN: 1048-9533</identifier><identifier>EISSN: 2090-3340</identifier><identifier>EISSN: 1687-2177</identifier><identifier>DOI: 10.1155/S1048953398000331</identifier><language>eng</language><ispartof>International journal of stochastic analysis, 1998-01, Vol.11 (3), p.397-409</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2341-a5ca6d03a0970e5d18b389ec3e9b1e84cdac662a0cfbd1db8c7f1025d578adf03</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Chen, Liang</creatorcontrib><creatorcontrib>Serfozo, Richard F.</creatorcontrib><title>Performance limitations of parallel simulations</title><title>International journal of stochastic analysis</title><description>This study shows how the performance of a parallel simulation may be affected by the structure of the system being simulated. We consider a wide class of “linearly synchronous” simulations consisting of asynchronous and synchronous parallel simulations (or other distributed‐processing systems), with conservative or optimistic protocols, in which the differences in the virtual times of the logical processes being simulated in real time t are of the order o ( t ) as t tends to infinity. Using a random time transformation idea, we show how a simulation′s processing rate in real time is related to the throughput rates in virtual time of the system being simulated. This relation is the basis for establishing upper bounds on simulation processing rates. The bounds for the rates are tight and are close to the actual rates as numerical experiments indicate. We use the bounds to determine the maximum number of processors that a simulation can effectively use. The bounds also give insight into efficient assignment of processors to the logical processes in a simulation.</description><issn>2090-3332</issn><issn>1048-9533</issn><issn>2090-3340</issn><issn>1687-2177</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1998</creationdate><recordtype>article</recordtype><recordid>eNplkEtLw0AUhQdRsNT-AHdZuYu9d24mmVlK8QUFBXUdbuYBkUlSZ9KF_96WihtX53D4OItPiGuEW0Sl1m8IlTaKyGgAIMIzsZBgoCSq4Pyvk7wUq5w_4QgZ2SAtxPrVpzClgUfri9gP_cxzP425mEKx48Qx-ljkftjH034lLgLH7Fe_uRQfD_fvm6dy-_L4vLnbllZShSUry7UDYjANeOVQd6SNt-RNh15X1rGta8lgQ-fQddo2AUEqpxrNLgAtxc3pd5emr73Pczv02foYefTTPrdSK3ng5QHEE2jTlHPyod2lfuD03SK0RzvtPzv0A9lPV0Y</recordid><startdate>199801</startdate><enddate>199801</enddate><creator>Chen, Liang</creator><creator>Serfozo, Richard F.</creator><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></search><sort><creationdate>199801</creationdate><title>Performance limitations of parallel simulations</title><author>Chen, Liang ; Serfozo, Richard F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2341-a5ca6d03a0970e5d18b389ec3e9b1e84cdac662a0cfbd1db8c7f1025d578adf03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1998</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chen, Liang</creatorcontrib><creatorcontrib>Serfozo, Richard F.</creatorcontrib><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><jtitle>International journal of stochastic analysis</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chen, Liang</au><au>Serfozo, Richard F.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Performance limitations of parallel simulations</atitle><jtitle>International journal of stochastic analysis</jtitle><date>1998-01</date><risdate>1998</risdate><volume>11</volume><issue>3</issue><spage>397</spage><epage>409</epage><pages>397-409</pages><issn>2090-3332</issn><issn>1048-9533</issn><eissn>2090-3340</eissn><eissn>1687-2177</eissn><abstract>This study shows how the performance of a parallel simulation may be affected by the structure of the system being simulated. We consider a wide class of “linearly synchronous” simulations consisting of asynchronous and synchronous parallel simulations (or other distributed‐processing systems), with conservative or optimistic protocols, in which the differences in the virtual times of the logical processes being simulated in real time t are of the order o ( t ) as t tends to infinity. Using a random time transformation idea, we show how a simulation′s processing rate in real time is related to the throughput rates in virtual time of the system being simulated. This relation is the basis for establishing upper bounds on simulation processing rates. The bounds for the rates are tight and are close to the actual rates as numerical experiments indicate. We use the bounds to determine the maximum number of processors that a simulation can effectively use. The bounds also give insight into efficient assignment of processors to the logical processes in a simulation.</abstract><doi>10.1155/S1048953398000331</doi><tpages>13</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 2090-3332 |
ispartof | International journal of stochastic analysis, 1998-01, Vol.11 (3), p.397-409 |
issn | 2090-3332 1048-9533 2090-3340 1687-2177 |
language | eng |
recordid | cdi_crossref_primary_10_1155_S1048953398000331 |
source | Wiley Online Library Open Access; Alma/SFX Local Collection |
title | Performance limitations of parallel simulations |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T05%3A11%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Performance%20limitations%20of%20parallel%20simulations&rft.jtitle=International%20journal%20of%20stochastic%20analysis&rft.au=Chen,%20Liang&rft.date=1998-01&rft.volume=11&rft.issue=3&rft.spage=397&rft.epage=409&rft.pages=397-409&rft.issn=2090-3332&rft.eissn=2090-3340&rft_id=info:doi/10.1155/S1048953398000331&rft_dat=%3Cproquest_cross%3E28520252%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=28520252&rft_id=info:pmid/&rfr_iscdi=true |