Speedup of a sparse system simulation

J. Nutaro; H. Sarjoughian

Speedup of a sparse system simulation

J. Nutaro, H. Sarjoughian

Research output: Contribution to conference › Paper › peer-review

6 Scopus citations

Abstract

Optimistic and conservative simulation algorithms have been effective for speeding up the execution of many simulation programs. Event stepped techniques have also been shown to be effective for certain types of problems. This paper presents a conjecture that sparse systems are effectively simulated by conservative and optimistic techniques, where sparseness is characterized by the ratio of output generating states to non-output generating states. The speedup results for a representative sparse simulation are shown to support this conjecture.

Original language	English
Pages	193-199
Number of pages	7
State	Published - 2001
Externally published	Yes
Event	15th Workshop on Parallel and Distributed Simulation (PADS 2001) - Lake Arrowhead, CA, United States Duration: May 15 2001 → May 18 2001

Conference

Conference	15th Workshop on Parallel and Distributed Simulation (PADS 2001)
Country/Territory	United States
City	Lake Arrowhead, CA
Period	05/15/01 → 05/18/01

Cite this

@conference{7629eed75af241f99dfebc1c4b875867,

title = "Speedup of a sparse system simulation",

abstract = "Optimistic and conservative simulation algorithms have been effective for speeding up the execution of many simulation programs. Event stepped techniques have also been shown to be effective for certain types of problems. This paper presents a conjecture that sparse systems are effectively simulated by conservative and optimistic techniques, where sparseness is characterized by the ratio of output generating states to non-output generating states. The speedup results for a representative sparse simulation are shown to support this conjecture.",

author = "J. Nutaro and H. Sarjoughian",

year = "2001",

language = "English",

pages = "193--199",

note = "15th Workshop on Parallel and Distributed Simulation (PADS 2001) ; Conference date: 15-05-2001 Through 18-05-2001",

}

TY - CONF

T1 - Speedup of a sparse system simulation

AU - Nutaro, J.

AU - Sarjoughian, H.

PY - 2001

Y1 - 2001

N2 - Optimistic and conservative simulation algorithms have been effective for speeding up the execution of many simulation programs. Event stepped techniques have also been shown to be effective for certain types of problems. This paper presents a conjecture that sparse systems are effectively simulated by conservative and optimistic techniques, where sparseness is characterized by the ratio of output generating states to non-output generating states. The speedup results for a representative sparse simulation are shown to support this conjecture.

AB - Optimistic and conservative simulation algorithms have been effective for speeding up the execution of many simulation programs. Event stepped techniques have also been shown to be effective for certain types of problems. This paper presents a conjecture that sparse systems are effectively simulated by conservative and optimistic techniques, where sparseness is characterized by the ratio of output generating states to non-output generating states. The speedup results for a representative sparse simulation are shown to support this conjecture.

UR - http://www.scopus.com/inward/record.url?scp=0034822125&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0034822125

SP - 193

EP - 199

T2 - 15th Workshop on Parallel and Distributed Simulation (PADS 2001)

Y2 - 15 May 2001 through 18 May 2001

ER -

Speedup of a sparse system simulation

Abstract

Conference

Other files and links

Fingerprint

Cite this