×

Reachability-Based Coordination for Cyclic Dataflow

  • US 20140172939A1
  • Filed: 12/17/2012
  • Published: 06/19/2014
  • Est. Priority Date: 12/17/2012
  • Status: Active Grant
First Claim
Patent Images

1. A computer-readable storage medium storing computer-executable instructions that, when executed by a processor, configure the processor to perform operations comprising:

  • scheduling a plurality of processes each comprising a plurality of threads to operate independently on discrete partitions of data;

    responsive to a first thread of the plurality of threads receiving a first partition of the data, the first thread beginning an operation on the first partition of the data;

    responsive to a second thread of the plurality of threads receiving a second partition of the data, the second thread beginning the operation on the second partition of the data;

    tracking progress of the operation using a replicated data structure at each thread, the replicated data structure comprising an epoch-iteration tuple;

    storing the epoch-iteration tuple as a timestamp in the replicated data structure corresponding to records for processing at each thread;

    determining a number of yet to be processed records from the replicated data structure for at least one of the first thread or the second thread; and

    when the number of yet to be processed records for the first thread or the second thread reaches zero and the tuple includes the highest iteration in the replicated data structure for the thread, terminating the thread.

View all claims
  • 3 Assignments
Timeline View
Assignment View
    ×
    ×