Hierarchical partitioning algorithm for optimistic distributed simulation of DEVS models

Cited 11 time in webofscience Cited 0 time in scopus
  • Hit : 308
  • Download : 1
The partitioning problem of models is one of the most important issues which may affect the performance of distributed simulation. This paper presents a novel partitioning algorithm for the optimistic distributed simulation of hierarchical, modular Discrete Event System Specification (DEVS) models. The proposed algorithm pursues the following three goals to achieve the overall objective of the minimum simulation time: (1) to balance the computational loads of partitions, (2) to maximize the parallel execution of independent models, and (3) to minimize inter-processor communication. To maximize parallel execution of independent models, the proposed algorithm utilizes the hierarchical structural information of models available from the hierarchical model design methodology of the DEVS formalism. Through benchmark simulation experiments, we show that the proposed algorithm achieves good performance.
Publisher
ELSEVIER SCIENCE BV
Issue Date
1998-03
Language
English
Article Type
Article
Keywords

TIME

Citation

JOURNAL OF SYSTEMS ARCHITECTURE, v.44, no.6-7, pp.433 - 455

ISSN
1383-7621
URI
http://hdl.handle.net/10203/12824
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 11 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0