Title

On Random Sampling For Parallel Simulated Annealing

Abstract

In this paper, we investigate the parallelism of simulated annealing for graph partitioning. A random sampling technique, in which disjoint partitions of the graph are distributed across the processors so that moves can be proposed and evaluated asynchronously in distinct processors, is proposed. Synchronizations among processors are not necessary until the equilibrium is reached at each processor. Furthermore, since no interacting moves can occur in our strategy, it is obvious that our scheme is free of errors in cost evaluation.

Publication Date

1-1-1994

Publication Title

Proceedings of the International Conference on Parallel Processing

Number of Pages

253-257

Document Type

Article; Proceedings Paper

Identifier

scopus

Personal Identifier

scopus

Socpus ID

0028058329 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0028058329

This document is currently not available here.

Share

COinS