Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A time-division algorithm for parallel simulation

A time-division algorithm for parallel simulation TECHNICAL NOTE A Time-Division Simulation YI-BING University LIN and EDWARD of Washington, Algorithm for Parallel D. LAZOWSKA Seattle Most parallel simulation are based if the time algorithm constraints. that algorithms Another partitions For and (e.g., Chandy approach. and Misra ™s algorithm of this approach, matching, simulated or the approach may Time provide that Warp more linear is to algorithm) parallelism simulation speed into integrate algorithm), Categories chronwation; on a œspace-division  domain The parallelism is limited parallel by the causality approach, the time the œtime-division  partitioned. domain the via best state the is appropriately a complex œspace-division  may system is simulated We present parallel a time-division We show system approach. up can be achieved. œtime-division  subsystems; while and several system, simulation approach algorithms: be simulated by the is partitioned (e. g., our a subsystem by the time-division space-division Systems]: message approach the overall Subject Descriptors: D.4. 1 [Operating Process sending; Management “synted systems; D.4. 7 [Operating Systems]: Organization and Design ” distribu D.4. 14 [Operating by Abstract General Additional tion, systems]: Devices]: Communication Modes Management “ F. 1.2 [Computation of Computation “parallelism Terms: Key Performance Words time and Phrases: Discrete event simulation, parallel simulation, regenera- http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Modeling and Computer Simulation (TOMACS) Association for Computing Machinery

A time-division algorithm for parallel simulation

Download PDF
11 pages

Loading next page...
 
/lp/association-for-computing-machinery/a-time-division-algorithm-for-parallel-simulation-m3bDR0xk8C
Publisher
Association for Computing Machinery
Copyright
Copyright © 1991 by ACM Inc.
ISSN
1049-3301
DOI
10.1145/102810.214307
Publisher site
See Article on Publisher Site

Abstract

TECHNICAL NOTE A Time-Division Simulation YI-BING University LIN and EDWARD of Washington, Algorithm for Parallel D. LAZOWSKA Seattle Most parallel simulation are based if the time algorithm constraints. that algorithms Another partitions For and (e.g., Chandy approach. and Misra ™s algorithm of this approach, matching, simulated or the approach may Time provide that Warp more linear is to algorithm) parallelism simulation speed into integrate algorithm), Categories chronwation; on a œspace-division  domain The parallelism is limited parallel by the causality approach, the time the œtime-division  partitioned. domain the via best state the is appropriately a complex œspace-division  may system is simulated We present parallel a time-division We show system approach. up can be achieved. œtime-division  subsystems; while and several system, simulation approach algorithms: be simulated by the is partitioned (e. g., our a subsystem by the time-division space-division Systems]: message approach the overall Subject Descriptors: D.4. 1 [Operating Process sending; Management “synted systems; D.4. 7 [Operating Systems]: Organization and Design ” distribu D.4. 14 [Operating by Abstract General Additional tion, systems]: Devices]: Communication Modes Management “ F. 1.2 [Computation of Computation “parallelism Terms: Key Performance Words time and Phrases: Discrete event simulation, parallel simulation, regenera-

Journal

ACM Transactions on Modeling and Computer Simulation (TOMACS) – Association for Computing Machinery

Published: Jan 3, 1991

There are no references for this article.