Gerald D Kuch

US Patent:

7013459, Mar 14, 2006

Filed:

Nov 12, 2004

Appl. No.:

10/987408

Inventors:

Gerald Dwayne Kuch - Seattle WA, US
Brian C. Beckman - New Castle WA, US
Jason L. Zander - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/45
G06F 12/00

US Classification:

717158, 717151, 711165

Abstract:

Data layout optimization arranges data members within memory to enhance software performance. Profiling data is consulted to determine how to group data members for an object class into groups. One technique groups the data members based on how frequently the data members are referenced in memory. Another technique groups the data members based on their affinities for one another in time as determined by observing when references to the data members take place. A variety of options when collecting the profiling data and grouping the data members is supported. The data member grouping is recorded in metadata associated with a definition of the object class. At runtime, a class loader places the data members of an object in memory according to the metadata. Data members of different groups can be placed in separately-loadable units of memory in the memory system. Subsequently, when the data members are referenced in memory, more frequently referenced data members, including those that tend to be referenced at times close to each other, reside at neighboring locations in the memory system.

US Patent:

7496909, Feb 24, 2009

Filed:

Feb 28, 2005

Appl. No.:

11/069232

Inventors:

Gerald Dwayne Kuch - Seattle WA, US
Jason L. Zander - Redmond WA, US
Brian C. Beckman - New Castle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/45
G06F 12/00

US Classification:

717158, 717151, 711165

Abstract:

Data layout optimization arranges data members within memory to enhance software performance. Profiling data is consulted to determine how to group data members for an object class into groups. One technique groups the data members based on how frequently the data members are referenced in memory. Another technique groups the data members based on their affinities for one another in time as determined by observing when references to the data members take place. A variety of options when collecting the profiling data and grouping the data members is supported. The data member grouping is recorded in metadata associated with a definition of the object class. At runtime, a class loader places the data members of an object in memory according to the metadata. Data members of different groups can be placed in separately-loadable units of memory in the memory system. Subsequently, when the data members are referenced in memory, more frequently referenced data members, including those that tend to be referenced at times close to each other, reside at neighboring locations in the memory system.

US Patent:

6862729, Mar 1, 2005

Filed:

Apr 4, 2000

Appl. No.:

09/542525

Inventors:

Gerald Dwayne Kuch - Kirkland WA, US
Brian C. Beckman - New Castle WA, US
Jason L. Zander - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F009/45
G06F012/00

US Classification:

717158, 717151, 711165

Abstract:

Data layout optimization arranges data members within memory to enhance software performance. Profiling data is consulted to determine how to group data members for an object class into groups. One technique groups the data members based on how frequently the data members are referenced in memory. Another technique groups the data members based on their affinities for one another in time as determined by observing when references to the data members take place. A variety of options when collecting the profiling data and grouping the data members is supported. The data member grouping is recorded in metadata associated with a definition of the object class. At runtime, a class loader places the data members of an object in memory according to the metadata. Data members of different groups can be placed in separately-loadable units of memory in the memory system. Subsequently, when the data members are referenced in memory, more frequently referenced data members, including those that tend to be referenced at times close to each other, reside at neighboring locations in the memory system.