返回
An adaptive partitioning algorithm for distributed discrete event simulation systems
DOI:10.1006/jpdc.2002.1856.png)
摘要
En 中文
Biocomputing techniques have been proposed to solve combinatorial problems elegantly by such methods as simulated annealing, genetic algorithms and neural networks. In this context, we identify an important optimization problem arising in conservative distributed simulation, such as partitioning, synchronization and communication overhead minimization. We propose the use of a simulated annealing algorithm with an adaptive search schedule to find good (sub-optimal) partitions. The paper discusses the algorithms, its implementation and reports on the performance results of simulation of several workload models on a multiprocessor machine. The results obtained indicate clearly that a partitioning which make use of our simulated annealing significantly reduces the running time of a conservative simulation, and decreases the synchronization overhead of the simulation model when compared to Nandy-Louck's partitioning algorithm. (C) 2002 Elsevier Science (USA)
Keyword:
DESIGN
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
Adsorption of Cu(II), Pb(II), and Cd(II) Ions from Acidic Aqueous Solutions by Diethylenetriaminepentaacetic Acid-Modified Magnetic Graphene Oxide二乙烯三胺五乙酸改性的磁性氧化石墨烯对酸性水溶液中Cu(II),Pb(II) 和Cd(II) 离子的吸附
Extensive lithium disorder in Li1.5Fe0.5Ti1.5(PO4)3Nasicon by neutron diffraction, and the Li1+xFexTi2−x(PO4)3phase diagramLi1.5Fe0.5Ti1.5(PO4)3Nasicon中的广泛锂无序通过中子衍射,li 1 xFexTi 2-x (PO4)3 相图

