An adaptive partitioning algorithm for distributed discrete event simulation systems.

DOI10.1006/JPDC.2002.1856MaRDI QIDQ1867342zbMATH OpenOpenAlexFDO

Authors Azzedine Boukerche

Publication date 2 April 2003

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.2002.1856

zbMATH Keywords

simulated annealing algorithmadaptive search schedule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Recommendations

• The distributed simulation of clustered processes
• Assignment of program modules to processors: a simulated annealing approach.
• Conservative Parallel Simulation of a Large Number of Processes
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• A parallel algorithm of simulated annealing for multiprocessor scheduling

Cited in

(2)

• Algorithm for adaptive mesh redistribution in lattice Boltzmann simulations
• Adaptive protocols for parallel discrete event simulation

This page was built for publication: An adaptive partitioning algorithm for distributed discrete event simulation systems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1867342)