Abstract: When a dynamic data structure is used for managing sparsely accessed data stored in memory of a digital computer, pages of the memory are dynamically allocated and de-allocated to respective portions of the dynamic data structure so that the pages become distributed over the portions of the dynamic data structure and the de-allocated pages include free pages that are mapped in the dynamic data structure and free pages that are not mapped in the dynamic data structure. To reduce memory fragmentation and recover memory, upon de-allocating a page of memory from a portion of the data structure, a determination is made whether or not to un-map the de-allocated page from the portion of the dynamic data structure so that un-mapping of the de-allocated page has a probability that is the inverse of a superlinear function of the number of allocated pages in the portion of the dynamic data structure.

Abstract: Compounds of general formula (I); or a stereoisomers, tautomers, pharmaceutically acceptable salts, or prodrugs thereof, wherein R1, R2, R3, R4, R5, R6, R8 and R9 are as defined herein, are useful for the treatment of diseases and conditions which are mediated by excessive or inappropriate Hsp90 activity such as cancers, viral infection and inflammatory diseases or conditions.

Abstract: Compounds of general formula (I); or a stereoisomers, tautomers, pharmaceutically acceptable salts, or prodrugs thereof, wherein R1, R2, R3, R4, R5, R6, R8 and R9 are as defined herein, are useful for the treatment of diseases and conditions which are mediated by excessive or inappropriate Hsp90 activity such as cancers, viral infection and inflammatory diseases or conditions.

Abstract: Systems, methods, and devices are provided for memory management. One method embodiment includes providing an operating system capable of supporting variable page sizes. The method includes providing a virtual memory address, translating the virtual memory address to a virtual memory page, and mapping the virtual memory page to a physical memory page by using a multilevel page table whose depth and/or order corresponds to page sizes that are supported by an operating system and/or hardware.

Abstract: An exemplary embodiment of the invention includes methods of configuring a memory block including: providing a memory block, the memory block having a set of addressable memory locations; configuring the memory block to include a plurality of pages corresponding to the set of addressable memory locations, the plurality of pages each having a page size; and allocating at least one of the plurality of pages for storing at least one per-page data structure, the at least one per-page data structure co-located with the memory block. In some embodiments, methods further include: defining the set of addressable memory locations; and computing a number of pages needed to store the at least one per-page data structure. Advantages of the invention include flexible memory allocation. The invention supports a dynamic update of the memory per-page data structures so that the operating system can take full advantage of the available memory.

Abstract: A method for managing memory usage in a computer system having a kernel and a kernel memory class. The method includes ascertaining a size of a base memory of the computer system, the base memory representing memory designated to be non-evacuable. The method also includes setting a size of the kernel memory class to be no larger than the size of the base memory. Requests for additional memory by a kernel process is evaluated at the evaluation stage and granted only if the additional memory, if granted, would not cause an amount of memory used by the kernel to exceed the size of the kernel memory class.

Abstract: A method for evacuating a source memory page. The method includes ascertaining a first set of processes, the first set of processes representing processes currently accessing the source memory page. The method also includes manipulating parameters associated with the source memory page to enable at least one copy-on-write procedure to be performed on the source memory page irrespective whether the first set of processes has only one process or the first set of processes has multiple processes.

Abstract: Various approaches for demoting a memory page are described. In one approach, a first new page is established from a subpage of a base page in response to a request to demote a specified subpage. The size of the first new page is selected from a plurality of page sizes. For each portion of the base page less the first new page, the portion is divided into one or more pages of a selected size. The selected size for the pages is a largest of the plurality of page sizes that is less than or equal to the size of the portion. If the new one or more pages do not encompass the entire portion, a new feasible, largest of the sizes is selected and the part of the portion not encompassed is further divided into one or more pages.