• Summary
• Related Documents
  • Active Bibliography
  • Co-citation
• Version History

Popular Tags

Add a tag:

No tags have been applied to this document.

BibTeX | Add To MetaCart

@MISC{Lea00ajava,
    author = {Doug Lea},
    title = {A Java Fork/Join Framework},
    year = {2000}
}

Bookmarks

         

OpenURL

 

Abstract:

This paper describes the design, implementation, and performance of a Java framework for supporting a style of parallel programming in which problems are solved by (recursively) splitting them into subtasks that are solved in parallel, waiting for them to complete, and then composing results. The general design is a variant of the work-stealing framework devised for Cilk. The main implementation techniques surround efficient construction and management of tasks queues and worker threads. The measured performance shows good parallel speedups for most programs, but also suggests possible improvements. 1. INTRODUCTION Fork/Join parallelism is among the simplest and most effective design techniques for obtaining good parallel performance. Fork/join algorithms are parallel versions of familiar divideand -conquer algorithms, taking the typical form: Result solve(Problem problem) { if (problem is small) directly solve problem else { split problem into independent parts fork new subtas...

Citations