Package alg

Class DFSTask

java.lang.Object

java.util.concurrent.ForkJoinTask<java.lang.Void>

java.util.concurrent.RecursiveAction

alg.DFSTask

public class DFSTask
extends java.util.concurrent.RecursiveAction

The DFS Task class provides a fork-join recursive action for the DFS / BB A* algorithm

Author:

Matt Frost

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor	Description
DFSTask(ScheduleGrph input, PartialScheduleGrph current, PartialScheduleGrph best, CostFunction cost, java.util.HashSet<java.lang.String> closed, int numProcessors, int lastAdded, java.util.concurrent.atomic.AtomicLong lowerBound, java.util.concurrent.atomic.AtomicLong iterations)	Sets up the DFS task without visualization
DFSTask(ScheduleGrph input, PartialScheduleGrph current, PartialScheduleGrph best, CostFunction cost, java.util.HashSet<java.lang.String> closed, int numProcessors, int lastAdded, java.util.concurrent.atomic.AtomicLong lowerBound, java.util.concurrent.atomic.AtomicLong iterations, ScheduleListener listen)	Sets up the DFS task with visualization

Method Summary

Methods inherited from class java.util.concurrent.ForkJoinTask

adapt, adapt, adapt, cancel, compareAndSetForkJoinTaskTag, complete, completeExceptionally, fork, get, get, getException, getForkJoinTaskTag, getPool, getQueuedTaskCount, getSurplusQueuedTaskCount, helpQuiesce, inForkJoinPool, invoke, invokeAll, invokeAll, invokeAll, isCancelled, isCompletedAbnormally, isCompletedNormally, isDone, join, quietlyComplete, quietlyInvoke, quietlyJoin, reinitialize, setForkJoinTaskTag, tryUnfork

Methods inherited from class java.lang.Object

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

Methods inherited from class java.util.concurrent.RecursiveAction

getRawResult

Constructor Detail

DFSTask

public DFSTask(ScheduleGrph input,
               PartialScheduleGrph current,
               PartialScheduleGrph best,
               CostFunction cost,
               java.util.HashSet<java.lang.String> closed,
               int numProcessors,
               int lastAdded,
               java.util.concurrent.atomic.AtomicLong lowerBound,
               java.util.concurrent.atomic.AtomicLong iterations)

Sets up the DFS task without visualization

Parameters:

input - The input graph to run the algorithm on

current - The current partial schedule to explore

best - The current best schedule found

cost - The cost function being used

closed - The set of closed states

numProcessors - The number of available processors to schedule tasks on

lastAdded - The most recently added task on the current schedule

lowerBound - The current lower bound estimate

iterations - The current number of iterations

DFSTask

public DFSTask(ScheduleGrph input,
               PartialScheduleGrph current,
               PartialScheduleGrph best,
               CostFunction cost,
               java.util.HashSet<java.lang.String> closed,
               int numProcessors,
               int lastAdded,
               java.util.concurrent.atomic.AtomicLong lowerBound,
               java.util.concurrent.atomic.AtomicLong iterations,
               ScheduleListener listen)

Sets up the DFS task with visualization

Parameters:

input - The input graph to run the algorithm on

current - The current partial schedule to explore

best - The current best schedule found

cost - The cost function being used

closed - The set of closed states

numProcessors - The number of available processors to schedule tasks on

lastAdded - The most recently added task on the current schedule

lowerBound - The current lower bound estimate

iterations - The current number of iterations

listen - The ScheduleListener to register with this object