An adaptive partitioning algorithm for conservative parallel simulation

Biocomputing techniques have been proposed to solve combinatorial problems elegantly by such methods as simulated annealing, genetic algorithm and neural networks. In this context, we identify an important optimization problem arising in conservative parallel simulation, such as partitioning, synchronization and communication overhead minimization. We propose the use of a simulated annealing algorithm with an adaptive search schedule to nd sub-optimal partitions. and present extensive simulation experiements to study its performance.