Class Hierarchy

• datk.core.distalgs.Algorithm: Abstract superclass for a distributed algorithm.
  • datk.core.distalgs.Asynchronous_Algorithm: We assume that the separate Processes take steps in an arbitrary order, at arbitrary relative speeds.
    • datk.core.algs.AsyncLCR: The LeLann, Chang and Roberts algorithm for Leader Election in an Asynchronous Ring Network
    • datk.core.algs.AsynchConvergecast: The abstract superclass of a class of Asynchronous Algorithms that propagate information from the leaves of a BFS tree to its root.
      • datk.core.algs.AsynchConvergeHeight: A Convergecast Algorithm that results in the root node, p, knowing p.state['height'], the height of the tree rooted at p.
  • datk.core.distalgs.Chain: An Algorithm that is the result of sequentially running two algorithms
  • datk.core.distalgs.Synchronous_Algorithm: We assume that Processes take steps simultaneously, that is, that execution proceeds in synchronous rounds.
    • datk.core.distalgs.Compose: A Synchonous_Algorithm that is the composition of two synchronous algorithms running in parallel.
    • datk.core.distalgs.Do_Nothing
    • datk.core.algs.FloodMax: UID flooding algorithm for Leader Election in a general network
    • datk.core.algs.LCR: The LeLann, Chang and Roberts algorithm for Leader Election in a Synchronous Ring Network
    • datk.core.algs.SynchBFS: Constructs a BFS tree with the 'leader' Process at its root
    • datk.core.algs.SynchBFSAck: Constructs a BFS tree with children pointers and the 'leader' Process at its root
    • datk.core.algs.SynchBroadcast: Broadcasts a value stored in Process, p, to the BFS tree rooted at p
    • datk.core.algs.SynchConvergecast: The abstract superclass of a class of Synchronous Algorithms that propagate information from the leaves of a BFS tree to its root.
      • datk.core.algs.SynchConvergeHeight: A Convergecast Algorithm that results in the root node, p, knowing p.state['height'], the height of the tree rooted at p.
    • datk.core.algs.SynchLubyMIS: A randomized algorithm that constructs a Maximal Independent Set
• datk.core.distalgs.Message: A Message
  • datk.core.algs.SynchBFSAck.AckParent: Acknowledge Parent
  • datk.core.algs.AsyncLCR.Leader_Declaration
  • datk.core.algs.SynchBFS.Search: Search for children
  • datk.core.algs.SynchBFSAck.Search: Search for children
• datk.core.distalgs.Network: A collection of Processes that know n, the # of processes in the network.
  • datk.core.networks.Bidirectional_Line: A Network of n Processes arranged in a line.
  • datk.core.networks.Bidirectional_Ring: A Network of n Processes arranged in a ring.
  • datk.core.networks.Complete_Graph: A Network of n Processes arranged at the vertices of a Complete undirected graph of size n.
  • datk.core.networks.Random_Line_Network: A Network of n processes arranged randomly at the vertices of a connected undirected line graph of size n.
  • datk.core.networks.Unidirectional_Line: A Network of n Processes arranged in a line.
  • datk.core.networks.Unidirectional_Ring: A Network of n Processes arranged in a ring.
• datk.core.distalgs.Process: A computing element located at a node of a network graph.