Fabricio D Voznika

US Patent:

20100287203, Nov 11, 2010

Filed:

May 7, 2009

Appl. No.:

12/436805

Inventors:

Fabricio Voznika - Kenmore WA, US
Alexander Verbitski - Woodinville WA, US
Pravin Mittal - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/30

US Classification:

707781, 711118, 707609, 707640, 707661, 707652

Abstract:

Methods, systems, and computer-readable media are disclosed for partitioning contended synchronization objects. A particular method determines a contention-free value of a performance metric associated with a synchronization object of a data structure. A contended value of the performance metric is measured, and the synchronization object is partitioned when the contended value of the performance metric exceeds a multiple of the contention-free value of the performance metric.

US Patent:

20130346707, Dec 26, 2013

Filed:

Jun 21, 2012

Appl. No.:

13/530082

Inventors:

Fabricio D. Voznika - Kenmore WA, US
Haitao Wang - Issaquah WA, US
Jack S. Richins - Bothell WA, US
Jasraj Dange - Redmond WA, US

Assignee:

MICROSOFT CORPORATION - Redmond WA

International Classification:

G06F 12/00

US Classification:

711159, 711E12001

Abstract:

Resource use is recorded with a partitioned reference counter. The sum of all resource counter partitions is equivalent to the total references to a resource. When one resource counter partition reaches zero, it is possible that the resource should be destroyed. To determine if this is the case, all other partitions can be checked for a value of zero. If all the partitions are zero, the resource can be destroyed. Coarse grained partitioning and add/release on all partitions can be employed to avoid extra work associated with a local partition reaching zero. Further, destroying or deleting a resource can be accomplished in a manner that avoids a race condition.