Alexandre O Verbitski

8087028, Dec 27, 2011

Jun 28, 2007

11/770716

Alexandre Verbitski - Woodinville WA, US
Boris Baryshnikov - Redmond WA, US

Microsoft Corporation - Redmond WA

G06F 9/46

718104

Systems and methods for scheduling computing device resources include a scheduler that maintains multiple queues. Requests are placed in one of the multiple queues depending on how much resource time the requests are to receive and when they are to receive it. The queue that a request is placed into depends on a pool bandwidth defined for a pool that includes the request and a bandwidth request. A request has an importance associated therewith that is taken into account in the scheduling process. The scheduler proceeds through the queues in a sequential and circular fashion, taking a work item from a queue for processing when that queue is accessed.

8103638, Jan 24, 2012

May 7, 2009

12/436805

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

Microsoft Corporation - Redmond WA

G06F 7/00
G06F 17/00

707687, 707704, 710200, 711145

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.

8326800, Dec 4, 2012

Mar 18, 2011

13/051967

Conor John Cunningham - Austin TX, US
Ajay Kalhan - Redmond WA, US
Clifford T. Dibble - Bellevue WA, US
Tomas Talius - Sammamish WA, US
Santeri Olavi Voutilainen - Seattle WA, US
Jeffrey A. East - Seattle WA, US
Alexandre Verbitski - Woodinville WA, US
Yixue Zhu - Sammamish WA, US

Microsoft Corporation - Redmond WA

G06F 17/30

707610, 707638

Embodiments are directed to providing distributed database service upgrades of database server instances in a computer cluster using multiple database server instances and to monitoring and maintaining a distributed database service during upgrade. In an embodiment, each computer system in a computer cluster instantiates at least two different database server instances on each of the nodes in the cluster. The first database server instances are configured to operate using a current distributed database version and the second instances are configured to operate using a new, updated distributed database service version. The computer system receives an indication that the distributed database service is to be upgraded. Then, based on the received indication, the computer system migrates database replicas from the first database server instances to the second database server instances which operate the new, updated service version, substantially without user-visible downtime.

20080209428, Aug 28, 2008

Feb 27, 2007

11/679520

Boris Baryshnikov - Redmond WA, US
Aleksandras Surna - Redmond WA, US
In-Jerng Choe - Sammamish WA, US
Alexandre Verbitski - Woodinville WA, US
Ravishankar Rajamani - Redmond WA, US

MICROSOFT CORPORATION - Redmond WA

G06F 9/46

718104

A database can have multiple requests applied at one time. Each of these requests requires a specific amount of server resources. There can be a differentiation of user-submitted workloads between each other. These workloads are a set of queries submitted by different users. Each query can have specific resource limits. In addition, each set can have specific resource limits.

20080282244, Nov 13, 2008

May 7, 2007

11/800675

Ming-Chuan Wu - Bellevue WA, US
Yuxi Bai - Kirkland WA, US
Robert H. Gerber - Bellevue WA, US
Alexandre Verbitski - Woodinville WA, US

Microsoft Corporation - Redmond WA

G06F 9/46

718100

Aspects of the subject matter described herein relate to deadlock detection in distributed environments. In aspects, nodes that are part of the environment each independently create a local wait-for graph. Each node transforms its local wait-for graph to remove non-global transactions that do not need resources from multiple nodes. Each node then sends its transformed local wait-for graph to a global deadlock monitor. The global deadlock monitor combines the local wait-for graphs into a global wait-for graph. Phantom deadlocks are detected and removed from the global wait-for graph. The global deadlock monitor may then detect and resolve deadlocks that involve global transactions.

20100125480, May 20, 2010

Nov 17, 2008

12/272312

Yuxi Bai - Kirkland WA, US
Alexandre Olegovich Verbitski - Woodinville WA, US
Ming-Chuan Wu - Bellevue WA, US

MICROSOFT CORPORATION - Redmond WA

G06Q 10/00

705 8

Systems and methods that enable resolving deadlock cycles by victim selection based on cost and/or priority of strongly connected components in a static wait-for graph. As such, victims can be selected by iteratively estimating total deadlock resolution cost (based on cost of strongly connected components) for remaining deadlock participants, selecting the participant with the least estimated total cost as the next victim, and reducing the wait-for graph after removing the victim vertex. The victim selection algorithm can be a cost-based greedy algorithm, wherein during each victim selection iteration, a single optimal victim is selected based on estimated remaining cost.

20100185714, Jul 22, 2010

Jan 15, 2009

12/353992

Robert H. Gerber - Bellevue WA, US
Alexandre Verbitski - Woodinville WA, US
Viatcheslav Krassovsky - Redmond WA, US

Microsoft Corporation - Redmond WA

G06F 17/30

707966, 707E17032, 707912

A database communication system is described herein that structures communications in a way that provides lower overhead tracking, statistics, semantics for closing a communication, and reliability. The system provides communication namespaces that organize communications by component, purpose, and instance, which allow database servers to implicitly create communication-related objects without central coordination. The database communication system enables group-based communications that streamline the development of complex distributed components and protocols by providing creation and management of communications namespaces, centralized cleanup support, and centralized monitoring. These features allow the system to be highly distributed, with no one single coordinator of operations, and still provide reliable communications. Thus, the system allows databases to be spread across multiple servers while keeping the burden on database server developers of managing communications between the servers low.

20110219169, Sep 8, 2011

Mar 4, 2010

12/717139

Chengliang Zhang - Redmond WA, US
Sadashivan krishnamurthy - Redmond WA, US
Georgiy I. Reynya - Redmond WA, US
Alexandre Verbitski - Woodinville WA, US

Microsoft Corporation - Redmond WA

G06F 12/00
G06F 12/02
G06F 17/00

711103, 711159, 707609, 707E17005, 711E12001, 711E12008

Aspects of the subject matter described herein relate to a buffer pool for a database system. In aspects, secondary memory such as solid state storage is used to extend the buffer pool of a database system. Thresholds such as hot, warm, and cold for classifying pages based on access history of the pages may be determined via a sampling algorithm. When a database system needs to free space in a buffer pool in main memory, a page may be evicted to the buffer pool in secondary memory or other storage based on how the page is classified and conditions of the secondary memory or other storage.