Abstract | ||
---|---|---|
Conservative parallel simulation protocols are such that each logical process (LP) in the simulation execute events only when it is certain that there will not be any time-order causality violation. In these conservative protocols, time-bound information for an LP is computed from the other LPs. We propose a variant form of conservative parallel simulation protocol in which the time-bound for an LP is computed from the existing events in the system. In a conservative protocol such as the Chandy-Misra-Bryant (CMB) protocol, it can be difficult for LPi to guarantee different time-bounds to its next LPs. The time-bounds to some LPs may be more restrictive than necessary. If the time-bounds are provided by the entities (events) going through the system (as in our proposed algorithm), an event E at LPi can independently supply different time-bounds only to those LPs which may receive events generated by E. We describe the algorithm, outline a proof of its correctness and discuss its possible strengths and weaknesses |
Year | DOI | Venue |
---|---|---|
1998 | 10.1109/HIPC.1998.738018 | HiPC |
Keywords | Field | DocType |
different time-bounds,protocols,computer integrated manufacturing,conservative parallel simulation algorithm,parallel conservative simulation,conservative protocols,conservative protocol,manufacturing simulation,existing event,logical process,event e,chandy-misra-bryant protocol,parallel algorithms,time-order causality violation,proposed algorithm,conservative parallel simulation protocol,time-bounds,next lps,digital simulation,time-bound information,possible strength,entity-oriented modeling,correctness proof,concurrent computing,computational modeling,discrete event simulation,read only memory | Causality,Read-only memory,Computer science,Correctness,Theoretical computer science,Electrical capacitance tomography,Distributed computing,Parallel algorithm,Parallel computing,Computer-integrated manufacturing,Algorithm,Concurrent computing,Discrete event simulation | Conference |
ISSN | ISBN | Citations |
1094-7256 | 0-8186-9194-8 | 2 |
PageRank | References | Authors |
0.44 | 4 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Chu-Cheow Lim | 1 | 168 | 14.45 |
Yoke-Hean Low | 2 | 54 | 7.74 |
Boon-Ping Gan | 3 | 68 | 9.08 |