Assignment problems in parallel and distributed computing
Assignment problems in parallel and distributed computing
Parallel discrete-event simulation of FCFS stochastic queueing networks
PPEALS '88 Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems
Multiple-Way Network Partitioning
IEEE Transactions on Computers
Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
Optimization by simulated evolution with applications to standard cell placement
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
On a parallel partitioning technique for use with conservative parallel simulation
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Corolla partitioning for distributed logic simulation of VLSI-circuits
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
An analytical comparison of periodic checkpointing and incremental state saving
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
The communication challenge for MPP: Intel Paragon and Meiko CS-2
Parallel Computing
A Parallel Simulated Annealing Algorithm with Low Communication Overhead
IEEE Transactions on Parallel and Distributed Systems
A comparison of two methods for advancing time in parallel discrete event simulation
WSC '95 Proceedings of the 27th conference on Winter simulation
Dynamic load balancing strategies for conservative parallel simulations
Proceedings of the eleventh workshop on Parallel and distributed simulation
Multiprocessor scheduling using mean-field annealing
Future Generation Computer Systems - Special issue: Bio-inspired solutions to parallel processing problems
Load balancing for conservative simulation on shared memory multiprocessor systems
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Asynchronous distributed simulation via a sequence of parallel computations
Communications of the ACM - Special issue on simulation modeling and statistical computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Parallel Simulated Annealing using Speculative Computation
IEEE Transactions on Parallel and Distributed Systems
On Process Migration and Load Balancing in Time Warp
IEEE Transactions on Parallel and Distributed Systems
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Parallel simulation on the hypercube multiprocessor
Distributed Computing
A parallel computing engine for a class of time critical processes
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
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.