yartiss.engine.simulation.system.schedulable

Class GraphTask

java.lang.Object

yartiss.engine.simulation.system.AbstractTask

yartiss.engine.simulation.system.PeriodicTask

yartiss.engine.simulation.system.schedulable.GraphTask

All Implemented Interfaces:

ITaskElement, ITask

public class GraphTask
extends PeriodicTask
implements ITaskElement

Real-time task of graph model

Author:

Manar Qamhieh

Field Summary

Fields inherited from class yartiss.engine.simulation.system.AbstractTask

consumptionProfile

Constructor Summary

Constructors

Constructor and Description
GraphTask(GraphTask graphTask)
GraphTask(long firstrelease, long wcee, long period, long deadline, int priority, ArrayList<SubTask> subtasks, IEnergyConsumptionProfile p)

Method Summary

Methods

Modifier and Type	Method and Description
void	accept(ITaskElementVisitor visitor) Accept function for the visitable element
void	activate(long time) Activates a job of this task with a release time of 'time' units
void	addEdge(SubTask parent, SubTask child) Adds a directed edge between 2 subtasks in the graph
void	addTask(SubTask subtask) Adds a subtask to the graph
void	calculateCriticalPath()
boolean	canAddEdge(SubTask subtask1, SubTask subtask2) Verify if an edge can be created between 2 subtasks in a graph an edge can't be created if 2 subtasks share the same parent
ITask	cloneTask() Duplicates the task's object
SubTask	getEndingSubtask() Gets the ending subtask of a graph which is the subtask with no children subtasks graph has one ending subtask
long	getLaxity() Laxity of a graph is the difference between its deadline and its latest finish time after calculating the critical path
long	getSlack() Gets the slack time of the graph, which is equal to the latest or earliest finish time of the ending task after calculating the critical path of the graph.
SubTask	getStartingSubtask() Gets the starting subtask of a graph which is the subtask with no parent subtasks graph has one starting subtask
ArrayList<SubTask>	getSubtasks() Gets the subtasks of the graph
String	getType() Gets the type of the task (simple, subtask, graph, ...)
void	parallelizeGraph()
void	printCriticalInfo() Prints the earliest and the latest execution time of a subtask to finish in a graph
void	removeEdge(SubTask parent, SubTask child) Removes a directed edge between 2 subtasks in the graph
void	removeTask(SubTask subtask) Removes a subtask from the graph and its edges
String	toString()

Methods inherited from class yartiss.engine.simulation.system.PeriodicTask

getDensity, getUtilization, isArbitraryDeadline, isConstrainedDeadline, isImplicitDeadline

Methods inherited from class yartiss.engine.simulation.system.AbstractTask

checkDeadlineMissed, getActiveJobs, getCurrentJob, getDeadline, getEnergyConsumption, getEnergyConsumptionProfile, getEnergyConsumptionRate, getFirstRelease, getId, getLastExecutedJob, getNextAbsoluteDeadline, getNextActivation, getNextDeadline, getPeriod, getPreviousAbsoluteDeadline, getPriority, getRemainingCost, getWcee, getWcet, isActivationTime, isActive, lastExecutedJobHasCompleted, setEnergyConsumptionProfile, setFirstRelease, setId, setLastExecutedJob, setPriority

Methods inherited from class java.lang.Object

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

Constructor Detail

GraphTask

public GraphTask(long firstrelease,
         long wcee,
         long period,
         long deadline,
         int priority,
         ArrayList<SubTask> subtasks,
         IEnergyConsumptionProfile p)

GraphTask

public GraphTask(GraphTask graphTask)

Method Detail

getSubtasks

public ArrayList<SubTask> getSubtasks()

Gets the subtasks of the graph

Returns:

subtasks of a graph

getStartingSubtask

public SubTask getStartingSubtask()

Gets the starting subtask of a graph which is the subtask with no parent subtasks graph has one starting subtask

Returns:

starting subtask of a graph

getEndingSubtask

public SubTask getEndingSubtask()

Gets the ending subtask of a graph which is the subtask with no children subtasks graph has one ending subtask

Returns:

ending subtask of a graph

getSlack

public long getSlack()

Gets the slack time of the graph, which is equal to the latest or earliest finish time of the ending task after calculating the critical path of the graph.

Returns:

slack time of the graph

removeTask

public void removeTask(SubTask subtask)

Removes a subtask from the graph and its edges

Parameters:

subtask - subtask to be removed

addTask

public void addTask(SubTask subtask)

Adds a subtask to the graph

Parameters:

subtask - subtask to be added

addEdge

public void addEdge(SubTask parent,
           SubTask child)

Adds a directed edge between 2 subtasks in the graph

Parameters:

parent - parent subtask

child - child subtask

removeEdge

public void removeEdge(SubTask parent,
              SubTask child)

Removes a directed edge between 2 subtasks in the graph

Parameters:

parent - parent subtask

child - child subtask

canAddEdge

public boolean canAddEdge(SubTask subtask1,
                 SubTask subtask2)

Verify if an edge can be created between 2 subtasks in a graph an edge can't be created if 2 subtasks share the same parent

Parameters:

subtask1 - first subtask

subtask2 - second subtask

Returns:

true if an edge can be created, false otherwise

calculateCriticalPath

public void calculateCriticalPath()

parallelizeGraph

public void parallelizeGraph()

printCriticalInfo

public void printCriticalInfo()

Prints the earliest and the latest execution time of a subtask to finish in a graph

toString

public String toString()

Overrides:

toString in class Object

cloneTask

public ITask cloneTask()

Description copied from interface: ITask

Duplicates the task's object

Specified by:

cloneTask in interface ITask

Returns:

clones task

accept

public void accept(ITaskElementVisitor visitor)

Accept function for the visitable element

Specified by:

accept in interface ITaskElement

getType

public String getType()

Description copied from interface: ITask

Gets the type of the task (simple, subtask, graph, ...)

Specified by:

getType in interface ITask

Specified by:

getType in class AbstractTask

Returns:

task's type

getLaxity

public long getLaxity()

Laxity of a graph is the difference between its deadline and its latest finish time after calculating the critical path

Specified by:

getLaxity in interface ITask

Returns:

laxity of the task

activate

public void activate(long time)

Description copied from interface: ITask

Activates a job of this task with a release time of 'time' units

Specified by:

activate in interface ITask

Overrides:

activate in class AbstractTask

Parameters:

time - time units