A Java Fork/Join Framework

This paper describes the design and implementation of Fork/join framework that support a parallel solution to the classical divide and conquer style problems. Those problems can be divided into subtasks that are solved in parallel and the subtask's results combined at the end to produce the final result. I believe this is the most basic and intuitive type of parallel programming. The authors claim that the framework is efficient, support scalable parallel processing and provide a simple API to the programmer. However I think that little details on the performance analysis and scalability test was done only on a single JVM. So It is hard to tell how well this system really perform and how scalable it is. I think this is a weakness for this paper because such a work should have focused on showing how this framework handles more efficiently Fork/join applications compared to traditional thread frameworks who have more overhead than required by Fork/join.