Microsoft Technology Licensing, LLC

Simon M Meacham

Barry M Nolte

Douglas S Boa

Vinod Grover

Richard M Shupak

Pat Styles

Barbara L Kess

Adrian Corduneanu

Kevin James Zatloukal

Richard Emil Ladner

This present invention extends the mechanism for locating solution access information and then obtaining and implementing the correct solution for updating software programs. The user can communicate with one system on the network, tell it what the user is interested in, and then the system replies on a file by file basis where to locate the desired information. Thus, the user no longer has to register, e.g. in the environment variables, the individual paths for where a multitude of different applications find their additional related information on the network. According to the teachings of the present invention, a user will have to make basically zero changes to the system, and instead will automatically discover the name location of a server that is going to provide the user with the information associated with any user executable file. In particular, one embodiment of the present invention includes a computer implemented method. The method includes querying a first server for a location of a second server containing information associated with a local file. The method further includes querying the second server for the information associated with the local file. The second server then provides the information associated with the executable. Other systems and methods are included within the scope of the present invention.

Information location service

A method, apparatus, software and data structure is disclosed for more efficient access times for linear operations in a hash table, including finding the nearest logical record. A plurality of actual data records and a plurality of marker data records are inserted in a hash table using a hash function. The actual data records and marker data records have a logical ordering specified by a key and are threaded into the hash table to allow linear access by walking the hash table. The logical ordering of the actual data records and marker records is lost upon entry into the hash table, and the keys of the marker data records are distributed at known positions throughout the range of the keys of the actual data records. If when hashing a given key no record exists in the database for the given key, one of the keys for the marker data records are hashed to locate the associated marker data record in the hash table. A nearest logical record may thus be retrieved entering the hash table through the marker data record.

Method and apparatus for finding nearest logical record in a hash table

A method, apparatus, and software are disclosed for modelling access behavior to a cache memory using trace data collected during execution of an application. The model thus obtained is used to improve cache performance by reordering constituent members of data structures so as to improve the cache hit rate.

Structure organization for improved cache performance

A method, apparatus, software and data structure is disclosed for more efficient access times for linear operations in a hash table. A plurality of actual data records and a plurality of marker data records are inserted in a hash table using a hash function. The actual data records and marker data records have a logical ordering specified by a key and are threaded into the hash table to allow linear access by walking the hash table. The logical ordering of the actual data records and marker records is lost upon entry into the hash table, and the keys of the marker data records are distributed at known positions throughout the range of the keys of the actual data records. If when hashing a given key no record exists in the database for the given key, one of the keys for the marker data records are hashed to locate the associated marker data record in the hash table. Distribution of data records according to the hash function is also determined by locating a marker data record in the database and examining the position of adjacent records. The distribution of records provides a measure of performance of the hash table and for tuning of the hash table.

Growing community of inventors

Redmond, WA, United States of America

Simon M Meacham