Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Task like finding factorial of 2000 where using BigInteger is a CPU-intensive task, is there anyway to speed-up such processes?
Ex: finding 2000!
Since it is a single task only, i think there is no need of thread here( as running this program or running this task in a thread both has to perform such CPU-intensive things).
I’ve heard that Java 7 introduced a new parallel mechanism for compute intensive tasks.
So, how do i perform this kind of things in it?
A factorial could be easily split to two tasks with a final merge. This is some kind of a map-reduce, if you like.
Example:
So you can have two tasks.
This can be generalized into any amount of parallel tasks.
This solution has nothing to do with Java in specific, it’s about converting “regular” solutions to parallel ones.