会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • User defined preferred DNS reference
    • 用户定义的首选DNS参考
    • US08037203B2
    • 2011-10-11
    • US10782668
    • 2004-02-19
    • Jos Manuel AccapadiMathew AccapadiWilliam Lee BrittonAndrew DunsheaDirk Michel
    • Jos Manuel AccapadiMathew AccapadiWilliam Lee BrittonAndrew DunsheaDirk Michel
    • G06F15/173
    • H04L61/1511
    • Methods, systems, and products are disclosed for user defined preferred DNS routing that include mapping for a user in a data communications application a domain name of a network host to a network address for a preferred DNS server, wherein the preferred DNS server has a network address for the domain name; receiving from the user a request for access to a resource accessible through the network host; and routing to the preferred DNS server a DNS request for the network address of the network host, the DNS request including the domain name of the network host. In typical embodiments, mapping a domain name to a network address for a preferred DNS server is carried out by storing, through the data communication application, the domain name in association with the network address for a preferred DNS server in a data structure in computer memory.
    • 公开了用于用户定义的优选DNS路由的方法,系统和产品,其包括将数据通信应用中的用户映射到网络主机的域名到优选DNS服务器的网络地址,其中优选DNS服务器具有网络 地址为域名; 从用户接收对通过网络主机可访问的资源的访问请求; 并将首选DNS服务器路由到网络主机的网络地址的DNS请求,DNS请求包括网络主机的域名。 在典型的实施例中,将域名映射到优选DNS服务器的网络地址是通过数据通信应用与计算机存储器中的数据结构中的优选DNS服务器的网络地址相关联地存储域名来执行的 。
    • 3. 发明申请
    • Memory Pacing
    • 内存起搏
    • US20090254730A1
    • 2009-10-08
    • US12478830
    • 2009-06-05
    • Andrew DunsheaJos Manuel AccapadiCatherine Moriarty Nunez
    • Andrew DunsheaJos Manuel AccapadiCatherine Moriarty Nunez
    • G06F12/02
    • G06F12/1009Y10S707/99953Y10S707/99957
    • A method, system, and program for managing memory page requests in a multi-processor data processing system determines a threshold value of available memory, and dynamically adjusts an allocation time to fulfill a page request if the available memory is below a threshold value. The allocation time to fulfill the page request is based upon a percentage of available memory pages once a page stealer commences a scan for pages. An allocation wait time is inversely proportionally adjusted depending upon the percentage of available memory. The allocation wait time has a duration that increases in time as the percentage of available memory decreases and decreases in time as the percentage of available memory increases. More specifically, an average time per page to allocate a page including a scan time for the scan in computing the average time is determined. Then a tunable value is applied to the average time to determine a wait time. In a preferred embodiment, user defined values are received that would control the allocation wait time before fulfilling a page request.
    • 用于管理多处理器数据处理系统中的存储器页面请求的方法,系统和程序确定可用存储器的阈值,并且如果可用存储器低于阈值,则动态地调整分配时间以满足页面请求。 一旦页面窃取器开始扫描页面,则完成页面请求的分配时间基于可用内存页面的百分比。 分配等待时间根据可用内存的百分比进行反比例调整。 分配等待时间具有随时间增加的持续时间,随着可用内存的百分比的增加,可用内存的百分比随时间而减少。 更具体地,确定在计算平均时间时分配包括用于扫描的扫描时间的页面的每页的平均时间。 然后将可调值应用于平均时间以确定等待时间。 在优选实施例中,接收用户定义的值,其将在满足页面请求之前控制分配等待时间。
    • 5. 发明申请
    • METHOD AND APPARATUS FOR SHARING BUFFERS
    • 共享缓冲区的方法和设备
    • US20080244118A1
    • 2008-10-02
    • US11692579
    • 2007-03-28
    • JOS MANUEL ACCAPADIVANDANA MALLEMPATI
    • JOS MANUEL ACCAPADIVANDANA MALLEMPATI
    • G06F3/00
    • G06F12/023
    • A computer implemented method, apparatus, and computer usable program product are provided for managing a plurality of buffers in a data processing system. A requester component requests a free buffer of a certain size. A buffer agent determines whether a set of free buffers, whose combined size is equal to or greater than the requested buffer size, is available from a set of donor components. If the set of free buffers is available, the buffer agent combines the free buffers into a combined free buffer of size equal to or greater than the requested size, and removes the free buffers from a free buffer list of a corresponding donor component. The buffer agent then allocates the combined free buffer to the requester component.
    • 提供了一种计算机实现的方法,装置和计算机可用程序产品,用于管理数据处理系统中的多个缓冲器。 请求者组件请求一定大小的空闲缓冲区。 缓冲代理确定一组可用缓冲器,其组合大小等于或大于所请求的缓冲器大小,可从一组供体组件获得。 如果该组可用缓冲器可用,则缓冲器代理将空闲缓冲器组合成大小等于或大于所请求大小的组合空闲缓冲器,并从相应的供体组件的空闲缓冲器列表中移除空闲缓冲器。 缓冲代理然后将组合的空闲缓冲区分配给请求者组件。
    • 6. 发明申请
    • METHOD FOR TRADING RESOURCES BETWEEN PARTITIONS OF A DATA PROCESSING SYSTEM
    • 用于在数据处理系统的分组之间交换资源的方法
    • US20080168457A1
    • 2008-07-10
    • US11621637
    • 2007-01-10
    • JOS MANUEL ACCAPADIANDREW DUNSHEADIANE GARZA FLEMMINGCATHERINE MORIARTY NUNEZ
    • JOS MANUEL ACCAPADIANDREW DUNSHEADIANE GARZA FLEMMINGCATHERINE MORIARTY NUNEZ
    • G06F9/46
    • G06F9/5077
    • A method is provided for a data processing system configured to include multiple logical partitions, wherein resources of the system are selectively allocated among respective partitions. In the method, an entity such as a Partition Load Manager or a separate background process is used to manage resources based on locality levels. The method includes the step of evaluating the allocation of resources to each of the partitions at a particular time, in order to select a partition having at least one resource considered to be of low desirability due to its level of locality with respect to the selected partition. The method further comprises identifying each of the other partitions that has a resource matching the resource of low desirability, and determining the overall benefit to the system that would result from trading the resource of low desirability for the matching resource of each of the identified partitions. Resources are reallocated to trade the resource of low desirability for the matching resource of the identified partition that is determined to provide the greatest overall benefit for the system, provided that at least some overall system benefit will result from the reallocation.
    • 提供了一种用于数据处理系统的方法,所述数据处理系统被配置为包括多个逻辑分区,其中所述系统的资源在各个分区之间被选择性地分配。 在该方法中,使用诸如分区加载管理器或单独的后台进程的实体来基于地点级别来管理资源。 该方法包括在特定时间评估对每个分区的资源分配的步骤,以便由于其相对于所选择的分区的局部性水平而选择具有被认为是低可取性的至少一个资源的分区 。 该方法还包括识别具有与低可靠性的资源匹配的资源的每个其他分区,以及确定由对于每个所识别的分区的匹配资源的低期望性的资源进行交易而导致的系统的总体利益。 重新分配资源以交换被确定为系统提供最大整体利益的所识别分区的匹配资源的低可用性资源,前提是至少部分整体系统利益将由重新分配产生。