class LocalScheduler(object):
def __init__(self, executor):
logger.debug("Initializing LocalScheduler")
self._dag = DAG()
self._inst_map = {}
self._executor = executor
def _get_class_instance(self, cls):
if cls not in self._inst_map:
self._inst_map[cls] = cls(self._executor)
inst = self._inst_map[cls]
return inst
def add_job(self, cls):
inst = self._get_class_instance(cls)
logger.debug("Registering class " + str(inst))
dependencies = inst.requires() or []
self._dag.add_node(inst)
for dep_class in dependencies:
dep = self._get_class_instance(dep_class)
self._dag.add_edge(dep, inst)
def check_valid(self):
if not self._dag.is_valid():
raise InvalidPipelineException("Pipeline contains a cycle.")
def get_state(self):
count = Counter(job.get_state() for job in self._dag.nodes_iter())
return count
def execute(self):
sorted_nodes = self._dag.get_topological_sort()
print sorted_nodes
count = self.get_state()
while not self._pipeline_finished(count):
for job in sorted_nodes:
if job.is_complete():
sorted_nodes.remove(job)
elif self._check_reqs_sat(job):
if job.get_state() not in {JobState.RUNNING, JobState.FAILED}:
job.execute()
time.sleep(1)
count = self.get_state()
logger.info(count)
def _pipeline_finished(self, count):
total_jobs = self._dag.number_of_nodes()
return total_jobs == count[JobState.DONE] or count[JobState.FAILED] > 0
def _check_reqs_sat(self, job):
parents = [self._inst_map[x].is_complete() for x in job.requires() or []]
return all(parents)
def generate_graph_b():
dag = DAG()
# add nodes
dag.add_node("A")
dag.add_node("B")
dag.add_node("C")
# add edges
dag.add_edge("B", "A")
dag.add_edge("C", "A")
return dag
def __init__(self, executor):
logger.debug("Initializing LocalScheduler")
self._dag = DAG()
self._inst_map = {}
self._executor = executor
def generate_graph_a():
# A --> C --> E
# ^ ^ \
# | | \
# B --> D F
# (c to f)
dag = DAG()
# add nodes
dag.add_node("A")
dag.add_node("B")
dag.add_node("C")
dag.add_node("D")
dag.add_node("E")
dag.add_node("F")
# add edges
dag.add_edge("A", "C")
dag.add_edge("B", "A")
dag.add_edge("B", "D")
dag.add_edge("D", "C")
dag.add_edge("C", "E")
dag.add_edge("C", "F")
return dag
