Class FibonacciTask

java.lang.Object

java.util.concurrent.ForkJoinTask<Long>

java.util.concurrent.RecursiveTask<Long>

topics.parallel.fibonacci.FibonacciTask

All Implemented Interfaces:

Serializable, Future<Long>

public class FibonacciTask
extends RecursiveTask<Long>

Parallel Fibonacci (Fork/Join)

Computes the Fibonacci sequence utilizing Java's Fork/Join parallel execution model. The task recursively splits the workload into smaller asynchronous sub-tasks until a predefined granularity threshold is reached, at which point it delegates the computation to the sequential algorithm.

Author:

vicegd

See Also:

• FibonacciAlgorithm
• Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from interface Future

Future.State

Constructor Summary

Constructors

Constructor	Description
FibonacciTask(int targetIndex)	Initializes the parallel task.

Method Summary

Modifier and Type	Method	Description
protected Long	compute()	The primary computation logic that dictates whether to fork the problem or solve it sequentially.

Methods inherited from class RecursiveTask

exec, getRawResult, setRawResult

Methods inherited from class ForkJoinTask

adapt, adapt, adapt, adaptInterruptible, adaptInterruptible, adaptInterruptible, cancel, compareAndSetForkJoinTaskTag, complete, completeExceptionally, exceptionNow, fork, get, get, getException, getForkJoinTaskTag, getPool, getQueuedTaskCount, getSurplusQueuedTaskCount, helpQuiesce, inForkJoinPool, invoke, invokeAll, invokeAll, invokeAll, isCancelled, isCompletedAbnormally, isCompletedNormally, isDone, join, peekNextLocalTask, pollNextLocalTask, pollSubmission, pollTask, quietlyComplete, quietlyInvoke, quietlyJoin, quietlyJoin, quietlyJoinUninterruptibly, reinitialize, resultNow, setForkJoinTaskTag, state, tryUnfork

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

FibonacciTask

public FibonacciTask(int targetIndex)

Initializes the parallel task.

Note: Accepting a primitive int instead of an object instance significantly reduces heap memory allocation and Garbage Collector pressure during deep recursion.

Parameters:

targetIndex - The mathematical index (N) to compute.

Method Details

compute

protected Long compute()

The primary computation logic that dictates whether to fork the problem or solve it sequentially.

Specified by:

compute in class RecursiveTask<Long>

Returns:

The computed Fibonacci sequence value.