Uses of Class
edu.isi.pegasus.planner.partitioner.graph.GraphNode

Packages that use GraphNode
edu.isi.pegasus.planner.cluster   
edu.isi.pegasus.planner.parser.dax   
edu.isi.pegasus.planner.partitioner   
edu.isi.pegasus.planner.partitioner.graph   
edu.isi.pegasus.planner.refiner   
edu.isi.pegasus.planner.selector.site.heft   
 

Uses of GraphNode in edu.isi.pegasus.planner.cluster
 

Methods in edu.isi.pegasus.planner.cluster with parameters of type GraphNode
static Partitioner ClustererFactory.loadPartitioner(PegasusProperties properties, String type, GraphNode root, Map graph)
          Loads the appropriate partitioner on the basis of the clustering type specified in the options passed to the planner.
 

Uses of GraphNode in edu.isi.pegasus.planner.parser.dax
 

Fields in edu.isi.pegasus.planner.parser.dax declared as GraphNode
protected  GraphNode DAX2Graph.mRoot
          The root node for the graph that is constructed.
 

Methods in edu.isi.pegasus.planner.parser.dax that return GraphNode
 GraphNode DAX2NewGraph.get(String key)
          Returns the GraphNode of the corresponding id.
 

Uses of GraphNode in edu.isi.pegasus.planner.partitioner
 

Fields in edu.isi.pegasus.planner.partitioner declared as GraphNode
private  GraphNode Partition.mLastAddedNode
          A pointer to the last added node to the partition.
protected  GraphNode Partitioner.mRoot
          The root node of the graph from where to start the BFS.
 

Methods in edu.isi.pegasus.planner.partitioner that return GraphNode
 GraphNode Partition.lastAddedNode()
          Returns the last added node to the partition.
 

Methods in edu.isi.pegasus.planner.partitioner with parameters of type GraphNode
 void Partition.addNode(GraphNode node)
          Adds a node to the partition.
private  String Label.getLabel(GraphNode node)
          Returns the label for the node.
static Partitioner PartitionerFactory.loadInstance(PegasusProperties properties, GraphNode root, Map graph, String className)
          Loads the implementing class corresponding to the type specified by the user.
 

Constructors in edu.isi.pegasus.planner.partitioner with parameters of type GraphNode
BFS(GraphNode root, Map graph, PegasusProperties properties)
          The overloaded constructor.
Horizontal(GraphNode root, Map graph, PegasusProperties properties)
          The overloaded constructor.
Label(GraphNode root, Map graph, PegasusProperties properties)
          The overloaded constructor.
One2One(GraphNode root, Map graph, PegasusProperties properties)
          The overloaded constructor.
Partitioner(GraphNode root, Map graph, PegasusProperties properties)
          The overloaded constructor.
Whole(GraphNode root, Map graph, PegasusProperties properties)
          The overloaded constructor.
 

Uses of GraphNode in edu.isi.pegasus.planner.partitioner.graph
 

Fields in edu.isi.pegasus.planner.partitioner.graph with type parameters of type GraphNode
private  List<GraphNode> TopologicalSortIterator.mQueue
          The internal list of nodes that contains the nodes to be traversed.
 

Methods in edu.isi.pegasus.planner.partitioner.graph that return GraphNode
 GraphNode Graph.getNode(String identifier)
          Returns the node matching the id passed.
 GraphNode MapGraph.getNode(String identifier)
          Returns the node matching the id passed.
 

Methods in edu.isi.pegasus.planner.partitioner.graph that return types with arguments of type GraphNode
 List<GraphNode> GraphNode.getChildren()
          Returns a list of GraphNode objects that are children of the node.
 List<GraphNode> Graph.getLeaves()
          Returns the leaf nodes of the Graph.
 List<GraphNode> GraphNode.getParents()
          Returns a list of GraphNode objects that are parents of the node.
 List<GraphNode> Graph.getRoots()
          Returns the root nodes of the Graph.
 Iterator<GraphNode> Graph.iterator()
          Returns an iterator that traverses through the graph using a graph traversal algorithm.
 Iterator<GraphNode> Graph.nodeIterator()
          Returns an iterator for the nodes in the Graph.
 Iterator<GraphNode> Graph.topologicalSortIterator()
          Returns an iterator for the graph that traverses in topological sort order.
 Iterator<GraphNode> MapGraph.topologicalSortIterator()
          Returns an iterator for the graph that traverses in topological sort order.
 

Methods in edu.isi.pegasus.planner.partitioner.graph with parameters of type GraphNode
 void GraphNode.addChild(GraphNode child)
          Adds a child to end of the child list.
 void Graph.addNode(GraphNode node)
          Adds a node to the Graph.
 void MapGraph.addNode(GraphNode node)
          Adds a node to the Graph.
 void GraphNode.addParent(GraphNode parent)
          Adds a parent to end of the parent list.
 void Graph.addRoot(GraphNode root)
          Adds a single root node to the Graph.
 void MapGraph.addRoot(GraphNode root)
          Adds a single root node to the Graph.
 void GraphNode.removeChild(GraphNode child)
          Removes a child linkage to the node.
 void GraphNode.removeParent(GraphNode parent)
          Removes a parent linkage to the node.
 

Uses of GraphNode in edu.isi.pegasus.planner.refiner
 

Methods in edu.isi.pegasus.planner.refiner that return types with arguments of type GraphNode
private  List<GraphNode> DataReuseEngine.getJobsInRC(Graph workflow, Set filesInRC)
          Returns all the jobs whose output files exist in the Replica Catalog.
 

Methods in edu.isi.pegasus.planner.refiner with parameters of type GraphNode
protected  boolean DataReuseEngine.transferOutput(GraphNode node)
          Returns whether a user wants output transferred for a node or not.
 

Method parameters in edu.isi.pegasus.planner.refiner with type arguments of type GraphNode
protected  Graph DataReuseEngine.cascadeDeletionUpwards(Graph workflow, List<GraphNode> originalJobsInRC)
          Cascade the deletion of the jobs upwards in the workflow.
 

Uses of GraphNode in edu.isi.pegasus.planner.selector.site.heft
 

Methods in edu.isi.pegasus.planner.selector.site.heft with parameters of type GraphNode
protected  long[] Algorithm.calculateEstimatedStartAndFinishTime(GraphNode node, String site)
          Estimates the start and finish time of a job on a site.
protected  float Algorithm.computeDownwardRank(GraphNode node)
          Computes the downward rank of a node.
 



Copyright © 2011 The University of Southern California. All Rights Reserved.