Document Type

Report

Date

6-1992

Embargo Period

5-7-2012

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.

Additional Information

School of Computer and Information Science, Syracuse University, SU-CIS-92-11

Source

local

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.