Applying scheduling by edge reversal to constraint partitioning

  • Pereira M
  • Vargas P
  • França F
 et al. 
  • 4

    Readers

    Mendeley users who have this article in their library.
  • 3

    Citations

    Citations of this article.

Abstract

Scheduling by Edge Reversal {(SER)} is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses {SER} to perform constraint partitioning of Constraint Satisfaction Problems {(CSP).} In order to apply the {SER} mechanism, the graph representing the constraints must receive an acyclic orientation. Since obtaining an optimal acyclic orientation is an {NP-hard} problem, this work studies three non-deterministicstrategies known in the literature: {Alg-Neigh,} {Alg-Edges,} and {Alg-Colour.} We implemented the three algorithms and the {SER} scheduling mechanism, applying them to the {CSP} constraint networks generated from 3 applications. Our results show that {SER} has a great potential to perform a good partitioning of the constraint graphs.

Author-supplied keywords

  • Concurrent computing
  • Distributed algorithms
  • Distributed computing
  • NP-hard problem
  • Partitioning algorithms
  • Processor scheduling
  • Programming environments
  • Scheduling algorithm
  • System recovery
  • Time factors

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free