DSIM: scaling time warp to 1,033 processors

This paper presents the design, implementation and performance of a time warp simulator, called DSIM, which targets clusters comprised of thousands of processors. DSIM employs a novel technique for GVT computation, called the time quantum GVT algorithm that requires no message acknowledgement, relie...

Full description

Saved in:
Bibliographic Details
Main Authors: Chen, G., Szymanski, B.K.
Format: Conference Proceeding
Language:English
Subjects:
Clustering algorithms
Computational modeling
Computer simulation
Concurrent computing
Delay
Discrete event simulation
Distributed computing
Memory management
Quantum computing
Time warp simulation
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page 10 pp.
container_title
container_volume
creator Chen, G.
Szymanski, B.K.
description This paper presents the design, implementation and performance of a time warp simulator, called DSIM, which targets clusters comprised of thousands of processors. DSIM employs a novel technique for GVT computation, called the time quantum GVT algorithm that requires no message acknowledgement, relies on constant-length messages and is efficient on clusters with large numbers of processors. Its implementation uses a technique called Local Fossil Collection to alleviate the overhead of memory reclamation and to support efficient event management. DSIM is also equipped with a simple programming interface to ease programming and debugging of simulations. Experimental results obtained on the PHOLD benchmark demonstrated that DSIM can process as many as 228 million events per second on 1033 processors.
doi_str_mv 10.1109/WSC.2005.1574269
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_1574269</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1574269</ieee_id><sourcerecordid>1574269</sourcerecordid><originalsourceid>FETCH-LOGICAL-i217t-89005267a27e5b7ca3a9e5d5b90b045be2fc43aed932e5038c7e3c939a16e8bb3</originalsourceid><addsrcrecordid>eNotj01LAzEQQIMfYFu9C15y111nMjubxJusX4WKhyoeS5JOZaV1l82C-O8V7OndHu8pdY5QIoK_fl82pQHgEtlWpvYHaoLMrqgI-FBNwTogz-jhSE3AeSyspfpETXP-BEDHaCbq8m45f77ROYVt-_Whx3Yn-jsMvR47jVdApPuhS5JzN-RTdbwJ2yxne87U28P9a_NULF4e583tomgN2rFw_q_J1DYYKxxtChS88JqjhwgVRzGbVFGQtScjDOSSFUqefMBaXIw0Uxf_3lZEVv3Q7sLws9pP0i8BokEm</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>DSIM: scaling time warp to 1,033 processors</title><source>IEEE Xplore All Conference Series</source><creator>Chen, G. ; Szymanski, B.K.</creator><creatorcontrib>Chen, G. ; Szymanski, B.K.</creatorcontrib><description>This paper presents the design, implementation and performance of a time warp simulator, called DSIM, which targets clusters comprised of thousands of processors. DSIM employs a novel technique for GVT computation, called the time quantum GVT algorithm that requires no message acknowledgement, relies on constant-length messages and is efficient on clusters with large numbers of processors. Its implementation uses a technique called Local Fossil Collection to alleviate the overhead of memory reclamation and to support efficient event management. DSIM is also equipped with a simple programming interface to ease programming and debugging of simulations. Experimental results obtained on the PHOLD benchmark demonstrated that DSIM can process as many as 228 million events per second on 1033 processors.</description><identifier>ISSN: 0891-7736</identifier><identifier>ISBN: 0780395190</identifier><identifier>ISBN: 9780780395190</identifier><identifier>EISSN: 1558-4305</identifier><identifier>DOI: 10.1109/WSC.2005.1574269</identifier><language>eng</language><publisher>IEEE</publisher><subject>Clustering algorithms ; Computational modeling ; Computer simulation ; Concurrent computing ; Delay ; Discrete event simulation ; Distributed computing ; Memory management ; Quantum computing ; Time warp simulation</subject><ispartof>Proceedings of the Winter Simulation Conference, 2005, 2005, p.10 pp.</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1574269$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,4047,4048,27923,54553,54918,54930</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1574269$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Chen, G.</creatorcontrib><creatorcontrib>Szymanski, B.K.</creatorcontrib><title>DSIM: scaling time warp to 1,033 processors</title><title>Proceedings of the Winter Simulation Conference, 2005</title><addtitle>WSC</addtitle><description>This paper presents the design, implementation and performance of a time warp simulator, called DSIM, which targets clusters comprised of thousands of processors. DSIM employs a novel technique for GVT computation, called the time quantum GVT algorithm that requires no message acknowledgement, relies on constant-length messages and is efficient on clusters with large numbers of processors. Its implementation uses a technique called Local Fossil Collection to alleviate the overhead of memory reclamation and to support efficient event management. DSIM is also equipped with a simple programming interface to ease programming and debugging of simulations. Experimental results obtained on the PHOLD benchmark demonstrated that DSIM can process as many as 228 million events per second on 1033 processors.</description><subject>Clustering algorithms</subject><subject>Computational modeling</subject><subject>Computer simulation</subject><subject>Concurrent computing</subject><subject>Delay</subject><subject>Discrete event simulation</subject><subject>Distributed computing</subject><subject>Memory management</subject><subject>Quantum computing</subject><subject>Time warp simulation</subject><issn>0891-7736</issn><issn>1558-4305</issn><isbn>0780395190</isbn><isbn>9780780395190</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotj01LAzEQQIMfYFu9C15y111nMjubxJusX4WKhyoeS5JOZaV1l82C-O8V7OndHu8pdY5QIoK_fl82pQHgEtlWpvYHaoLMrqgI-FBNwTogz-jhSE3AeSyspfpETXP-BEDHaCbq8m45f77ROYVt-_Whx3Yn-jsMvR47jVdApPuhS5JzN-RTdbwJ2yxne87U28P9a_NULF4e583tomgN2rFw_q_J1DYYKxxtChS88JqjhwgVRzGbVFGQtScjDOSSFUqefMBaXIw0Uxf_3lZEVv3Q7sLws9pP0i8BokEm</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Chen, G.</creator><creator>Szymanski, B.K.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>2005</creationdate><title>DSIM: scaling time warp to 1,033 processors</title><author>Chen, G. ; Szymanski, B.K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i217t-89005267a27e5b7ca3a9e5d5b90b045be2fc43aed932e5038c7e3c939a16e8bb3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Clustering algorithms</topic><topic>Computational modeling</topic><topic>Computer simulation</topic><topic>Concurrent computing</topic><topic>Delay</topic><topic>Discrete event simulation</topic><topic>Distributed computing</topic><topic>Memory management</topic><topic>Quantum computing</topic><topic>Time warp simulation</topic><toplevel>online_resources</toplevel><creatorcontrib>Chen, G.</creatorcontrib><creatorcontrib>Szymanski, B.K.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chen, G.</au><au>Szymanski, B.K.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>DSIM: scaling time warp to 1,033 processors</atitle><btitle>Proceedings of the Winter Simulation Conference, 2005</btitle><stitle>WSC</stitle><date>2005</date><risdate>2005</risdate><spage>10 pp.</spage><pages>10 pp.-</pages><issn>0891-7736</issn><eissn>1558-4305</eissn><isbn>0780395190</isbn><isbn>9780780395190</isbn><abstract>This paper presents the design, implementation and performance of a time warp simulator, called DSIM, which targets clusters comprised of thousands of processors. DSIM employs a novel technique for GVT computation, called the time quantum GVT algorithm that requires no message acknowledgement, relies on constant-length messages and is efficient on clusters with large numbers of processors. Its implementation uses a technique called Local Fossil Collection to alleviate the overhead of memory reclamation and to support efficient event management. DSIM is also equipped with a simple programming interface to ease programming and debugging of simulations. Experimental results obtained on the PHOLD benchmark demonstrated that DSIM can process as many as 228 million events per second on 1033 processors.</abstract><pub>IEEE</pub><doi>10.1109/WSC.2005.1574269</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0891-7736
ispartof Proceedings of the Winter Simulation Conference, 2005, 2005, p.10 pp.
issn 0891-7736
1558-4305
language eng
recordid cdi_ieee_primary_1574269
source IEEE Xplore All Conference Series
subjects Clustering algorithms
Computational modeling
Computer simulation
Concurrent computing
Delay
Discrete event simulation
Distributed computing
Memory management
Quantum computing
Time warp simulation
title DSIM: scaling time warp to 1,033 processors
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T14%3A33%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=DSIM:%20scaling%20time%20warp%20to%201,033%20processors&rft.btitle=Proceedings%20of%20the%20Winter%20Simulation%20Conference,%202005&rft.au=Chen,%20G.&rft.date=2005&rft.spage=10%20pp.&rft.pages=10%20pp.-&rft.issn=0891-7736&rft.eissn=1558-4305&rft.isbn=0780395190&rft.isbn_list=9780780395190&rft_id=info:doi/10.1109/WSC.2005.1574269&rft_dat=%3Cieee_CHZPO%3E1574269%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i217t-89005267a27e5b7ca3a9e5d5b90b045be2fc43aed932e5038c7e3c939a16e8bb3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1574269&rfr_iscdi=true