a static partitioning and mapping algorithm for conservative parallel simulations
In this paper, we consider the problem of partitioning a conservative parallel simulation for execution on a multi-computer. The synchronization protocol makes use of null messages [6]. We propose the use of a simulated annealing algorithm with an adaptive search schedule to find good (sub-optimal) partitions. The paper discusses the algorithm, its implementation and reports on the performance results of simulations of a partitioned FCFS queueing network model executed on iPSC/860 hypercube. The results obtained are compared with a random partitioning. They show that a partitioning which makes use of our simulated annealing algorithm results in a reduction of 25-35\% of the running time of the simulations when compared to the running time of a random partition of the model.
partition map algorithm parallel simulation parallel simulation paper synchronization use message simulated annealing adapt search scheduling implementation performance queue network model model hypercube randomization reduction timing computation optimality