Microsoft Technology Licensing, LLC

Scott Corbin

Seth Mitchell Demsey

Brian J Smith

Michael D Smith

W Michael Zintel

The systems and methods described herein are directed at controlling access to a data structure. A data field is included within the data structure. The data field includes information about the accessibility of the data structure. In response to an attempt to access the data structure by a first thread, the data field is configured to identify that the data structure is not accessible by another thread. The first thread can then access the data structure. In response to an attempt to access the data structure by a second thread, the second thread is configured to determine from the data field that the data structure is being accessed by the first thread.

Systems and methods for controlling access to an object

The present invention is directed at a virtual machine environment operating on portable devices with limited resources. The virtual machine environment includes a method for compiling an intermediate language into native code wherein the native code is stored in a directly addressable and executable storage medium, such as flash memory. A portion of the native code is written to a cache resident in volatile memory during compiling. The cache is written to the directly addressable and executable storage medium. The cache may be sized in relation to a block size associated with the directly addressable and executable storage medium. A metadata map is maintained and associates a physical address at which the native code is stored in the storage medium with the method. The native code is persisted by storing the metadata map in the storage medium and associating the metadata map with the method.

System and method for persisting dynamically generated code in a directly addressable and executable storage medium

The present invention is directed at a virtual machine environment operating on portable devices with limited resources. The virtual machine environment includes a method for managing dynamically generated code and data together in order to shift memory usage to/from generated code or data as needed. Each application domain manages several code pools and several garbage collection pools that are allocated from a system memory heap. When additional memory is not available for allocation from the system memory heap, garbage collection is performed until sufficient memory becomes available. During garbage collection, unreachable data in each garbage collection pool is cleared. The garbage collection process may further compact the garbage collection pools in order to empty one or more of the garbage collection pools. Still further, code pools may be released back to the system memory heap if the generated code is not associated with a current application domain, is executed infrequently, or is not associated with an instruction on a stack. Thus, memory may flow from data to code or vice versa as needed and among application domains.

Growing community of inventors

Carnation, WA, United States of America

Scott Corbin