会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 41. 发明授权
    • Efficient memory update process for well behaved applications executing on a weakly-ordered processor
    • 在弱有序处理器上执行的良好行为应用程序的高效内存更新过程
    • US08447955B2
    • 2013-05-21
    • US12259699
    • 2008-10-28
    • Andrew DunsheaSatya Prakash SharmaMysore Sathyanarayana Srinivas
    • Andrew DunsheaSatya Prakash SharmaMysore Sathyanarayana Srinivas
    • G06F9/30
    • G06F12/0837G06F9/3004G06F9/30087G06F9/3834G06F9/3836G06F9/3857
    • A multiprocessor data processing system (MDPS) with a weakly-ordered architecture providing processing logic for substantially eliminating issuing sync instructions after every store instruction of a well-behaved application. Instructions of a well-behaved application are translated and executed by a weakly-ordered processor. The processing logic includes a lock address tracking utility (LATU), which provides an algorithm and a table of lock addresses, within which each lock address is stored when the lock is acquired by the weakly-ordered processor. When a store instruction is encountered in the instruction stream, the LATU compares the target address of the store instruction against the table of lock addresses. If the target address matches one of the lock addresses, indicating that the store instruction is the corresponding unlock instruction (or lock release instruction), a sync instruction is issued ahead of the store operation. The sync causes all values updated by the intermediate store operations to be flushed out to the point of coherency and be visible to all processors.
    • 具有弱有序体系结构的多处理器数据处理系统(MDPS)提供处理逻辑,用于在运行良好的应用的每个存储指令之后基本上消除发出同步指令。 良好的应用程序的指令由弱有序的处理器转换和执行。 处理逻辑包括一个锁定地址跟踪实用程序(LATU),它提供一种算法和一个锁定地址表,当弱锁定处理器获取锁时,锁存地址被存储在该地址中。 当在指令流中遇到存储指令时,LATU将存储指令的目标地址与锁定地址表进行比较。 如果目标地址与其中一个锁定地址匹配,指示存储指令是相应的解锁指令(或锁定释放指令),则在存储操作之前发出同步指令。 同步使得由中间存储操作更新的所有值被刷新到一致性点,并且对于所有处理器可见。
    • 42. 发明授权
    • 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服务器的网络地址相关联地存储域名来执行的 。
    • 43. 发明授权
    • System, method and computer program product for application-level cache-mapping awareness and reallocation requests
    • 系统,方法和计算机程序产品,用于应用级缓存映射感知和重新分配请求
    • US07721047B2
    • 2010-05-18
    • US11006112
    • 2004-12-07
    • Andrew DunsheaDiane Garza Flemming
    • Andrew DunsheaDiane Garza Flemming
    • G06F13/00G06F13/28
    • G06F12/0864G06F12/1045
    • In view of the foregoing, the shortcomings of the prior art cache optimization techniques, the present invention provides an improved method, system, and computer program product that can optimize cache utilization. In one embodiment, an application requests a kernel cache map from a kernel service and the application receives the kernel. The application designs an optimum cache footprint for a data set from said application. The objects, advantages and features of the present invention will become apparent from the following detailed description. In one embodiment of the present invention, the application transmits a memory reallocation order to a memory manager. In one embodiment of the present invention, the step of the application transmitting a memory reallocation order to the memory manager further comprises the application transmitting a memory reallocation order containing the optimum cache footprint to the memory manager. In one embodiment of the present invention, the step of the application transmitting a memory reallocation order to a memory manager further comprises the application transmitting the memory reallocation order containing to a reallocation services tool within the memory manager.
    • 鉴于上述情况,现有技术的高速缓存优化技术的缺点在于本发明提供了可以优化高速缓存利用的改进的方法,系统和计算机程序产品。 在一个实施例中,应用程序从内核服务请求内核缓存映射,并且应用程序接收内核。 该应用程序为来自所述应用的数据集设计了最佳缓存占用。 从下面的详细描述中,本发明的目的,优点和特征将变得显而易见。 在本发明的一个实施例中,应用程序将存储器重新分配顺序发送到存储器管理器。 在本发明的一个实施例中,向存储器管理器发送存储器重分配顺序的应用程序的步骤还包括向存储器管理器发送包含最佳高速缓存占用空间的存储器重新分配顺序的应用程序。 在本发明的一个实施例中,向存储器管理器发送存储器重新分配顺序的应用程序的步骤还包括将包含在存储器管理器内的重新分配服务工具的​​存储器重新分配顺序传送的应用。
    • 44. 发明申请
    • 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.
    • 用于管理多处理器数据处理系统中的存储器页面请求的方法,系统和程序确定可用存储器的阈值,并且如果可用存储器低于阈值,则动态地调整分配时间以满足页面请求。 一旦页面窃取器开始扫描页面,则完成页面请求的分配时间基于可用内存页面的百分比。 分配等待时间根据可用内存的百分比进行反比例调整。 分配等待时间具有随时间增加的持续时间,随着可用内存的百分比的增加,可用内存的百分比随时间而减少。 更具体地,确定在计算平均时间时分配包括用于扫描的扫描时间的页面的每页的平均时间。 然后将可调值应用于平均时间以确定等待时间。 在优选实施例中,接收用户定义的值,其将在满足页面请求之前控制分配等待时间。
    • 47. 发明申请
    • IMPLEMENTING A FAST FILE SYNCHRONIZATION IN A DATA PROCESSING SYSTEM
    • 在数据处理系统中实现快速文件同步
    • US20080256324A1
    • 2008-10-16
    • US12143552
    • 2008-06-20
    • JOS M. ACCAPADIMathew AccapadiAndrew DunsheaDirk Michel
    • JOS M. ACCAPADIMathew AccapadiAndrew DunsheaDirk Michel
    • G06F12/00
    • G06F12/0804G06F3/0601G06F12/0866G06F2003/0692G06F2212/311
    • A system and method for implementing a fast file synchronization in a data processing system. A memory management unit divides a file stored in system memory into a collection of data block groups. In response to a master (e.g., processing unit, peripheral, etc.) modifying a first data block group among the collection of data block groups, the memory management unit writes a first block group number associated with the first data block group to system memory. In response to a master modifying a second data block group, the memory management unit writes the first data block group to a hard disk drive and writes a second data block group number associated with the second data block group to system memory. In response to a request to update modified data block groups of the file stored in the system memory to the hard disk drive, the memory management unit writes the second data block to the hard disk drive.
    • 一种用于在数据处理系统中实现快速文件同步的系统和方法。 存储器管理单元将存储在系统存储器中的文件划分成数据块组的集合。 响应于在数据块组的集合中修改第一数据块组的主(例如,处理单元,外围设备等),存储器管理单元将与第一数据块组相关联的第一块组号写入系统存储器 。 响应于主修改第二数据块组,存储器管理单元将第一数据块组写入硬盘驱动器,并将与第二数据块组相关联的第二数据块组编号写入系统存储器。 响应于将存储在系统存储器中的文件的修改的数据块组更新到硬盘驱动器的请求,存储器管理单元将第二数据块写入硬盘驱动器。
    • 48. 发明申请
    • 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.
    • 提供了一种用于数据处理系统的方法,所述数据处理系统被配置为包括多个逻辑分区,其中所述系统的资源在各个分区之间被选择性地分配。 在该方法中,使用诸如分区加载管理器或单独的后台进程的实体来基于地点级别来管理资源。 该方法包括在特定时间评估对每个分区的资源分配的步骤,以便由于其相对于所选择的分区的局部性水平而选择具有被认为是低可取性的至少一个资源的分区 。 该方法还包括识别具有与低可靠性的资源匹配的资源的每个其他分区,以及确定由对于每个所识别的分区的匹配资源的低期望性的资源进行交易而导致的系统的总体利益。 重新分配资源以交换被确定为系统提供最大整体利益的所识别分区的匹配资源的低可用性资源,前提是至少部分整体系统利益将由重新分配产生。