channing/MonteCarloParallelPCP1
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
Parallelization of Monte Carlo Minimization Search in Java.
1 commit 1 branch 0 tags 527 KiB
Find a file
Exact
Channing Bellamy 0d84ea82bf add files
2026-01-11 15:38:53 +02:00
src add files 2026-01-11 15:38:53 +02:00
Makefile add files 2026-01-11 15:38:53 +02:00
README.md add files 2026-01-11 15:38:53 +02:00
Report.pdf add files 2026-01-11 15:38:53 +02:00

README.md

Parallelization of Monte Carlo Minimization Search

Please see the report for more information.

To compile this program, run "make". Ensure your system has a Java compiler and runtime located at /usr/bin/javac and /usr/bin/java respectively. It is assumed you are using GNU make.

To run this program, either change into the bin directory and run "java MonteCarloMinimizationParallel ", or run "java -cp bin/ MonteCarloMinimizationParallel " from the root program directory that this README.txt file is in.

Replace with the program arguments: rows columns xmin xmax ymin ymax search_density

Where rows, columns are the number of rows/columns in the grid, xmin, xmax, ymin, ymax are the boundaries of the rectangular terrain area, and search_density is the number of searches per grid point

Example: "java -cp bin/ MonteCarloMinimizationParallel 1000 1000 0 1000 0 1000 0.1"

When using large grid/search sizes, the JVM may require more memory to be allocated. Preallocating the memory upfront by adding "-XX:+AlwaysPreTouch" may result in more consistent performance. For example: "java -Xmx12G -Xms12G -XX:+AlwaysPreTouch -cp bin/ MonteCarloMinimizationParallel 20000 20000 0 20000 0 20000 0.5" Preallocates 12G of memory and searches a 20000x20000 grid with 0.5 search density.