Microsoft Technology Licensing, LLC

Jieqing Wang

Cheng Huang

Shane Kumar Mainali

Aaron William Ogus

Jacob Rubin Lorch

Krishnan Varadarajan

Venkates Paramasivam Balakrishnan

Garret Buban

Quan Zhang

Zichen Sun

Henning Klein

Mauricio David Zaragoza Ibarra

Various embodiments, methods and systems for implementing distributed data synchronization in a distributed computing system, are provided. In operation, a data record of a first data set is accessed. The data record is encoded to generate, for a first distributed invertible bloom filter ('DIBF') data structure, a first DIBF record. The first DIBF record comprises a data field and a quantifier field that includes a quantifier value, which represents a reference count for the first DIBF record. The first and second DIBF data structures are accessed and decoded based at least in part on computing a difference between a quantifier value in the first DIBF data structure and a quantifier value in the second DIBF data structure. A determination whether a match exists between the first DIBF data structure and second DIBF data structure is made based on computing the difference between the first and second DIBF data structures.

Distributed data synchronization in a distributed computing system

A first set of replicated state machines includes a first state machine that compares a clock value included in a state update message incremented by a first amount, a clock value for the first state machine incremented by a second amount, and a current local wall clock value for the first state machine to determine a maximum value and assigns the maximum value as the clock value for the first state machine. Additionally, in response to a passage of an amount of time, the first state machine advances the clock value for the first state machine to its current local wall clock value and propagates this clock value to the other state machines in the first set of replicated state machines. The advancement of the clock value for all state machines even in the absence of state updates improves their ability to respond to distributed read requests.

Performing scalable, causally consistent reads using a logical wall clock

Methods for dequeue optimizations in queues are performed by systems and apparatuses. The methods optimize dequeue operations using aggregation of expired messages enqueued in a queue and conditional iteration over enqueued messages based on the aggregation to service dequeue commands. Queues utilize page hierarchies such as root pages, index pages, and data pages. The aggregation of expired messages for pages in the queue determines the latest expired time for messages for a given page, and these latest expired times are stored in their respective pages, including data pages, index pages, and root pages, for use in the conditional iteration. The conditional iteration bypasses pages for which a latest expired time for all messages is prior to the current time when servicing dequeue requests for the queue.

System and method for dequeue optimization using conditional iteration

Growing community of inventors

Sammamish, WA, United States of America

Jieqing Wang