A static partitioning and mapping algorithm for conservative parallel simulations

  • Authors:
  • Azzedine Boukerche;Carl Tropper

  • Affiliations:
  • School of Computer Science, McGill University, Montreal, Canada;School of Computer Science, McGill University, Montreal, Canada

  • Venue:
  • PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.