Document Type
Report
Date
6-1992
Keywords
Multicomputer algorithms, Monte Carlo trials, Simulated annealing, Primality testing, Computing Surface
Language
English
Disciplines
Computer Sciences
Description/Abstract
The best results of Monte Carlo methods are generally obtained by performing the same computation many times with different random numbers. We develop a generic algorithm for parallel execution of Monte Carlo trials on a multicomputer. The generic algorithm has been adapted for simulated annealing and primality testing by simple substitutions of data types and procedures. The performance of the parallel algorithms was measured on a Computing Surface.
Recommended Citation
Hansen, Per Brinch, "Parallel Monte Carlo Trials" (1992). Electrical Engineering and Computer Science - Technical Reports. 171.
https://surface.syr.edu/eecs_techreports/171
Source
local
Additional Information
School of Computer and Information Science, Syracuse University, SU-CIS-92-11