engleski

Experiments with a distributed algorithm for solving path problems

Path problems are a family of optimization and enumeration problems, which reduce to determination of paths in graphs. In this paper we evaluate experimentally a distributed algorithm for solving path problems. Our algorithm has been designed to run on a ring of processors, and its concrete implementation is based on the PVM package. We list the results of experiments, where the speedup of the algorithm has been measured on randomly generated path problems and with different numbers of processors.

graphs; path problems; parallel computing; distributed algorithms; parallel virtual machine (PVM); experiments

nije evidentirano