Buffer Pool Extension for Database Server
    2.
    发明申请
    Buffer Pool Extension for Database Server 有权
    数据库服务器缓冲池扩展

    公开(公告)号:US20110219169A1

    公开(公告)日:2011-09-08

    申请号:US12717139

    申请日:2010-03-04

    IPC分类号: G06F12/00 G06F12/02 G06F17/00

    摘要: Aspects of the subject matter described herein relate to a buffer pool for a database system. In aspects, secondary memory such as solid state storage is used to extend the buffer pool of a database system. Thresholds such as hot, warm, and cold for classifying pages based on access history of the pages may be determined via a sampling algorithm. When a database system needs to free space in a buffer pool in main memory, a page may be evicted to the buffer pool in secondary memory or other storage based on how the page is classified and conditions of the secondary memory or other storage.

    摘要翻译: 本文描述的主题的方面涉及数据库系统的缓冲池。 在方面,诸如固态存储的辅助存储器用于扩展数据库系统的缓冲池。 可以通过采样算法来确定基于页面访问历史的用于对页面进行分类的诸如热,暖和冷等的阈值。 当数据库系统需要释放主内存中的缓冲池中的空间时,可能会根据页面的分类和辅助内存或其他存储的条件,将页面逐出驱动到辅助内存或其他存储中的缓冲池。

    Multi-level buffer pool extensions
    3.
    发明授权
    Multi-level buffer pool extensions 有权
    多级缓冲池扩展

    公开(公告)号:US09235531B2

    公开(公告)日:2016-01-12

    申请号:US13305670

    申请日:2011-11-28

    摘要: A buffer manager that manages blocks of memory amongst multiple levels of buffer pools. For instance, there may be a first level buffer pool for blocks in first level memory, and a second level buffer pool for blocks in second level memory. The first level buffer pool evicts blocks to the second level buffer pool if the blocks are not used above a first threshold level. The second level buffer pool evicts blocks to a yet lower level if they have not used above a second threshold level. The first level memory may be dynamic random access memory, whereas the second level memory may be storage class memory, such as a solid state disk. By using such a storage class memory, the working block set of the buffer manager may be increased without resorting to lower efficiency random block access from yet lower level memory such as disk.

    摘要翻译: 缓冲管理器,用于管理多级缓冲池中的内存块。 例如,可能存在第一级存储器中的块的第一级缓冲池,以及用于第二级存储器中的块的第二级缓冲池。 如果不在第一阈值级别以上使用块,则第一级缓冲池将块移动到第二级缓冲池。 如果第二级缓冲池没有使用高于第二阈值级别,那么第二级缓冲池将块移动到较低级别。 第一级存储器可以是动态随机存取存储器,而第二级存储器可以是诸如固态盘的存储类存储器。 通过使用这样的存储类存储器,可以增加缓冲器管理器的工作块集,而不需要从低级存储器(例如盘)获得较低效率的随机数据块访问。

    MULTI-LEVEL BUFFER POOL EXTENSIONS
    4.
    发明申请
    MULTI-LEVEL BUFFER POOL EXTENSIONS 有权
    多级缓冲池扩展

    公开(公告)号:US20120072652A1

    公开(公告)日:2012-03-22

    申请号:US13305670

    申请日:2011-11-28

    IPC分类号: G06F12/00

    摘要: A buffer manager that manages blocks of memory amongst multiple levels of buffer pools. For instance, there may be a first level buffer pool for blocks in first level memory, and a second level buffer pool for blocks in second level memory. The first level buffer pool evicts blocks to the second level buffer pool if the blocks are not used above a first threshold level. The second level buffer pool evicts blocks to a yet lower level if they have not used above a second threshold level. The first level memory may be dynamic random access memory, whereas the second level memory may be storage class memory, such as a solid state disk. By using such a storage class memory, the working block set of the buffer manager may be increased without resorting to lower efficiency random block access from yet lower level memory such as disk.

    摘要翻译: 缓冲管理器,用于管理多级缓冲池中的内存块。 例如,可能存在第一级存储器中的块的第一级缓冲池,以及用于第二级存储器中的块的第二级缓冲池。 如果不在第一阈值级别以上使用块,则第一级缓冲池将块移动到第二级缓冲池。 如果第二级缓冲池没有使用高于第二阈值级别,那么第二级缓冲池将块移动到较低级别。 第一级存储器可以是动态随机存取存储器,而第二级存储器可以是诸如固态盘的存储类存储器。 通过使用这样的存储类存储器,可以增加缓冲器管理器的工作块集,而不需要从低级存储器(例如盘)获得较低效率的随机数据块访问。

    CACHE EVICTION USING MEMORY ENTRY VALUE
    5.
    发明申请
    CACHE EVICTION USING MEMORY ENTRY VALUE 有权
    使用内存输入值进行缓存

    公开(公告)号:US20120246411A1

    公开(公告)日:2012-09-27

    申请号:US13053171

    申请日:2011-03-21

    IPC分类号: G06F12/08

    CPC分类号: G06F12/121 G06F2212/163

    摘要: Embodiments are directed to efficiently determining which cache entries are to be evicted from memory and to incorporating a probability of reuse estimation in a cache entry eviction determination. A computer system with multiple different caches accesses a cache entry. The computer system determines an entry cost value for the accessed cache entry. The entry cost value indicates an amount of time the computer system is slowed down by to load the cache entry into cache memory. The computer system determines an opportunity cost value for the computing system caches. The opportunity cost value indicates an amount of time by which the computer system is slowed down while performing other operations that could have used the cache entry's cache memory space. Upon determining that the entry cost value is lower than the opportunity cost value, the computer system probabilistically evicts the cache entry from cache memory.

    摘要翻译: 实施例旨在有效地确定哪些高速缓存条目将被从存储器驱逐出来并且将重用估计的概率并入高速缓存条目驱逐确定中。 具有多个不同缓存的计算机系统访问高速缓存条目。 计算机系统确定所访问的高速缓存条目的入口成本值。 输入成本值表示将缓存条目加载到高速缓冲存储器中的计算机系统减速的时间量。 计算机系统确定计算系统高速缓存的机会成本值。 机会成本值表示在执行可能已经使用高速缓存条目的高速缓冲存储器空间的其他操作时计算机系统减速的时间量。 在确定入口成本值低于机会成本值时,计算机系统概率地将高速缓存条目从缓存存储器中排除。

    Hierarchical Scalable Memory Allocator
    6.
    发明申请
    Hierarchical Scalable Memory Allocator 有权
    分层可扩展内存分配器

    公开(公告)号:US20110302388A1

    公开(公告)日:2011-12-08

    申请号:US12792734

    申请日:2010-06-03

    IPC分类号: G06F12/02 G06F12/00

    CPC分类号: G06F12/023

    摘要: Aspects of the subject matter described herein relate to memory management. In aspects, a hierarchical, customized memory allocator may be created that allocates memory to memory consumers. The memory allocator may use a data structure to classify blocks of memory at each level in the hierarchy according to fill factors of the blocks of memory. Allocations may be based on lifetime characteristics, proximity to consumer, fill factor, and other factors. An allocator may use one or more active blocks to allocate memory to consumers. The number of active blocks for an allocator may depend on contention.

    摘要翻译: 本文描述的主题的方面涉及存储器管理。 在方面中,可以创建分配的定制的存储器分配器,其将存储器分配给存储器消费者。 存储器分配器可以使用数据结构来根据存储器块的填充因子对层级中的每个级别的存储器块进行分类。 分配可能基于生命周期特征,邻近消费者,填充因子和其他因素。 分配器可以使用一个或多个活动块来向消费者分配内存。 分配器的活动块数可能取决于争用。

    Hierarchical scalable memory allocator
    7.
    发明授权
    Hierarchical scalable memory allocator 有权
    层次可扩展内存分配器

    公开(公告)号:US08225065B2

    公开(公告)日:2012-07-17

    申请号:US12792734

    申请日:2010-06-03

    IPC分类号: G06F12/00

    CPC分类号: G06F12/023

    摘要: Aspects of the subject matter described herein relate to memory management. In aspects, a hierarchical, customized memory allocator may be created that allocates memory to memory consumers. The memory allocator may use a data structure to classify blocks of memory at each level in the hierarchy according to fill factors of the blocks of memory. Allocations may be based on lifetime characteristics, proximity to consumer, fill factor, and other factors. An allocator may use one or more active blocks to allocate memory to consumers. The number of active blocks for an allocator may depend on contention.

    摘要翻译: 本文描述的主题的方面涉及存储器管理。 在方面中,可以创建分配的定制的存储器分配器,其将存储器分配给存储器消费者。 存储器分配器可以使用数据结构来根据存储器块的填充因子对层级中的每个级别的存储器块进行分类。 分配可能基于生命周期特征,邻近消费者,填充因子和其他因素。 分配器可以使用一个或多个活动块来向消费者分配内存。 分配器的活动块数可能取决于争用。

    Cache eviction using memory entry value
    8.
    发明授权
    Cache eviction using memory entry value 有权
    缓存驱逐使用内存条目值

    公开(公告)号:US08402223B2

    公开(公告)日:2013-03-19

    申请号:US13053171

    申请日:2011-03-21

    IPC分类号: G06F12/00

    CPC分类号: G06F12/121 G06F2212/163

    摘要: Embodiments are directed to efficiently determining which cache entries are to be evicted from memory and to incorporating a probability of reuse estimation in a cache entry eviction determination. A computer system with multiple different caches accesses a cache entry. The computer system determines an entry cost value for the accessed cache entry. The entry cost value indicates an amount of time the computer system is slowed down by to load the cache entry into cache memory. The computer system determines an opportunity cost value for the computing system caches. The opportunity cost value indicates an amount of time by which the computer system is slowed down while performing other operations that could have used the cache entry's cache memory space. Upon determining that the entry cost value is lower than the opportunity cost value, the computer system probabilistically evicts the cache entry from cache memory.

    摘要翻译: 实施例旨在有效地确定哪些高速缓存条目将被从存储器驱逐出来并且将重用估计的概率并入高速缓存条目驱逐确定中。 具有多个不同缓存的计算机系统访问高速缓存条目。 计算机系统确定所访问的高速缓存条目的入口成本值。 输入成本值表示将缓存条目加载到高速缓冲存储器中的计算机系统减速的时间量。 计算机系统确定计算系统高速缓存的机会成本值。 机会成本值表示在执行可能已经使用高速缓存条目的高速缓冲存储器空间的其他操作时计算机系统减速的时间量。 在确定入口成本值低于机会成本值时,计算机系统概率地将高速缓存条目从缓存存储器中排除。