会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明申请
    • High Performance, Lock-Free Virtual Storage Manager
    • 高性能,无锁的虚拟存储管理器
    • US20090100243A1
    • 2009-04-16
    • US11872821
    • 2007-10-16
    • Donald F. AultPeter J. RelsonJames H. MulderElpida TzortzatosPaula M. Spens
    • Donald F. AultPeter J. RelsonJames H. MulderElpida TzortzatosPaula M. Spens
    • G06F12/02
    • G06F12/023
    • A virtual storage technique is provided to manage a cell pool or a set of cell pools which can be used to satisfy variable-size storage requests. The algorithm uses no locks and relies on an atomic compare-and-swap instruction to serialize updates to the fields that can be simultaneously requested by multiple threads or processes. A free chain is used to manage cells which have already been obtained and freed, while there is an active extent that is used to hand out cells which have not previously been obtained. The algorithm is based on all cell pool extents being the same size, which allows the control information for the extent to be easily located on the extent boundary (e.g. at a 1 MB boundary). Control information for each cell is stored independently of the cell storage in a control array that resides at the head of the extent, along with other control information. This avoids cell overrun from damaging the cell pool control information. The result is a high performance storage manager with good serviceability characteristics.
    • 提供虚拟存储技术来管理可用于满足可变大小的存储请求的单元池或一组单元池。 该算法不使用锁,并且依赖于原子比较和交换指令来将更新序列化到可由多个线程或进程同时请求的字段。 使用自由链来管理已经获得和释放的细胞,而存在用于递送以前未获得的细胞的活性程度。 该算法基于所有的相同大小的单元池区段,这允许控制信息的范围容易地位于范围边界(例如,1MB边界)处。 每个单元的控制信息与其他控制信息一起存储在驻留在扩展头的控制阵列中的单元存储单元。 这避免了细胞溢出损坏细胞池控制信息。 结果是一个高性能的存储管理器具有良好的可维护性。
    • 7. 发明申请
    • Priority Promotion for Service Requests
    • 服务请求优先推广
    • US20100174873A1
    • 2010-07-08
    • US12348075
    • 2009-01-02
    • Jacob W. FriedmanBernard PiercePeter J. Relson
    • Jacob W. FriedmanBernard PiercePeter J. Relson
    • G06F12/10
    • G06F9/5038G06F12/08G06F2209/5021
    • A method for priority promotion of a service request comprises receiving the service request for a target address space into a set of work requests, the set of work requests comprising a plurality of service requests for the target address space, the service request originating from a source address space, the service request having a priority equivalent to a priority of the target address space, the source address space having a higher priority than the target address space; determining a number of service requests for the target address space in the set of work requests; and, in the event the number of service requests for the target address space exceeds a predetermined value, promoting the priority of the service request to the priority of the source address space.
    • 一种用于优先推广服务请求的方法包括:将目标地址空间的服务请求接收到一组工作请求中,该组工作请求包括针对目标地址空间的多个服务请求,来自源的服务请求 地址空间,所述服务请求具有等于所述目标地址空间的优先级的优先级,所述源地址空间具有比所述目标地址空间更高的优先级; 确定所述工作请求集合中的目标地址空间的服务请求的数量; 并且在目标地址空间的服务请求数量超过预定值的情况下,将服务请求的优先级提高到源地址空间的优先级。