Implementing an Application: Brute-Force Factoring

  To test and demonstrate this framework, we wrote a simple application that factors a Java long integer N by dividing the search space $\{1,...,\sqrt{N}\}$ into fixed-sized work packets which are executed by the work engines. This problem, inspired by [28], although somewhat unrealistic, was chosen because its simplicity and predictability make it easy to measure performance and analyze results.