Microsoft Technology Licensing, LLC

Panasonic Corporation

Garret Buban

Yoshiho Gotoh

Sarosh Cyrus Havewala

Ravinder S Thind

William R Tipton

Vishal Vikram Ghotge

Rajeev Y Nagar

Jonathan M Cargille

Aaron William Ogus

Neal Robert Christiansen

Jonathan Westhues

Adrian Mihail Marinescu

Ravisankar V Pudipeddi

Zheng Wang

Doron J Holan

Cheng Huang

Rajsekhar Das

Jacob Rubin Lorch

Scott Chao-Chueh Lee

Michael V Sliger

David A Roberts

Robert D Young

Thomas Dee McGuire

Vadim Makhervaks

Hoi Huu Vo

Daniel Allen Rosenfeld

David Bradley Probert, Jr

Rohan Kumar

Laura Marie Caulfield

Manojkumar Haridas Shende

Omar Carey

Noel Richard Cross

Lee Edward Prewitt

Bryan Stephen Matthew

Stephen Clifford Cooper

Ioan Oltean

Eileen C Brown

Anand Ganesh

Madhav Himanshubhai Pandya

James Aaron Holmes

Ritesh Kumar

Jieqing Wang

Brien Roell

David V Skyberg

Dennis Ming-Shu Lee

Dominic Lai

Paul V Donlan

Kevin Y Seng

Kory V Gill

Mauricio David Zaragoza Ibarra

Space efficient data integrity checks are disclosed herein. During a write operation of a first data to a location, a combined integrity value is calculated based on a first data integrity value of the first data and the location. The first data is stored at the location along with the combined integrity value. During a read operation of the first data, the first data is read from the location along with the combined integrity value, and a second data integrity value is calculated for the read first data. Data corruption and/or location errors can be determined based on the second data integrity value, the location, and the combined integrity value.

Space efficient data integrity check

Methods, systems, and computer storage media for providing temporary storage for data that has to be durably stored based on a replica set that includes a partial replica and a set of full replicas in a distributed computing environment. The partial replica of the replica set temporarily and durably stores data but does not persist the data when the set of full replicas have communicated a promise response to store the data. In operation, instructions to communicate promise responses are communicated to a replica set comprising a partial replica and a set of full replicas. A promise response indicates that a replica in the replica set will commit the data block of the write request. Promise responses are received from the set of full replicas. Based on receiving promise responses from the set of full replicas, a forget instruction is communicated to the partial replica to forget the data block.

Storage system with a partial replica

A computing device includes a processor and memory. A throttling application is stored in the memory and is executed by the processor. The throttling application receives a server request from a first application. The throttling application is located in a non-accessible location relative to the first application. The throttling application is configured, in response to the server request, to estimate a completion time when the server request will complete; send the server request with the completion time to a server; receive a response to the server request from the server prior to the completion time; when the completion time for the server request is in the future, wait until the completion time is now; and when the completion time is now, indicate completion to the first application.

Systems and methods for client-side throttling after server handling in a trusted client component

An append-only streams capability may be implemented that allows the host (e.g., the file system) to determine an optimal stream size based on the data to be stored in that stream. The storage device may expose to the host one or more characteristics of the available streams on the device, including but not limited to the maximum number of inactive and active streams on the device, the erase block size, the maximum number of erase blocks that can be written in parallel, and an optimal write size of the data. Using this information, the host may determine which particular stream offered by the device is best suited for the data to be stored.

Append only streams for storing data on a solid state device

A computing device comprises a processor and memory. A throttling application stored in the memory that is executed by the processor is configured, in response to a new server request from a first application, to determine whether performing the new server request exceeds a predetermined number of requests in progress; if performing the new server request does not exceed a predetermined number of requests in progress, estimate a completion time for the new server request; insert the new server request and the completion time in a request queue; and send the new server request and a time to live field to a server, wherein the time to live field is equal to the completion time minus a current time that the new server request is sent to the server.

Completion-side client throttling

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

In response to a request to a file system to perform a requested update, a lock of a first node in a file system can be acquired, and an update of the first node can be performed while the lock of the first node is held. Also in response to the request, a lock of a second node can be acquired, and an update of the second node, which reflects the update of the first node, can be performed while the lock of the second node is held. A file system can allow a pair of update operations to be performed in parallel where both operations include updating the same container node. Additionally, while a file system is running, new namespace types can be defined, and the file system can be extended to manage nodes within the new namespace types.

Extending file system namespace types

A system and method for sharing information between users based on recognition of the users and their associated processing devices in a scene. Interactions can be physical, verbal or a combination of physical and verbal gestures. Movements of the user and other users are tracked and interactions detected between them. User processing devices are connected by detecting users within view of a capture device, the capture device detecting motion tracking data for the user, such as a skeletal model. Information sharing may be controlled by the processing devices directly, by an intermediary server, or by a combination of the processing device and an intermediary server.

Recognition system for sharing information

Embodiments of the present invention relate to detecting and rectifying corruption in a distributed clock in a distributed system. Aspects may include receiving a sequence number used as part of the distributed clock at a node and determining if the sequence number is corrupt. In order to provide an effective mechanism for determining a sequence number is corrupt and taking corrective actions, a valid sequence number range may be determined, a propagation count associated with the sequence number may be evaluated, an estimated sequence number may be calculated, and an epoch number associated with the sequence number may be evaluated. Additionally, in exemplary aspects node with a corrupt trusted sequence values may self diagnosis and terminate associated processes to prevent further propagation of the corrupt sequence number.

Rectifying corrupt sequence values in distributed systems

For each of one or more existing nodes in a file system, pending notifications of updates that have been performed on the node can be identified and sent to one or more other nodes. The file system can be opened for use, and one or more other nodes can be updated in response to the pending notifications while the file system is open for use. For example, this may be done in an operation for recovering from a crash of the file system. Also, a process for dealing with stale data in container nodes in a file system can include processing access requests according to a stale data scheme.

File system node updates

A system, device, and method for virtually connecting a media device to a computing device are disclosed. One embodiment comprises a method to operate a virtual media device in a computing device, wherein the virtual media device that is controlled by a remote media device. In this manner, a computing device may stream media data to and from the remote media device.

Virtual media device

In response to a request to a file system to perform a requested update, a lock of a first node in a file system can be acquired, and an update of the first node can be performed while the lock of the first node is held. Also in response to the request, a lock of a second node can be acquired, and an update of the second node, which reflects the update of the first node, can be performed while the lock of the second node is held. The update of the first node can be independent of acquiring the lock of the second node. A file system can allow a pair of update operations to be performed in parallel where both operations include updating the same container node. Additionally, while a file system is running, new namespace types can be defined, and the file system can be extended to manage nodes within the new namespace types.

Growing community of inventors

Carnation, WA, United States of America

Garret Buban