Java 7 Fork/Join and Java 8 Streams Applied to Merge Sort Fork/Join The fork/join framework from Java 7 has been on my list of things to check out for a while now. Basically, it provides an easy way to parallelize work that can be broken up into smaller parts. Work is distributed to threads in a pool, and idle threads can steal work from busy threads (work stealing). There are many parallel algorithms and I decided to try parallel merge sort . I have two processors, so I would expect to see some speedup over the canonical top-down merge sort .
Read full article from Java 7 Fork/Join and Java 8 Streams Applied to Merge Sort | programming opiethehokie
No comments:
Post a Comment