Microsoft Technology Licensing, LLC

Anthony Frederick Voellm

Ahmed Hassan Mohamed

David Matthew Kruse

Balan Sethu Raman

Matthew William Lee

Sethu M Kalavakur

Maurice T Franklin

Norbert Hu

A native callback function is registered with a calling component in a native code environment, wherein registering the native callback function is initiated from a secure application area in a managed code environment. A callback is delivered from the native callback function into the secure application area.

Delivering callbacks into secure application areas

A database engine is provided with memory management policies to dynamically configure an area of memory called a buffer pool into which data pages are held during processing. The data pages are also buffered as an I/O (input/output) stream when read and written to a persistent storage medium, such as a hard disk, through use of a system file cache that is managed by the computer's operating system. The memory management policies implement capping the amount of memory used within the buffer pool to minimize the number of data pages that are double-buffered (i.e., held in both the buffer pool and system file cache). In addition, trimming data pages from the buffer pool, after the database engine completes all pending operations and requests, frees additional memory and further minimizes the number of processes associated with the database.

Dynamic database memory management policies

A method and system for offloading I/O processing from a first computer to a second computer, using RDMA-capable network interconnects, are disclosed. The method and system include a client on the first computer communicating over an RDMA connection to a server on the second computer by way of a lightweight input/output (LWIO) protocol. The protocol generally comprises a network discovery phase followed by an I/O processing phase. During the discovery phase, the client and server determine a minimal list of shared RDMA-capable providers. During the I/O processing phase, the client posts I/O requests for offloading to the second machine over a mutually-authenticated RDMA channel. The I/O model is asymmetric, with read operations being implemented using RDMA and write operations being implemented using normal sends. Read and write requests may be completed in polling mode and in interrupt mode. Buffers are managed by way of a credit mechanism.

Lightweight input/output protocol

Described is a mechanism for dynamically allocating receive buffers on a server to a plurality of clients in a network environment. The server maintains a list of the number of transaction credits in use by each client, the number of transaction credits allocated to each client, and the number of pending transaction requests that are not being handled due to a limitation on the number of allocated transaction credits. The transaction credits correspond to the receive buffers. In a resource constrained situation, the server computes an equitable distribution of the available credits and reallocates the available credits based on that equitable distribution.

System and method for dynamically allocating resources in a client/server environment

A method and system for providing state-full access to files and resuming access should a connection be broken. A resume key is returned to the client that allows the client to request a duplicate handle to an open file. The duplicate handle can be used to access the file in the same manner as the handle used to open the file. When a connection is broken, the file remains open on the server for a period of time and the state information associated with the file is maintained. Even if a connection is not broken, a client may request one or more duplicate handles and establish other channels (also known as connections) with which to access the file.

Method and system for accessing a file

Performing parallel comparisons of variables to determine program code execution flow or to compare multiple variables is disclosed. Memory locations are packed with multiple sub-variables for comparison to sub-variables generated, for example, at runtime. Each binary sub-variable includes a 'carryout' bit used to determine whether a comparison of one sub-variable with another sub-variable results in a 'true' or a &#x201c;false.&#x201d; A modified version of twos complement arithmetic is performed on a set of sub-variables. The modified version involves inverting each bit of the sub-variables, performing a masking operation to change the carryout bits to 0, adding a binary 1 to each sub-variable, and performing the masking operation a second time to change the carryout bits to 0. The result of the modified twos complement arithmetic is added to a variable, and the carryout bit of each sub-variable of the resulting variable is evaluated.

Parallel filter check using an arithmetic memory location

A system and method for altering the operation of a computer application while avoiding recompiling the computer application or modifying the kernel associated with the operating system of a computing device. A computer application is launched in a suspended mode. An asynchronous procedure call (APC) is used to load an additional dynamic link library (DLL) to be associated with the computer application. The additional DLL includes routines that operate differently than routines originally associated with the computer application through an initial DLL. The references to the routines within the computer application are redirected to the routines of the additional (DLL). The operation of the computer application is therefore changed while avoiding rewriting the application or changing the operating system.

Growing community of inventors

Redmond, WA, United States of America

Anthony Frederick Voellm