Concurrent and Parallel Programming

The ForkJoinPool in Java 7 provides a divide and conquer algorithm that can be used to implement concurrent solutions to problems. Briefly explain how this works and use it to implement a solution to find the minimum value in a huge array. (The appendix to this paper provides a template for a RecursiveTask that can be used to write your solution.)

Appendix A Template for ForkJoin Pool Task class extends Recursive TaskV> { static final int BaseBlockSize = ... --X //constructor } protected compute() { if(... left = new ...); Name> right = new -); left.fork(); right.fork(); = left.join(); return