会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method and system for designating and handling confidential memory allocations
    • 用于指定和处理机密内存分配的方法和系统
    • US08631250B2
    • 2014-01-14
    • US13432488
    • 2012-03-28
    • Henri Han Van RielAlan Cox
    • Henri Han Van RielAlan Cox
    • G06F21/00
    • G06F12/145G06F12/023G06F12/08G06F12/126G06F21/78
    • Designating and handling confidential memory allocations of virtual memory. An operating system provides a memory allocation flag that applications may use to indicate any arbitrary area of physical memory marked with this flag may contain confidential data and should be handled accordingly. The operating system also ensures that memory allocated with this flag can be placed in physical memory. When freeing up memory, the operating system protects any data in the memory allocated with this flag. For example, the operating system may prevent the confidential memory from being swapped out to storage or from being accessible to other applications, such as debuggers. Alternatively, the operating system may encrypt any data in the confidential memory before it is swapped out to storage.
    • 指定和处理虚拟内存的机密内存分配。 操作系统提供存储器分配标志,应用可以用于指示用该标志标记的物理存储器的任意区域可以包含机密数据并应相应地处理。 操作系统还可以确保分配有该标志的内存可以放置在物理内存中。 释放内存时,操作系统保护分配有该标志的内存中的任何数据。 例如,操作系统可以防止秘密存储器被交换到存储或者不能被诸如调试器之类的其他应用程序访问。 或者,操作系统可以在机密存储器中的任何数据被交换到存储之前加密。
    • 4. 发明申请
    • METHOD FOR TRACKING OF NON-RESIDENT PAGES
    • 跟踪非居留页的方法
    • US20100268900A1
    • 2010-10-21
    • US12824692
    • 2010-06-28
    • Henri Han van Riel
    • Henri Han van Riel
    • G06F12/00
    • G06F12/126G06F12/123
    • Embodiments of the present invention provide methods and systems for efficiently tracking evicted or non-resident pages. For each non-resident page, a first hash value is generated from the page's metadata, such as the page's mapping and offset parameters. This first hash value is then used as an index to point one of a plurality of circular buffers. Each circular buffer comprises an entry for a clock pointer and entries that uniquely represent non-resident pages. The clock pointer points to the next page that is suitable for replacement and moves through the circular buffer as pages are evicted. In some embodiments, the entries that uniquely represent non-resident pages are a hash value that is generated from the page's inode data.
    • 本发明的实施例提供了用于有效地跟踪被驱逐或非驻留页面的方法和系统。 对于每个非驻留页面,从页面的元数据生成第一个哈希值,例如页面的映射和偏移参数。 然后将该第一哈希值用作指向多个循环缓冲器中的一个的索引。 每个循环缓冲器包括用于时钟指针的条目和独特地表示非驻留页面的条目。 时钟指针指向适合替换的下一页,并在页面被逐出时通过循环缓冲区移动。 在一些实施例中,唯一地表示非驻留页面的条目是从页面的inode数据生成的哈希值。
    • 5. 发明授权
    • Method of tuning a cache
    • 调整缓存的方法
    • US07685369B2
    • 2010-03-23
    • US12407971
    • 2009-03-20
    • Henri Han van Riel
    • Henri Han van Riel
    • G06F12/00G06F13/00G06F13/28
    • G06F12/121G06F12/08
    • Embodiments of the present invention provide methods and systems for tuning the size of the cache. In particular, when a page fault occurs, non-resident page data is checked to determine if that page was previously accessed. If the page is found in the non-resident page data, an inter-reference distance for the faulted page is determined and the distance of the oldest resident page is determined. The size of the cache may then be tuned based on comparing the inter-reference distance of the newly faulted page relative to the distance of the oldest resident page.
    • 本发明的实施例提供了用于调整高速缓存大小的方法和系统。 特别地,当发生页面错误时,检查非驻留页面数据以确定是否先前访问了该页面。 如果在非驻留页面数据中找到页面,则确定故障页面的参考间距,并且确定最旧驻留页面的距离。 然后可以基于比较新故障页面的相对参考距离与最旧的驻留页面的距离来调整高速缓存的大小。
    • 6. 发明申请
    • KERNEL AND APPLICATION COOPERATIVE MEMORY MANAGEMENT
    • KERNEL和应用合作记忆管理
    • US20090228675A1
    • 2009-09-10
    • US12466473
    • 2009-05-15
    • Henri Han van RielMatthias Clasen
    • Henri Han van RielMatthias Clasen
    • G06F12/08
    • G06F13/1668G06F12/023G06F12/0804G06F12/10
    • Embodiments of the present invention provide a mechanism for an operating system and applications to cooperate in memory management. Applications register with the operating system for cooperative memory management. The operating system monitors the memory and determines a memory “pressure” related to the amount of demand for the memory. As the memory pressure increases, the operating system provides a memory pressure signal as feedback to the registered applications. The operating system may send this signal to indicate it is about to commence evicting pages from the memory or when it has commenced swapping out application data. In response to the signal, the registered applications may evaluate the memory pressure, determine which data should be freed, if any, and provide this information back to the operating system. The operating system may then free those portions of memory relinquished by the applications. By releasing data the system may thus avoid swapping and increase its performance.
    • 本发明的实施例提供了用于在存储器管理中协作的操作系统和应用的机制。 应用程序向操作系统注册进行协同内存管理。 操作系统监视存储器并确定与存储器的需求量相关的存储器“压力”。 当存储器压力增加时,操作系统提供存储器压力信号作为对注册应用的反馈。 操作系统可以发送该信号以指示它即将开始从存储器中排出页面,或者当它已经开始交换应用数据时。 响应于该信号,注册的应用程序可以评估存储器压力,确定应该释放哪些数据(如果有的话),并将该信息提供给操作系统。 然后,操作系统可以释放由应用程序放弃的存储器部分。 通过释放数据,系统可能因此避免交换并增加其性能。
    • 8. 发明授权
    • Kernel and application cooperative memory management
    • 内核和应用协同内存管理
    • US07552293B2
    • 2009-06-23
    • US11363158
    • 2006-02-28
    • Henri Han Van RielMatthias Clasen
    • Henri Han Van RielMatthias Clasen
    • G06F12/08G06F12/12
    • G06F13/1668G06F12/023G06F12/0804G06F12/10
    • Embodiments of the present invention provide a mechanism for an operating system and applications to cooperate in memory management. Applications register with the operating system for cooperative memory management. The operating system monitors the memory and determines a memory “pressure” related to the amount of demand for the memory. As the memory pressure increases, the operating system provides a memory pressure signal as feedback to the registered applications. The operating system may send this signal to indicate it is about to commence evicting pages from the memory or when it has commenced swapping out application data. In response to the signal, the registered applications may evaluate the memory pressure, determine which data should be freed, if any, and provide this information back to the operating system. The operating system may then free those portions of memory relinquished by the applications. By releasing data the system may thus avoid swapping and increase its performance.
    • 本发明的实施例提供了用于在存储器管理中协作的操作系统和应用的机制。 应用程序向操作系统注册进行协同内存管理。 操作系统监视存储器并确定与存储器的需求量相关的存储器“压力”。 当存储器压力增加时,操作系统提供存储器压力信号作为对注册应用的反馈。 操作系统可以发送该信号以指示它即将开始从存储器中排出页面,或者当它已经开始交换应用数据时。 响应于该信号,注册的应用程序可以评估存储器压力,确定应该释放哪些数据(如果有的话),并将该信息提供给操作系统。 然后,操作系统可以释放由应用程序放弃的存储器部分。 通过释放数据,系统可能因此避免交换并增加其性能。
    • 10. 发明授权
    • Using a yield indicator in a hierarchical scheduler
    • 在分层调度器中使用收益指标
    • US08875144B2
    • 2014-10-28
    • US13041882
    • 2011-03-07
    • Henri Han van Riel
    • Henri Han van Riel
    • G06F9/46G06F9/48
    • G06F9/4881
    • A method and system for scheduling the use of CPU time among processes using a scheduling tree having a yielding indicator. A scheduling tree represents a hierarchy of groups and processes that share central processing unit (CPU) time. A computer system assigns a yield indicator to a first node of the scheduling tree, which represents a first process that temporarily yields the CPU time. The computer system also assigns the yield indicator to each ancestor node of the first node in the scheduling tree. Each ancestor node represents a group to which the first process belongs. The computer system then selects a second process to run on the computer system based on the yield indicator in the scheduling tree.
    • 一种用于使用具有屈服指示符的调度树来处理使用CPU时间的方法和系统。 调度树表示共享中央处理单元(CPU)时间的组和进程的层次结构。 计算机系统将收益指示符分配给调度树的第一节点,其表示临时产生CPU时间的第一进程。 计算机系统还将收益指示符分配给调度树中的第一节点的每个祖先节点。 每个祖先节点表示第一个进程所属的组。 然后,计算机系统基于调度树中的收益指示符选择在计算机系统上运行的第二进程。