NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Parallel algorithms for simulating continuous time Markov chainsWe have previously shown that the mathematical technique of uniformization can serve as the basis of synchronization for the parallel simulation of continuous-time Markov chains. This paper reviews the basic method and compares five different methods based on uniformization, evaluating their strengths and weaknesses as a function of problem characteristics. The methods vary in their use of optimism, logical aggregation, communication management, and adaptivity. Performance evaluation is conducted on the Intel Touchstone Delta multiprocessor, using up to 256 processors.
Document ID
19930007361
Acquisition Source
Legacy CDMS
Document Type
Preprint (Draft being sent to journal)
Authors
Nicol, David M.
(College of William and Mary Williamsburg, VA., United States)
Heidelberger, Philip
(IBM Watson Research Center Yorktown Heights, NY., United States)
Date Acquired
September 6, 2013
Publication Date
November 1, 1992
Subject Category
Computer Programming And Software
Report/Patent Number
NASA-CR-189729
AD-A260713
ICASE-92-60
NAS 1.26:189729
Accession Number
93N16550
Funding Number(s)
CONTRACT_GRANT: NAS1-18605
CONTRACT_GRANT: NAG1-1060
CONTRACT_GRANT: NAG1-995
CONTRACT_GRANT: NAS1-19480
CONTRACT_GRANT: NSF CCR-92-01195
PROJECT: RTOP 505-90-52-01
CONTRACT_GRANT: NSF ASC-88-19373
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.
No Preview Available